./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:38:46,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:38:46,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:38:46,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:38:46,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:38:46,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:38:46,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:38:46,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:38:46,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:38:46,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:38:46,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:38:46,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:38:46,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:38:46,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:38:46,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:38:46,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:38:46,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:38:46,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:38:46,589 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d [2025-03-03 15:38:46,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:38:46,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:38:46,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:38:46,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:38:46,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:38:46,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2025-03-03 15:38:48,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd322cae/8ab29c22bcf54d82bffc0dca640f9c9b/FLAGa1a8bccbc [2025-03-03 15:38:48,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:38:48,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2025-03-03 15:38:48,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd322cae/8ab29c22bcf54d82bffc0dca640f9c9b/FLAGa1a8bccbc [2025-03-03 15:38:49,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd322cae/8ab29c22bcf54d82bffc0dca640f9c9b [2025-03-03 15:38:49,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:38:49,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:38:49,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:38:49,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:38:49,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:38:49,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:38:49" (1/1) ... [2025-03-03 15:38:49,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d839858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:49, skipping insertion in model container [2025-03-03 15:38:49,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:38:49" (1/1) ... [2025-03-03 15:38:49,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:38:50,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c[378560,378573] [2025-03-03 15:38:50,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c[383339,383352] [2025-03-03 15:38:50,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:38:50,626 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:38:51,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c[378560,378573] [2025-03-03 15:38:51,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c[383339,383352] [2025-03-03 15:38:51,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:38:51,275 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:38:51,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51 WrapperNode [2025-03-03 15:38:51,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:38:51,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:38:51,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:38:51,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:38:51,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,757 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-03-03 15:38:51,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:38:51,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:38:51,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:38:51,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:38:51,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,899 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:38:51,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:51,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:38:52,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:38:52,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:38:52,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:38:52,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (1/1) ... [2025-03-03 15:38:52,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:38:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:52,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:38:52,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:38:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:38:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:38:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:38:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:38:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:38:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:38:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:38:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:38:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:38:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:38:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:38:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:38:52,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:38:52,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:38:58,879 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:38:58,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:38:59,091 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-03-03 15:38:59,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:38:59,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:38:59,146 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:38:59,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:38:59 BoogieIcfgContainer [2025-03-03 15:38:59,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:38:59,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:38:59,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:38:59,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:38:59,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:38:49" (1/3) ... [2025-03-03 15:38:59,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4de0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:38:59, skipping insertion in model container [2025-03-03 15:38:59,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:38:51" (2/3) ... [2025-03-03 15:38:59,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4de0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:38:59, skipping insertion in model container [2025-03-03 15:38:59,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:38:59" (3/3) ... [2025-03-03 15:38:59,156 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-2.c [2025-03-03 15:38:59,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:38:59,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.11.cil-2.c that has 7 procedures, 2564 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-03 15:38:59,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:38:59,278 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@795b55b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:38:59,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:38:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 15:38:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:38:59,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:59,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:59,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1808491916, now seen corresponding path program 1 times [2025-03-03 15:38:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089748198] [2025-03-03 15:38:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:38:59,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:38:59,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:59,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:38:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089748198] [2025-03-03 15:38:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089748198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:59,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:38:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:38:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892682710] [2025-03-03 15:38:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:59,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:38:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:59,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:38:59,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:38:59,887 INFO L87 Difference]: Start difference. First operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:00,729 INFO L93 Difference]: Finished difference Result 5513 states and 9981 transitions. [2025-03-03 15:39:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:39:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:00,757 INFO L225 Difference]: With dead ends: 5513 [2025-03-03 15:39:00,757 INFO L226 Difference]: Without dead ends: 2898 [2025-03-03 15:39:00,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:00,769 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 5115 mSDsluCounter, 9229 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 13711 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:00,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 13711 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:39:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-03-03 15:39:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2871. [2025-03-03 15:39:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7876200640341515) internal successors, (5025), 2814 states have internal predecessors, (5025), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-03 15:39:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5116 transitions. [2025-03-03 15:39:00,924 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5116 transitions. Word has length 167 [2025-03-03 15:39:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:00,924 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5116 transitions. [2025-03-03 15:39:00,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5116 transitions. [2025-03-03 15:39:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:00,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:00,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:39:00,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1308698826, now seen corresponding path program 1 times [2025-03-03 15:39:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090045678] [2025-03-03 15:39:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:00,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:00,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:00,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:00,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090045678] [2025-03-03 15:39:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090045678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:01,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008619468] [2025-03-03 15:39:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:01,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:01,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:01,156 INFO L87 Difference]: Start difference. First operand 2871 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:01,529 INFO L93 Difference]: Finished difference Result 3674 states and 6383 transitions. [2025-03-03 15:39:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:01,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:01,540 INFO L225 Difference]: With dead ends: 3674 [2025-03-03 15:39:01,540 INFO L226 Difference]: Without dead ends: 2943 [2025-03-03 15:39:01,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:01,544 INFO L435 NwaCegarLoop]: 4401 mSDtfsCounter, 4736 mSDsluCounter, 8657 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:01,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 13058 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-03-03 15:39:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2871. [2025-03-03 15:39:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7869085734614016) internal successors, (5023), 2814 states have internal predecessors, (5023), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-03 15:39:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5114 transitions. [2025-03-03 15:39:01,619 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5114 transitions. Word has length 167 [2025-03-03 15:39:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5114 transitions. [2025-03-03 15:39:01,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5114 transitions. [2025-03-03 15:39:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:01,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:01,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:39:01,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:01,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:01,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1139555051, now seen corresponding path program 1 times [2025-03-03 15:39:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:01,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207924354] [2025-03-03 15:39:01,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:01,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:01,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207924354] [2025-03-03 15:39:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207924354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063773910] [2025-03-03 15:39:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:01,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:01,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:01,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:01,814 INFO L87 Difference]: Start difference. First operand 2871 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:02,560 INFO L93 Difference]: Finished difference Result 4069 states and 6993 transitions. [2025-03-03 15:39:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:02,575 INFO L225 Difference]: With dead ends: 4069 [2025-03-03 15:39:02,576 INFO L226 Difference]: Without dead ends: 3338 [2025-03-03 15:39:02,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:02,579 INFO L435 NwaCegarLoop]: 4725 mSDtfsCounter, 5048 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:02,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 18972 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-03-03 15:39:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3219. [2025-03-03 15:39:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3132 states have (on average 1.7589399744572158) internal successors, (5509), 3136 states have internal predecessors, (5509), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-03 15:39:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5643 transitions. [2025-03-03 15:39:02,656 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5643 transitions. Word has length 167 [2025-03-03 15:39:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5643 transitions. [2025-03-03 15:39:02,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5643 transitions. [2025-03-03 15:39:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:02,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:02,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:39:02,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1221205846, now seen corresponding path program 1 times [2025-03-03 15:39:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710612436] [2025-03-03 15:39:02,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:02,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:02,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:02,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:02,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:02,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710612436] [2025-03-03 15:39:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710612436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:02,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008192519] [2025-03-03 15:39:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:02,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:02,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:02,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:02,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:02,833 INFO L87 Difference]: Start difference. First operand 3219 states and 5643 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:03,621 INFO L93 Difference]: Finished difference Result 5174 states and 8701 transitions. [2025-03-03 15:39:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:03,643 INFO L225 Difference]: With dead ends: 5174 [2025-03-03 15:39:03,643 INFO L226 Difference]: Without dead ends: 4095 [2025-03-03 15:39:03,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:03,649 INFO L435 NwaCegarLoop]: 4721 mSDtfsCounter, 5043 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 18956 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:03,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 18956 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-03-03 15:39:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3958. [2025-03-03 15:39:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3815 states have (on average 1.7195281782437746) internal successors, (6560), 3823 states have internal predecessors, (6560), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-03 15:39:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6786 transitions. [2025-03-03 15:39:03,785 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6786 transitions. Word has length 167 [2025-03-03 15:39:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:03,785 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6786 transitions. [2025-03-03 15:39:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6786 transitions. [2025-03-03 15:39:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:03,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:03,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:39:03,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1196492555, now seen corresponding path program 1 times [2025-03-03 15:39:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650624814] [2025-03-03 15:39:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:03,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:03,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:03,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:03,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650624814] [2025-03-03 15:39:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650624814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094767143] [2025-03-03 15:39:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:03,956 INFO L87 Difference]: Start difference. First operand 3958 states and 6786 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:04,879 INFO L93 Difference]: Finished difference Result 7551 states and 12454 transitions. [2025-03-03 15:39:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:04,905 INFO L225 Difference]: With dead ends: 7551 [2025-03-03 15:39:04,905 INFO L226 Difference]: Without dead ends: 5733 [2025-03-03 15:39:04,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:04,912 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5038 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 18944 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:04,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 18944 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:39:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-03-03 15:39:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5559. [2025-03-03 15:39:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 5298 states have (on average 1.6776141940354852) internal successors, (8888), 5320 states have internal predecessors, (8888), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-03 15:39:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9322 transitions. [2025-03-03 15:39:05,066 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9322 transitions. Word has length 167 [2025-03-03 15:39:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:05,067 INFO L471 AbstractCegarLoop]: Abstraction has 5559 states and 9322 transitions. [2025-03-03 15:39:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9322 transitions. [2025-03-03 15:39:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:05,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:05,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:05,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:39:05,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:05,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1274482826, now seen corresponding path program 1 times [2025-03-03 15:39:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233506453] [2025-03-03 15:39:05,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:05,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:05,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:05,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:05,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233506453] [2025-03-03 15:39:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233506453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211447342] [2025-03-03 15:39:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:05,206 INFO L87 Difference]: Start difference. First operand 5559 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:06,008 INFO L93 Difference]: Finished difference Result 12778 states and 20948 transitions. [2025-03-03 15:39:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:06,051 INFO L225 Difference]: With dead ends: 12778 [2025-03-03 15:39:06,052 INFO L226 Difference]: Without dead ends: 9359 [2025-03-03 15:39:06,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:06,063 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5033 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:06,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 18932 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-03-03 15:39:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9112. [2025-03-03 15:39:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6503431429568454) internal successors, (14188), 8665 states have internal predecessors, (14188), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 15:39:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15134 transitions. [2025-03-03 15:39:06,335 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15134 transitions. Word has length 167 [2025-03-03 15:39:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15134 transitions. [2025-03-03 15:39:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15134 transitions. [2025-03-03 15:39:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:06,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:06,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:06,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:39:06,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1078306005, now seen corresponding path program 1 times [2025-03-03 15:39:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961921813] [2025-03-03 15:39:06,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:06,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:06,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:06,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:06,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:06,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961921813] [2025-03-03 15:39:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961921813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:06,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758692016] [2025-03-03 15:39:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:06,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:06,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:06,464 INFO L87 Difference]: Start difference. First operand 9112 states and 15134 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:06,905 INFO L93 Difference]: Finished difference Result 17578 states and 29308 transitions. [2025-03-03 15:39:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:06,947 INFO L225 Difference]: With dead ends: 17578 [2025-03-03 15:39:06,948 INFO L226 Difference]: Without dead ends: 10606 [2025-03-03 15:39:06,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:06,969 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4728 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 13020 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:06,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 13020 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2025-03-03 15:39:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 9112. [2025-03-03 15:39:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6483657089682446) internal successors, (14171), 8665 states have internal predecessors, (14171), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 15:39:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15117 transitions. [2025-03-03 15:39:07,272 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15117 transitions. Word has length 167 [2025-03-03 15:39:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15117 transitions. [2025-03-03 15:39:07,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15117 transitions. [2025-03-03 15:39:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:07,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:07,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:07,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:39:07,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2137119244, now seen corresponding path program 1 times [2025-03-03 15:39:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325421148] [2025-03-03 15:39:07,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:07,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:07,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:07,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:07,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325421148] [2025-03-03 15:39:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325421148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112655885] [2025-03-03 15:39:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:07,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:07,505 INFO L87 Difference]: Start difference. First operand 9112 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:08,057 INFO L93 Difference]: Finished difference Result 17495 states and 29108 transitions. [2025-03-03 15:39:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:08,091 INFO L225 Difference]: With dead ends: 17495 [2025-03-03 15:39:08,091 INFO L226 Difference]: Without dead ends: 10523 [2025-03-03 15:39:08,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:08,110 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4725 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 13012 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:08,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 13012 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:39:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2025-03-03 15:39:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 9112. [2025-03-03 15:39:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6463882749796441) internal successors, (14154), 8665 states have internal predecessors, (14154), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 15:39:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15100 transitions. [2025-03-03 15:39:08,406 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15100 transitions. Word has length 167 [2025-03-03 15:39:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:08,408 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15100 transitions. [2025-03-03 15:39:08,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15100 transitions. [2025-03-03 15:39:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:08,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:08,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:08,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:39:08,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2102295307, now seen corresponding path program 1 times [2025-03-03 15:39:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746915615] [2025-03-03 15:39:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:08,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:08,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746915615] [2025-03-03 15:39:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746915615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475082458] [2025-03-03 15:39:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:08,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:08,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:08,542 INFO L87 Difference]: Start difference. First operand 9112 states and 15100 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:09,587 INFO L93 Difference]: Finished difference Result 24277 states and 40176 transitions. [2025-03-03 15:39:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:09,640 INFO L225 Difference]: With dead ends: 24277 [2025-03-03 15:39:09,640 INFO L226 Difference]: Without dead ends: 17305 [2025-03-03 15:39:09,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:09,666 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5009 mSDsluCounter, 14170 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 18868 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:09,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 18868 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2025-03-03 15:39:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16974. [2025-03-03 15:39:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6395546329496131) internal successors, (26064), 16111 states have internal predecessors, (26064), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-03 15:39:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28418 transitions. [2025-03-03 15:39:10,240 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28418 transitions. Word has length 167 [2025-03-03 15:39:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:10,241 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28418 transitions. [2025-03-03 15:39:10,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28418 transitions. [2025-03-03 15:39:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:10,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:10,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:10,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:39:10,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 254132692, now seen corresponding path program 1 times [2025-03-03 15:39:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573303506] [2025-03-03 15:39:10,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:10,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:10,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:10,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:10,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573303506] [2025-03-03 15:39:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573303506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170723007] [2025-03-03 15:39:10,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:10,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:10,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:10,337 INFO L87 Difference]: Start difference. First operand 16974 states and 28418 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:10,978 INFO L93 Difference]: Finished difference Result 35483 states and 60552 transitions. [2025-03-03 15:39:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:11,039 INFO L225 Difference]: With dead ends: 35483 [2025-03-03 15:39:11,039 INFO L226 Difference]: Without dead ends: 20649 [2025-03-03 15:39:11,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:11,059 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4721 mSDsluCounter, 8618 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 12998 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 12998 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2025-03-03 15:39:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 16974. [2025-03-03 15:39:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.637478769579166) internal successors, (26031), 16111 states have internal predecessors, (26031), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-03 15:39:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28385 transitions. [2025-03-03 15:39:11,519 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28385 transitions. Word has length 167 [2025-03-03 15:39:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28385 transitions. [2025-03-03 15:39:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28385 transitions. [2025-03-03 15:39:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:11,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:11,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:39:11,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:11,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1193874155, now seen corresponding path program 1 times [2025-03-03 15:39:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207863846] [2025-03-03 15:39:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:11,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:11,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:11,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207863846] [2025-03-03 15:39:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207863846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244716043] [2025-03-03 15:39:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:11,622 INFO L87 Difference]: Start difference. First operand 16974 states and 28385 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:12,478 INFO L93 Difference]: Finished difference Result 35238 states and 59996 transitions. [2025-03-03 15:39:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:12,613 INFO L225 Difference]: With dead ends: 35238 [2025-03-03 15:39:12,613 INFO L226 Difference]: Without dead ends: 20404 [2025-03-03 15:39:12,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:12,635 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4718 mSDsluCounter, 8613 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12990 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:12,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12990 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:39:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2025-03-03 15:39:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 16974. [2025-03-03 15:39:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6354029062087185) internal successors, (25998), 16111 states have internal predecessors, (25998), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-03 15:39:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28352 transitions. [2025-03-03 15:39:13,125 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28352 transitions. Word has length 167 [2025-03-03 15:39:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28352 transitions. [2025-03-03 15:39:13,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28352 transitions. [2025-03-03 15:39:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:13,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:13,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:13,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:39:13,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 144889268, now seen corresponding path program 1 times [2025-03-03 15:39:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159416428] [2025-03-03 15:39:13,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:13,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:13,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:13,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:13,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159416428] [2025-03-03 15:39:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159416428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:13,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548234567] [2025-03-03 15:39:13,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:13,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:13,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:13,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:13,306 INFO L87 Difference]: Start difference. First operand 16974 states and 28352 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:15,089 INFO L93 Difference]: Finished difference Result 52501 states and 89027 transitions. [2025-03-03 15:39:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:15,200 INFO L225 Difference]: With dead ends: 52501 [2025-03-03 15:39:15,200 INFO L226 Difference]: Without dead ends: 37667 [2025-03-03 15:39:15,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:15,234 INFO L435 NwaCegarLoop]: 4683 mSDtfsCounter, 5332 mSDsluCounter, 14122 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 18805 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:15,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 18805 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:39:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37667 states. [2025-03-03 15:39:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37667 to 34465. [2025-03-03 15:39:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6466670815958175) internal successors, (52914), 32802 states have internal predecessors, (52914), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-03 15:39:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59556 transitions. [2025-03-03 15:39:16,379 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59556 transitions. Word has length 167 [2025-03-03 15:39:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59556 transitions. [2025-03-03 15:39:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59556 transitions. [2025-03-03 15:39:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:16,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:16,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:16,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:39:16,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:16,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash 326622517, now seen corresponding path program 1 times [2025-03-03 15:39:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:16,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336259949] [2025-03-03 15:39:16,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:16,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:16,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:16,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:16,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336259949] [2025-03-03 15:39:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336259949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:16,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330314563] [2025-03-03 15:39:16,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:16,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:16,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:16,471 INFO L87 Difference]: Start difference. First operand 34465 states and 59556 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:17,606 INFO L93 Difference]: Finished difference Result 75562 states and 134700 transitions. [2025-03-03 15:39:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:17,897 INFO L225 Difference]: With dead ends: 75562 [2025-03-03 15:39:17,897 INFO L226 Difference]: Without dead ends: 43237 [2025-03-03 15:39:17,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:17,963 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4712 mSDsluCounter, 8602 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12974 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:17,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12974 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43237 states. [2025-03-03 15:39:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43237 to 34465. [2025-03-03 15:39:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.644644301985436) internal successors, (52849), 32802 states have internal predecessors, (52849), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-03 15:39:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59491 transitions. [2025-03-03 15:39:19,771 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59491 transitions. Word has length 167 [2025-03-03 15:39:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:19,771 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59491 transitions. [2025-03-03 15:39:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59491 transitions. [2025-03-03 15:39:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:19,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:19,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:19,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:39:19,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 471032212, now seen corresponding path program 1 times [2025-03-03 15:39:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168479814] [2025-03-03 15:39:19,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:19,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168479814] [2025-03-03 15:39:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168479814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321359557] [2025-03-03 15:39:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:19,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:19,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:19,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:19,873 INFO L87 Difference]: Start difference. First operand 34465 states and 59491 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:21,679 INFO L93 Difference]: Finished difference Result 74100 states and 131646 transitions. [2025-03-03 15:39:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:21,794 INFO L225 Difference]: With dead ends: 74100 [2025-03-03 15:39:21,794 INFO L226 Difference]: Without dead ends: 41775 [2025-03-03 15:39:21,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:21,849 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4708 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:21,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12960 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2025-03-03 15:39:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 34465. [2025-03-03 15:39:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6426215223750544) internal successors, (52784), 32802 states have internal predecessors, (52784), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-03 15:39:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59426 transitions. [2025-03-03 15:39:23,175 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59426 transitions. Word has length 167 [2025-03-03 15:39:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:23,176 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59426 transitions. [2025-03-03 15:39:23,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59426 transitions. [2025-03-03 15:39:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:23,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:23,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:23,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:39:23,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:23,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1338871373, now seen corresponding path program 1 times [2025-03-03 15:39:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559444090] [2025-03-03 15:39:23,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:23,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:23,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559444090] [2025-03-03 15:39:23,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559444090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:23,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110414587] [2025-03-03 15:39:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:23,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:23,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:23,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:23,254 INFO L87 Difference]: Start difference. First operand 34465 states and 59426 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:25,058 INFO L93 Difference]: Finished difference Result 73369 states and 130054 transitions. [2025-03-03 15:39:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:25,204 INFO L225 Difference]: With dead ends: 73369 [2025-03-03 15:39:25,205 INFO L226 Difference]: Without dead ends: 41044 [2025-03-03 15:39:25,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:25,410 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4705 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12952 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:25,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12952 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41044 states. [2025-03-03 15:39:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41044 to 34465. [2025-03-03 15:39:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6405987427646729) internal successors, (52719), 32802 states have internal predecessors, (52719), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-03 15:39:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59361 transitions. [2025-03-03 15:39:26,815 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59361 transitions. Word has length 167 [2025-03-03 15:39:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:26,816 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59361 transitions. [2025-03-03 15:39:26,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59361 transitions. [2025-03-03 15:39:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:39:26,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:26,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:26,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:39:26,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1812897356, now seen corresponding path program 1 times [2025-03-03 15:39:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237262218] [2025-03-03 15:39:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:26,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:39:26,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:39:26,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:26,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237262218] [2025-03-03 15:39:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237262218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492911159] [2025-03-03 15:39:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:27,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:27,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:27,147 INFO L87 Difference]: Start difference. First operand 34465 states and 59361 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:29,993 INFO L93 Difference]: Finished difference Result 108112 states and 193016 transitions. [2025-03-03 15:39:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:29,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2025-03-03 15:39:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:30,248 INFO L225 Difference]: With dead ends: 108112 [2025-03-03 15:39:30,248 INFO L226 Difference]: Without dead ends: 75787 [2025-03-03 15:39:30,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:39:30,350 INFO L435 NwaCegarLoop]: 4661 mSDtfsCounter, 5150 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:30,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 18722 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:39:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states.