./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:30:15,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:30:15,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:30:15,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:30:15,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:30:15,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:30:15,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:30:15,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:30:15,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:30:15,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:30:15,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:30:15,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:30:15,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:30:15,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:30:15,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:30:15,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:30:15,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:30:15,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:30:15,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:15,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:30:15,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:30:15,391 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 -> 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 [2025-03-16 19:30:15,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:30:15,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:30:15,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:30:15,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:30:15,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:30:15,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:30:16,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95ead768/85912f7b65a946d5823679f9819f2f37/FLAGc52c4baa7 [2025-03-16 19:30:16,981 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:30:16,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:30:16,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95ead768/85912f7b65a946d5823679f9819f2f37/FLAGc52c4baa7 [2025-03-16 19:30:17,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95ead768/85912f7b65a946d5823679f9819f2f37 [2025-03-16 19:30:17,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:30:17,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:30:17,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:17,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:30:17,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:30:17,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f32b978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17, skipping insertion in model container [2025-03-16 19:30:17,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:30:17,522 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2025-03-16 19:30:17,536 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2025-03-16 19:30:17,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:17,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:30:17,610 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2025-03-16 19:30:17,623 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2025-03-16 19:30:17,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:17,652 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:30:17,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17 WrapperNode [2025-03-16 19:30:17,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:17,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:17,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:30:17,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:30:17,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,698 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 485 [2025-03-16 19:30:17,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:17,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:30:17,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:30:17,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:30:17,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,725 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-16 19:30:17,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:30:17,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:30:17,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:30:17,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:30:17,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (1/1) ... [2025-03-16 19:30:17,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:17,769 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-16 19:30:17,771 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-16 19:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:30:17,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:30:17,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:30:17,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node3__m3~2#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node2__m2~2#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L298: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1; [2025-03-16 19:30:18,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:30:18,255 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-16 19:30:18,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:30:18,263 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:30:18,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:30:18,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:18 BoogieIcfgContainer [2025-03-16 19:30:18,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:30:18,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:30:18,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:30:18,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:30:18,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:30:17" (1/3) ... [2025-03-16 19:30:18,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e409cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:18, skipping insertion in model container [2025-03-16 19:30:18,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:17" (2/3) ... [2025-03-16 19:30:18,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e409cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:18, skipping insertion in model container [2025-03-16 19:30:18,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:18" (3/3) ... [2025-03-16 19:30:18,274 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:30:18,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:30:18,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 105 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-16 19:30:18,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:30:18,349 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;@56d4f95f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:30:18,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:30:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 102 states have (on average 1.7549019607843137) internal successors, (179), 104 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:30:18,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:18,359 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] [2025-03-16 19:30:18,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:18,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1281253133, now seen corresponding path program 1 times [2025-03-16 19:30:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:18,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74821241] [2025-03-16 19:30:18,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:30:18,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:30:18,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:18,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:18,739 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-16 19:30:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74821241] [2025-03-16 19:30:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74821241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610008885] [2025-03-16 19:30:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:18,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:18,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:18,761 INFO L87 Difference]: Start difference. First operand has 105 states, 102 states have (on average 1.7549019607843137) internal successors, (179), 104 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:18,950 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2025-03-16 19:30:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:30:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-16 19:30:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:18,958 INFO L225 Difference]: With dead ends: 421 [2025-03-16 19:30:18,958 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 19:30:18,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:18,961 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 529 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:18,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1053 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 19:30:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 155. [2025-03-16 19:30:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 154 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2025-03-16 19:30:18,995 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 46 [2025-03-16 19:30:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:18,995 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2025-03-16 19:30:18,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2025-03-16 19:30:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:30:18,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:18,996 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] [2025-03-16 19:30:18,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:30:18,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:18,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:18,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1068328151, now seen corresponding path program 1 times [2025-03-16 19:30:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264005021] [2025-03-16 19:30:18,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:19,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:30:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:30:19,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:19,240 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-16 19:30:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264005021] [2025-03-16 19:30:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264005021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:19,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:19,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:19,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399011246] [2025-03-16 19:30:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:19,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:19,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:19,242 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,336 INFO L93 Difference]: Finished difference Result 246 states and 358 transitions. [2025-03-16 19:30:19,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:19,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 19:30:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:19,338 INFO L225 Difference]: With dead ends: 246 [2025-03-16 19:30:19,338 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 19:30:19,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:19,339 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 85 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:19,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 437 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 19:30:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-16 19:30:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 156 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2025-03-16 19:30:19,368 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 47 [2025-03-16 19:30:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2025-03-16 19:30:19,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2025-03-16 19:30:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:30:19,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:19,371 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] [2025-03-16 19:30:19,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:30:19,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash -980685615, now seen corresponding path program 1 times [2025-03-16 19:30:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83922193] [2025-03-16 19:30:19,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:19,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:30:19,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:30:19,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:19,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:19,493 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-16 19:30:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:19,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83922193] [2025-03-16 19:30:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83922193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168651693] [2025-03-16 19:30:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:19,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:19,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:19,495 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,568 INFO L93 Difference]: Finished difference Result 477 states and 706 transitions. [2025-03-16 19:30:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 19:30:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:19,570 INFO L225 Difference]: With dead ends: 477 [2025-03-16 19:30:19,570 INFO L226 Difference]: Without dead ends: 393 [2025-03-16 19:30:19,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:19,571 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 310 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:19,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 670 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-16 19:30:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 250. [2025-03-16 19:30:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.471774193548387) internal successors, (365), 249 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 365 transitions. [2025-03-16 19:30:19,580 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 365 transitions. Word has length 48 [2025-03-16 19:30:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:19,580 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 365 transitions. [2025-03-16 19:30:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 365 transitions. [2025-03-16 19:30:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:30:19,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:19,581 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] [2025-03-16 19:30:19,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:30:19,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 308247241, now seen corresponding path program 1 times [2025-03-16 19:30:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457176597] [2025-03-16 19:30:19,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:19,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:30:19,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:30:19,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:19,686 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-16 19:30:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457176597] [2025-03-16 19:30:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457176597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:19,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417808126] [2025-03-16 19:30:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:19,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:19,687 INFO L87 Difference]: Start difference. First operand 250 states and 365 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,759 INFO L93 Difference]: Finished difference Result 570 states and 849 transitions. [2025-03-16 19:30:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 19:30:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:19,760 INFO L225 Difference]: With dead ends: 570 [2025-03-16 19:30:19,761 INFO L226 Difference]: Without dead ends: 486 [2025-03-16 19:30:19,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:19,762 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 303 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:19,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 550 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-16 19:30:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 386. [2025-03-16 19:30:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.4921875) internal successors, (573), 385 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 573 transitions. [2025-03-16 19:30:19,781 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 573 transitions. Word has length 48 [2025-03-16 19:30:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:19,782 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 573 transitions. [2025-03-16 19:30:19,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 573 transitions. [2025-03-16 19:30:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:30:19,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:19,784 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] [2025-03-16 19:30:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:30:19,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1836093487, now seen corresponding path program 1 times [2025-03-16 19:30:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314794040] [2025-03-16 19:30:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:30:19,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:30:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:19,912 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-16 19:30:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314794040] [2025-03-16 19:30:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314794040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010704076] [2025-03-16 19:30:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:19,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:19,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:19,915 INFO L87 Difference]: Start difference. First operand 386 states and 573 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,993 INFO L93 Difference]: Finished difference Result 658 states and 984 transitions. [2025-03-16 19:30:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 19:30:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:19,996 INFO L225 Difference]: With dead ends: 658 [2025-03-16 19:30:19,996 INFO L226 Difference]: Without dead ends: 574 [2025-03-16 19:30:19,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:19,997 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 363 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:19,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 563 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-16 19:30:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 474. [2025-03-16 19:30:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.5) internal successors, (708), 473 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 708 transitions. [2025-03-16 19:30:20,016 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 708 transitions. Word has length 48 [2025-03-16 19:30:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 708 transitions. [2025-03-16 19:30:20,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 708 transitions. [2025-03-16 19:30:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:30:20,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:20,018 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] [2025-03-16 19:30:20,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:30:20,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:20,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -332296301, now seen corresponding path program 1 times [2025-03-16 19:30:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320439414] [2025-03-16 19:30:20,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:20,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:30:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:30:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:20,109 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-16 19:30:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320439414] [2025-03-16 19:30:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320439414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266625516] [2025-03-16 19:30:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:20,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:20,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:20,111 INFO L87 Difference]: Start difference. First operand 474 states and 708 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:20,236 INFO L93 Difference]: Finished difference Result 1340 states and 2025 transitions. [2025-03-16 19:30:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-16 19:30:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:20,238 INFO L225 Difference]: With dead ends: 1340 [2025-03-16 19:30:20,239 INFO L226 Difference]: Without dead ends: 887 [2025-03-16 19:30:20,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:20,240 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 568 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:20,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 136 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-16 19:30:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 882. [2025-03-16 19:30:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.5068181818181818) internal successors, (1326), 881 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1326 transitions. [2025-03-16 19:30:20,254 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1326 transitions. Word has length 49 [2025-03-16 19:30:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:20,254 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1326 transitions. [2025-03-16 19:30:20,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1326 transitions. [2025-03-16 19:30:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:30:20,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:20,255 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] [2025-03-16 19:30:20,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:30:20,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 165566551, now seen corresponding path program 1 times [2025-03-16 19:30:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580411705] [2025-03-16 19:30:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:20,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:30:20,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:30:20,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:20,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:20,339 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-16 19:30:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580411705] [2025-03-16 19:30:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580411705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:20,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072296453] [2025-03-16 19:30:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:20,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:20,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:20,341 INFO L87 Difference]: Start difference. First operand 882 states and 1326 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:20,434 INFO L93 Difference]: Finished difference Result 1739 states and 2626 transitions. [2025-03-16 19:30:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 19:30:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:20,437 INFO L225 Difference]: With dead ends: 1739 [2025-03-16 19:30:20,437 INFO L226 Difference]: Without dead ends: 882 [2025-03-16 19:30:20,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:20,438 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 369 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:20,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 89 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-16 19:30:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-16 19:30:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4852272727272726) internal successors, (1307), 881 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1307 transitions. [2025-03-16 19:30:20,461 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1307 transitions. Word has length 50 [2025-03-16 19:30:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:20,461 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1307 transitions. [2025-03-16 19:30:20,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1307 transitions. [2025-03-16 19:30:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:30:20,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:20,462 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] [2025-03-16 19:30:20,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:30:20,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1924077935, now seen corresponding path program 1 times [2025-03-16 19:30:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354128443] [2025-03-16 19:30:20,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:20,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:30:20,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:30:20,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:20,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:20,543 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-16 19:30:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354128443] [2025-03-16 19:30:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354128443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:20,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:20,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76545161] [2025-03-16 19:30:20,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:20,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:20,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:20,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:20,545 INFO L87 Difference]: Start difference. First operand 882 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:20,619 INFO L93 Difference]: Finished difference Result 1735 states and 2584 transitions. [2025-03-16 19:30:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 19:30:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:20,622 INFO L225 Difference]: With dead ends: 1735 [2025-03-16 19:30:20,623 INFO L226 Difference]: Without dead ends: 882 [2025-03-16 19:30:20,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:20,626 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 351 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:20,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 97 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-16 19:30:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-16 19:30:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4636363636363636) internal successors, (1288), 881 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1288 transitions. [2025-03-16 19:30:20,642 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1288 transitions. Word has length 51 [2025-03-16 19:30:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:20,643 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1288 transitions. [2025-03-16 19:30:20,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1288 transitions. [2025-03-16 19:30:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:30:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:20,644 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] [2025-03-16 19:30:20,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:30:20,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash -38082693, now seen corresponding path program 1 times [2025-03-16 19:30:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276692366] [2025-03-16 19:30:20,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:20,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:30:20,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:30:20,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:20,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:20,868 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-16 19:30:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276692366] [2025-03-16 19:30:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276692366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:30:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980337123] [2025-03-16 19:30:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:20,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:30:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:20,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:30:20,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:30:20,871 INFO L87 Difference]: Start difference. First operand 882 states and 1288 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,179 INFO L93 Difference]: Finished difference Result 2125 states and 3103 transitions. [2025-03-16 19:30:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:30:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:30:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:21,184 INFO L225 Difference]: With dead ends: 2125 [2025-03-16 19:30:21,184 INFO L226 Difference]: Without dead ends: 1331 [2025-03-16 19:30:21,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:30:21,187 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 368 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:21,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 376 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-03-16 19:30:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 882. [2025-03-16 19:30:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4602272727272727) internal successors, (1285), 881 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1285 transitions. [2025-03-16 19:30:21,209 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1285 transitions. Word has length 52 [2025-03-16 19:30:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:21,209 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1285 transitions. [2025-03-16 19:30:21,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1285 transitions. [2025-03-16 19:30:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:30:21,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,209 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] [2025-03-16 19:30:21,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:30:21,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1264130179, now seen corresponding path program 1 times [2025-03-16 19:30:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757360041] [2025-03-16 19:30:21,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:30:21,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:30:21,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,443 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-16 19:30:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757360041] [2025-03-16 19:30:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757360041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362854219] [2025-03-16 19:30:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:21,444 INFO L87 Difference]: Start difference. First operand 882 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:21,660 INFO L93 Difference]: Finished difference Result 2443 states and 3597 transitions. [2025-03-16 19:30:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:30:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:30:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:21,665 INFO L225 Difference]: With dead ends: 2443 [2025-03-16 19:30:21,665 INFO L226 Difference]: Without dead ends: 1661 [2025-03-16 19:30:21,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:30:21,667 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 510 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:21,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 333 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-16 19:30:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 882. [2025-03-16 19:30:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.459090909090909) internal successors, (1284), 881 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1284 transitions. [2025-03-16 19:30:21,686 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1284 transitions. Word has length 52 [2025-03-16 19:30:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:21,686 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1284 transitions. [2025-03-16 19:30:21,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1284 transitions. [2025-03-16 19:30:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:30:21,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,687 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] [2025-03-16 19:30:21,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:30:21,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1047099603, now seen corresponding path program 1 times [2025-03-16 19:30:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408770066] [2025-03-16 19:30:21,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:21,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:30:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:30:21,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:21,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:21,903 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-16 19:30:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408770066] [2025-03-16 19:30:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408770066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:21,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:21,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:30:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826215096] [2025-03-16 19:30:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:21,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:30:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:21,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:30:21,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:30:21,906 INFO L87 Difference]: Start difference. First operand 882 states and 1284 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,300 INFO L93 Difference]: Finished difference Result 2491 states and 3646 transitions. [2025-03-16 19:30:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:30:22,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:30:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,306 INFO L225 Difference]: With dead ends: 2491 [2025-03-16 19:30:22,306 INFO L226 Difference]: Without dead ends: 1712 [2025-03-16 19:30:22,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:22,308 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 411 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 565 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-16 19:30:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 882. [2025-03-16 19:30:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4522727272727274) internal successors, (1278), 881 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1278 transitions. [2025-03-16 19:30:22,330 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1278 transitions. Word has length 53 [2025-03-16 19:30:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,330 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1278 transitions. [2025-03-16 19:30:22,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1278 transitions. [2025-03-16 19:30:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:30:22,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,331 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] [2025-03-16 19:30:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:30:22,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 417325987, now seen corresponding path program 1 times [2025-03-16 19:30:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238660837] [2025-03-16 19:30:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:30:22,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:30:22,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,159 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-16 19:30:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238660837] [2025-03-16 19:30:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238660837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-16 19:30:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662498138] [2025-03-16 19:30:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:23,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:30:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:23,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:30:23,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:23,160 INFO L87 Difference]: Start difference. First operand 882 states and 1278 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:24,466 INFO L93 Difference]: Finished difference Result 1768 states and 2578 transitions. [2025-03-16 19:30:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:30:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:30:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:24,471 INFO L225 Difference]: With dead ends: 1768 [2025-03-16 19:30:24,472 INFO L226 Difference]: Without dead ends: 1423 [2025-03-16 19:30:24,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 19:30:24,473 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 780 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:24,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 3026 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:30:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-16 19:30:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 887. [2025-03-16 19:30:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.4497175141242937) internal successors, (1283), 886 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1283 transitions. [2025-03-16 19:30:24,495 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1283 transitions. Word has length 54 [2025-03-16 19:30:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1283 transitions. [2025-03-16 19:30:24,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1283 transitions. [2025-03-16 19:30:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:30:24,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:24,496 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] [2025-03-16 19:30:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:30:24,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1571470459, now seen corresponding path program 1 times [2025-03-16 19:30:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293087652] [2025-03-16 19:30:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:24,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:30:24,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:30:24,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:24,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:25,211 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-16 19:30:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293087652] [2025-03-16 19:30:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293087652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-16 19:30:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229289897] [2025-03-16 19:30:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:30:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:25,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:30:25,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:25,213 INFO L87 Difference]: Start difference. First operand 887 states and 1283 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:26,515 INFO L93 Difference]: Finished difference Result 1762 states and 2568 transitions. [2025-03-16 19:30:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:30:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:30:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:26,518 INFO L225 Difference]: With dead ends: 1762 [2025-03-16 19:30:26,518 INFO L226 Difference]: Without dead ends: 1423 [2025-03-16 19:30:26,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:30:26,519 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 823 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:26,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 3198 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:30:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-16 19:30:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 887. [2025-03-16 19:30:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.448587570621469) internal successors, (1282), 886 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1282 transitions. [2025-03-16 19:30:26,532 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1282 transitions. Word has length 54 [2025-03-16 19:30:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:26,532 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1282 transitions. [2025-03-16 19:30:26,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1282 transitions. [2025-03-16 19:30:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:30:26,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:26,533 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] [2025-03-16 19:30:26,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:30:26,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash 489515347, now seen corresponding path program 1 times [2025-03-16 19:30:26,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695512298] [2025-03-16 19:30:26,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:26,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:30:26,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:30:26,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:26,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:26,903 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-16 19:30:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695512298] [2025-03-16 19:30:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695512298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:30:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583171314] [2025-03-16 19:30:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:30:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:26,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:30:26,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:30:26,905 INFO L87 Difference]: Start difference. First operand 887 states and 1282 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:27,297 INFO L93 Difference]: Finished difference Result 1981 states and 2908 transitions. [2025-03-16 19:30:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:30:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 19:30:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:27,301 INFO L225 Difference]: With dead ends: 1981 [2025-03-16 19:30:27,302 INFO L226 Difference]: Without dead ends: 1621 [2025-03-16 19:30:27,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:30:27,303 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 379 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:27,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 989 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2025-03-16 19:30:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 860. [2025-03-16 19:30:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.451048951048951) internal successors, (1245), 859 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1245 transitions. [2025-03-16 19:30:27,319 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1245 transitions. Word has length 54 [2025-03-16 19:30:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:27,319 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1245 transitions. [2025-03-16 19:30:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1245 transitions. [2025-03-16 19:30:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:30:27,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:27,320 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] [2025-03-16 19:30:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:30:27,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:27,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1769072657, now seen corresponding path program 1 times [2025-03-16 19:30:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133643551] [2025-03-16 19:30:27,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:30:27,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:30:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:27,705 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-16 19:30:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133643551] [2025-03-16 19:30:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133643551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:30:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100925976] [2025-03-16 19:30:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:27,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:30:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:27,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:30:27,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:30:27,706 INFO L87 Difference]: Start difference. First operand 860 states and 1245 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:28,091 INFO L93 Difference]: Finished difference Result 1193 states and 1742 transitions. [2025-03-16 19:30:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:30:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 19:30:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:28,093 INFO L225 Difference]: With dead ends: 1193 [2025-03-16 19:30:28,093 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 19:30:28,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:30:28,097 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 308 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:28,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 801 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 19:30:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 19:30:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.4566265060240964) internal successors, (1209), 831 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1209 transitions. [2025-03-16 19:30:28,107 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1209 transitions. Word has length 55 [2025-03-16 19:30:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:28,107 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1209 transitions. [2025-03-16 19:30:28,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1209 transitions. [2025-03-16 19:30:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:30:28,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:28,107 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] [2025-03-16 19:30:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:30:28,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 252230733, now seen corresponding path program 1 times [2025-03-16 19:30:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232058525] [2025-03-16 19:30:28,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:28,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:30:28,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:30:28,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:28,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:28,503 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-16 19:30:28,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:28,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232058525] [2025-03-16 19:30:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232058525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:28,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:30:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314668615] [2025-03-16 19:30:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:30:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:28,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:30:28,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:30:28,505 INFO L87 Difference]: Start difference. First operand 832 states and 1209 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,040 INFO L93 Difference]: Finished difference Result 1919 states and 2831 transitions. [2025-03-16 19:30:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:30:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 19:30:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,044 INFO L225 Difference]: With dead ends: 1919 [2025-03-16 19:30:29,044 INFO L226 Difference]: Without dead ends: 1574 [2025-03-16 19:30:29,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:30:29,046 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 449 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1258 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-16 19:30:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 812. [2025-03-16 19:30:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.4611590628853268) internal successors, (1185), 811 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1185 transitions. [2025-03-16 19:30:29,060 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1185 transitions. Word has length 55 [2025-03-16 19:30:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,060 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1185 transitions. [2025-03-16 19:30:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1185 transitions. [2025-03-16 19:30:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:30:29,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,061 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] [2025-03-16 19:30:29,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:30:29,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 124438816, now seen corresponding path program 1 times [2025-03-16 19:30:29,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935757809] [2025-03-16 19:30:29,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:30:29,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:30:29,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,106 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-16 19:30:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935757809] [2025-03-16 19:30:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935757809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411992737] [2025-03-16 19:30:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:29,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,107 INFO L87 Difference]: Start difference. First operand 812 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,128 INFO L93 Difference]: Finished difference Result 2176 states and 3207 transitions. [2025-03-16 19:30:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:30:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,132 INFO L225 Difference]: With dead ends: 2176 [2025-03-16 19:30:29,132 INFO L226 Difference]: Without dead ends: 1436 [2025-03-16 19:30:29,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,133 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 190 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-16 19:30:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2025-03-16 19:30:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.4374558303886926) internal successors, (2034), 1415 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2034 transitions. [2025-03-16 19:30:29,150 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2034 transitions. Word has length 74 [2025-03-16 19:30:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,151 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2034 transitions. [2025-03-16 19:30:29,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2034 transitions. [2025-03-16 19:30:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:30:29,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,154 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] [2025-03-16 19:30:29,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:30:29,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash 708757374, now seen corresponding path program 1 times [2025-03-16 19:30:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622509792] [2025-03-16 19:30:29,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:30:29,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:30:29,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,238 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-16 19:30:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622509792] [2025-03-16 19:30:29,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622509792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758978288] [2025-03-16 19:30:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:29,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,240 INFO L87 Difference]: Start difference. First operand 1416 states and 2034 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,258 INFO L93 Difference]: Finished difference Result 3960 states and 5696 transitions. [2025-03-16 19:30:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:30:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,264 INFO L225 Difference]: With dead ends: 3960 [2025-03-16 19:30:29,264 INFO L226 Difference]: Without dead ends: 2616 [2025-03-16 19:30:29,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,267 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 258 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-03-16 19:30:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2470. [2025-03-16 19:30:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.4264884568651275) internal successors, (3522), 2469 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3522 transitions. [2025-03-16 19:30:29,309 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3522 transitions. Word has length 75 [2025-03-16 19:30:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3522 transitions. [2025-03-16 19:30:29,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3522 transitions. [2025-03-16 19:30:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:30:29,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,311 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] [2025-03-16 19:30:29,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:30:29,311 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -398004972, now seen corresponding path program 1 times [2025-03-16 19:30:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103858855] [2025-03-16 19:30:29,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:30:29,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:30:29,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,382 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-16 19:30:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103858855] [2025-03-16 19:30:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103858855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469731247] [2025-03-16 19:30:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:29,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,384 INFO L87 Difference]: Start difference. First operand 2470 states and 3522 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,406 INFO L93 Difference]: Finished difference Result 6978 states and 9908 transitions. [2025-03-16 19:30:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:30:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,417 INFO L225 Difference]: With dead ends: 6978 [2025-03-16 19:30:29,417 INFO L226 Difference]: Without dead ends: 4580 [2025-03-16 19:30:29,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,421 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 256 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2025-03-16 19:30:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4290. [2025-03-16 19:30:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4289 states have (on average 1.4059221263697832) internal successors, (6030), 4289 states have internal predecessors, (6030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6030 transitions. [2025-03-16 19:30:29,472 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6030 transitions. Word has length 76 [2025-03-16 19:30:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 4290 states and 6030 transitions. [2025-03-16 19:30:29,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6030 transitions. [2025-03-16 19:30:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:30:29,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,473 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] [2025-03-16 19:30:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:30:29,474 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 118584683, now seen corresponding path program 1 times [2025-03-16 19:30:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454220410] [2025-03-16 19:30:29,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:30:29,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:30:29,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,615 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-16 19:30:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454220410] [2025-03-16 19:30:29,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454220410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:30:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781810273] [2025-03-16 19:30:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:30:29,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:30:29,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:29,617 INFO L87 Difference]: Start difference. First operand 4290 states and 6030 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,646 INFO L93 Difference]: Finished difference Result 4484 states and 6287 transitions. [2025-03-16 19:30:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:30:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:30:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,655 INFO L225 Difference]: With dead ends: 4484 [2025-03-16 19:30:29,655 INFO L226 Difference]: Without dead ends: 4482 [2025-03-16 19:30:29,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:29,657 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2025-03-16 19:30:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4482. [2025-03-16 19:30:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 4481 states have (on average 1.3796027672394555) internal successors, (6182), 4481 states have internal predecessors, (6182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 6182 transitions. [2025-03-16 19:30:29,703 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 6182 transitions. Word has length 77 [2025-03-16 19:30:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,703 INFO L471 AbstractCegarLoop]: Abstraction has 4482 states and 6182 transitions. [2025-03-16 19:30:29,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6182 transitions. [2025-03-16 19:30:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:30:29,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,704 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] [2025-03-16 19:30:29,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:30:29,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1191400239, now seen corresponding path program 1 times [2025-03-16 19:30:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373589275] [2025-03-16 19:30:29,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:30:29,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:30:29,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,760 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-16 19:30:29,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373589275] [2025-03-16 19:30:29,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373589275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005033562] [2025-03-16 19:30:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:29,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:29,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,763 INFO L87 Difference]: Start difference. First operand 4482 states and 6182 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,788 INFO L93 Difference]: Finished difference Result 11718 states and 16152 transitions. [2025-03-16 19:30:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:30:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,806 INFO L225 Difference]: With dead ends: 11718 [2025-03-16 19:30:29,806 INFO L226 Difference]: Without dead ends: 7308 [2025-03-16 19:30:29,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,812 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 262 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2025-03-16 19:30:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 6730. [2025-03-16 19:30:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.353841581215634) internal successors, (9110), 6729 states have internal predecessors, (9110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 9110 transitions. [2025-03-16 19:30:29,914 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 9110 transitions. Word has length 78 [2025-03-16 19:30:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,915 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 9110 transitions. [2025-03-16 19:30:29,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 9110 transitions. [2025-03-16 19:30:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:29,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:29,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:30:29,917 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:29,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1970493854, now seen corresponding path program 1 times [2025-03-16 19:30:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499011178] [2025-03-16 19:30:29,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:29,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:29,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499011178] [2025-03-16 19:30:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499011178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:29,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386276695] [2025-03-16 19:30:29,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:29,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:29,975 INFO L87 Difference]: Start difference. First operand 6730 states and 9110 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:30,007 INFO L93 Difference]: Finished difference Result 13390 states and 18144 transitions. [2025-03-16 19:30:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:30:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:30,018 INFO L225 Difference]: With dead ends: 13390 [2025-03-16 19:30:30,018 INFO L226 Difference]: Without dead ends: 6732 [2025-03-16 19:30:30,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:30,026 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:30,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 234 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2025-03-16 19:30:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 6730. [2025-03-16 19:30:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.332441670381929) internal successors, (8966), 6729 states have internal predecessors, (8966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 8966 transitions. [2025-03-16 19:30:30,102 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 8966 transitions. Word has length 99 [2025-03-16 19:30:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:30,103 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 8966 transitions. [2025-03-16 19:30:30,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 8966 transitions. [2025-03-16 19:30:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:30,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:30,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:30:30,105 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash -932513905, now seen corresponding path program 1 times [2025-03-16 19:30:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660557775] [2025-03-16 19:30:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:30,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:30,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:30,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:30,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:30,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660557775] [2025-03-16 19:30:30,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660557775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:30,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729823072] [2025-03-16 19:30:30,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:30,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:30,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:30,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:30:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:30,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:30,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:30,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:30,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 19:30:30,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:31,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729823072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:32,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 35 [2025-03-16 19:30:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364924660] [2025-03-16 19:30:32,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:32,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 19:30:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:32,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 19:30:32,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 19:30:32,674 INFO L87 Difference]: Start difference. First operand 6730 states and 8966 transitions. Second operand has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:40,691 INFO L93 Difference]: Finished difference Result 67716 states and 90458 transitions. [2025-03-16 19:30:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2025-03-16 19:30:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:30:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:40,790 INFO L225 Difference]: With dead ends: 67716 [2025-03-16 19:30:40,790 INFO L226 Difference]: Without dead ends: 61058 [2025-03-16 19:30:40,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14587 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4983, Invalid=38073, Unknown=0, NotChecked=0, Total=43056 [2025-03-16 19:30:40,815 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 6284 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6284 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 4406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6284 Valid, 2957 Invalid, 4406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:30:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61058 states. [2025-03-16 19:30:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61058 to 27649. [2025-03-16 19:30:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27649 states, 27648 states have (on average 1.3217954282407407) internal successors, (36545), 27648 states have internal predecessors, (36545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27649 states to 27649 states and 36545 transitions. [2025-03-16 19:30:41,305 INFO L78 Accepts]: Start accepts. Automaton has 27649 states and 36545 transitions. Word has length 99 [2025-03-16 19:30:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 27649 states and 36545 transitions. [2025-03-16 19:30:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27649 states and 36545 transitions. [2025-03-16 19:30:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:30:41,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:41,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:30:41,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:30:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 19:30:41,515 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1016280057, now seen corresponding path program 1 times [2025-03-16 19:30:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365762467] [2025-03-16 19:30:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:41,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:41,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:41,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365762467] [2025-03-16 19:30:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365762467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435804156] [2025-03-16 19:30:41,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:41,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:30:41,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:41,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:41,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:41,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-16 19:30:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:44,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435804156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:51,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 24] total 56 [2025-03-16 19:30:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025527985] [2025-03-16 19:30:51,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:51,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-16 19:30:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:51,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-16 19:30:51,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2857, Unknown=1, NotChecked=0, Total=3080 [2025-03-16 19:30:51,205 INFO L87 Difference]: Start difference. First operand 27649 states and 36545 transitions. Second operand has 56 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)