./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.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-var-start-time.6.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 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:29:23,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:29:23,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:29:23,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:29:23,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:29:23,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:29:23,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:29:23,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:29:23,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:29:23,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:29:23,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:29:23,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:29:23,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:29:23,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:29:23,187 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:29:23,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:29:23,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:29:23,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:29:23,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:29:23,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:29:23,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:29:23,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:23,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:29:23,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:29:23,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:29:23,190 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 -> 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 [2025-03-16 19:29:23,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:29:23,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:29:23,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:29:23,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:29:23,418 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:29:23,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:24,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479f40f95/07a9a572af8746ac96a1eda1fc38df59/FLAG5d995b78a [2025-03-16 19:29:24,780 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:29:24,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:24,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479f40f95/07a9a572af8746ac96a1eda1fc38df59/FLAG5d995b78a [2025-03-16 19:29:24,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479f40f95/07a9a572af8746ac96a1eda1fc38df59 [2025-03-16 19:29:24,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:29:24,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:29:24,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:24,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:29:24,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:29:24,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:24" (1/1) ... [2025-03-16 19:29:24,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456d88f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:24, skipping insertion in model container [2025-03-16 19:29:24,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:24" (1/1) ... [2025-03-16 19:29:24,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:29:25,002 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-16 19:29:25,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:25,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:29:25,121 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-16 19:29:25,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:25,156 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:29:25,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25 WrapperNode [2025-03-16 19:29:25,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:25,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:25,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:29:25,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:29:25,163 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:29:25" (1/1) ... [2025-03-16 19:29:25,174 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:29:25" (1/1) ... [2025-03-16 19:29:25,204 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1034 [2025-03-16 19:29:25,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:25,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:29:25,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:29:25,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:29:25,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,230 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:29:25,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:29:25,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:29:25,263 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:29:25,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:29:25,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (1/1) ... [2025-03-16 19:29:25,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:25,290 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:29:25,294 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:29:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:29:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:29:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:29:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:29:25,404 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:29:25,406 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:29:26,221 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1396: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3__m3~2#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node5__m5~2#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1142: havoc main_~node6____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1572: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1440: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_~node2__m2~2#1; [2025-03-16 19:29:26,223 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4__m4~2#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1484: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~node6____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:26,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:26,225 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:26,278 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-16 19:29:26,279 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:29:26,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:29:26,295 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:29:26,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:26 BoogieIcfgContainer [2025-03-16 19:29:26,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:29:26,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:29:26,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:29:26,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:29:26,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:29:24" (1/3) ... [2025-03-16 19:29:26,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8b1b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:26, skipping insertion in model container [2025-03-16 19:29:26,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:25" (2/3) ... [2025-03-16 19:29:26,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8b1b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:26, skipping insertion in model container [2025-03-16 19:29:26,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:26" (3/3) ... [2025-03-16 19:29:26,304 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:26,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:29:26,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 257 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:29:26,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:29:26,376 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;@7b1e9c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:29:26,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:29:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 255 states have (on average 1.7254901960784315) internal successors, (440), 256 states have internal predecessors, (440), 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:29:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:29:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:26,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:26,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:26,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1629916681, now seen corresponding path program 1 times [2025-03-16 19:29:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989589623] [2025-03-16 19:29:26,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:26,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:29:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:29:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:26,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:27,011 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:29:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:27,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989589623] [2025-03-16 19:29:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989589623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:27,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920398473] [2025-03-16 19:29:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:27,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:27,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:27,037 INFO L87 Difference]: Start difference. First operand has 257 states, 255 states have (on average 1.7254901960784315) internal successors, (440), 256 states have internal predecessors, (440), 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 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:29:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:27,336 INFO L93 Difference]: Finished difference Result 1162 states and 1885 transitions. [2025-03-16 19:29:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:27,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2025-03-16 19:29:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:27,353 INFO L225 Difference]: With dead ends: 1162 [2025-03-16 19:29:27,354 INFO L226 Difference]: Without dead ends: 1021 [2025-03-16 19:29:27,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:27,359 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 3310 mSDsluCounter, 4460 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 4907 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:27,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 4907 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-16 19:29:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 394. [2025-03-16 19:29:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.508905852417303) internal successors, (593), 393 states have internal predecessors, (593), 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:29:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 593 transitions. [2025-03-16 19:29:27,425 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 593 transitions. Word has length 95 [2025-03-16 19:29:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:27,427 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 593 transitions. [2025-03-16 19:29:27,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:29:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 593 transitions. [2025-03-16 19:29:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:27,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:27,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:27,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:29:27,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:27,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1013152568, now seen corresponding path program 1 times [2025-03-16 19:29:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416757549] [2025-03-16 19:29:27,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:27,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:27,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:27,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:27,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:27,816 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:29:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416757549] [2025-03-16 19:29:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416757549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:27,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758464128] [2025-03-16 19:29:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:27,817 INFO L87 Difference]: Start difference. First operand 394 states and 593 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:29:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:28,084 INFO L93 Difference]: Finished difference Result 1971 states and 3069 transitions. [2025-03-16 19:29:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2025-03-16 19:29:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:28,093 INFO L225 Difference]: With dead ends: 1971 [2025-03-16 19:29:28,094 INFO L226 Difference]: Without dead ends: 1675 [2025-03-16 19:29:28,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:28,097 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 2298 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:28,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 1523 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2025-03-16 19:29:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1665. [2025-03-16 19:29:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.5540865384615385) internal successors, (2586), 1664 states have internal predecessors, (2586), 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:29:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2586 transitions. [2025-03-16 19:29:28,159 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2586 transitions. Word has length 96 [2025-03-16 19:29:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2586 transitions. [2025-03-16 19:29:28,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:29:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2586 transitions. [2025-03-16 19:29:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:28,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:28,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:29:28,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1829146513, now seen corresponding path program 1 times [2025-03-16 19:29:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556158362] [2025-03-16 19:29:28,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:28,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:28,323 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:29:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556158362] [2025-03-16 19:29:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556158362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:28,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:28,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691300810] [2025-03-16 19:29:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:28,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:28,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:28,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:28,326 INFO L87 Difference]: Start difference. First operand 1665 states and 2586 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:28,560 INFO L93 Difference]: Finished difference Result 4275 states and 6730 transitions. [2025-03-16 19:29:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:28,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:28,569 INFO L225 Difference]: With dead ends: 4275 [2025-03-16 19:29:28,570 INFO L226 Difference]: Without dead ends: 2807 [2025-03-16 19:29:28,571 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:29:28,572 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1351 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:28,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 371 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2025-03-16 19:29:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2805. [2025-03-16 19:29:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.56490727532097) internal successors, (4388), 2804 states have internal predecessors, (4388), 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:29:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4388 transitions. [2025-03-16 19:29:28,635 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4388 transitions. Word has length 97 [2025-03-16 19:29:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 4388 transitions. [2025-03-16 19:29:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4388 transitions. [2025-03-16 19:29:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:28,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:28,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:28,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:29:28,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1857541187, now seen corresponding path program 1 times [2025-03-16 19:29:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836716937] [2025-03-16 19:29:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:28,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:28,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:28,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:28,793 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:29:28,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:28,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836716937] [2025-03-16 19:29:28,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836716937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:28,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:28,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012531945] [2025-03-16 19:29:28,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:28,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:28,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:28,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:28,795 INFO L87 Difference]: Start difference. First operand 2805 states and 4388 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:29,040 INFO L93 Difference]: Finished difference Result 7746 states and 12209 transitions. [2025-03-16 19:29:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:29,056 INFO L225 Difference]: With dead ends: 7746 [2025-03-16 19:29:29,056 INFO L226 Difference]: Without dead ends: 5097 [2025-03-16 19:29:29,059 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:29:29,060 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1353 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:29,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 362 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2025-03-16 19:29:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5095. [2025-03-16 19:29:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5094 states have (on average 1.568904593639576) internal successors, (7992), 5094 states have internal predecessors, (7992), 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:29:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7992 transitions. [2025-03-16 19:29:29,156 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7992 transitions. Word has length 97 [2025-03-16 19:29:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:29,156 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7992 transitions. [2025-03-16 19:29:29,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7992 transitions. [2025-03-16 19:29:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:29,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:29,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:29,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:29:29,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1170723305, now seen corresponding path program 1 times [2025-03-16 19:29:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293410083] [2025-03-16 19:29:29,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:29,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:29,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:29,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:29,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:29,276 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:29:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293410083] [2025-03-16 19:29:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293410083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671563409] [2025-03-16 19:29:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:29,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:29,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:29,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:29,277 INFO L87 Difference]: Start difference. First operand 5095 states and 7992 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:29,501 INFO L93 Difference]: Finished difference Result 14699 states and 23154 transitions. [2025-03-16 19:29:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:29,527 INFO L225 Difference]: With dead ends: 14699 [2025-03-16 19:29:29,527 INFO L226 Difference]: Without dead ends: 9723 [2025-03-16 19:29:29,535 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:29:29,535 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1379 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:29,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 360 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9723 states. [2025-03-16 19:29:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9723 to 9721. [2025-03-16 19:29:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9721 states, 9720 states have (on average 1.5684156378600822) internal successors, (15245), 9720 states have internal predecessors, (15245), 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:29:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9721 states to 9721 states and 15245 transitions. [2025-03-16 19:29:29,722 INFO L78 Accepts]: Start accepts. Automaton has 9721 states and 15245 transitions. Word has length 97 [2025-03-16 19:29:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 9721 states and 15245 transitions. [2025-03-16 19:29:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9721 states and 15245 transitions. [2025-03-16 19:29:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:29,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:29,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:29:29,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 932150763, now seen corresponding path program 1 times [2025-03-16 19:29:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695228208] [2025-03-16 19:29:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:29,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:29,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:29,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:29,836 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:29:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695228208] [2025-03-16 19:29:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695228208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221027081] [2025-03-16 19:29:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:29,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:29,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:29,837 INFO L87 Difference]: Start difference. First operand 9721 states and 15245 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:30,115 INFO L93 Difference]: Finished difference Result 28647 states and 45029 transitions. [2025-03-16 19:29:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:30,153 INFO L225 Difference]: With dead ends: 28647 [2025-03-16 19:29:30,153 INFO L226 Difference]: Without dead ends: 19015 [2025-03-16 19:29:30,167 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:29:30,168 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1405 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:30,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 358 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19015 states. [2025-03-16 19:29:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19015 to 19013. [2025-03-16 19:29:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19013 states, 19012 states have (on average 1.564538186408584) internal successors, (29745), 19012 states have internal predecessors, (29745), 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:29:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19013 states to 19013 states and 29745 transitions. [2025-03-16 19:29:30,477 INFO L78 Accepts]: Start accepts. Automaton has 19013 states and 29745 transitions. Word has length 97 [2025-03-16 19:29:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:30,477 INFO L471 AbstractCegarLoop]: Abstraction has 19013 states and 29745 transitions. [2025-03-16 19:29:30,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19013 states and 29745 transitions. [2025-03-16 19:29:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:30,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:29:30,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1772960833, now seen corresponding path program 1 times [2025-03-16 19:29:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150335834] [2025-03-16 19:29:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:30,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:30,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:30,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:30,635 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:29:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150335834] [2025-03-16 19:29:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150335834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047419532] [2025-03-16 19:29:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:30,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:30,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:30,636 INFO L87 Difference]: Start difference. First operand 19013 states and 29745 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:30,944 INFO L93 Difference]: Finished difference Result 56570 states and 88614 transitions. [2025-03-16 19:29:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:31,004 INFO L225 Difference]: With dead ends: 56570 [2025-03-16 19:29:31,004 INFO L226 Difference]: Without dead ends: 37623 [2025-03-16 19:29:31,030 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:29:31,031 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1431 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:31,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 356 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37623 states. [2025-03-16 19:29:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37623 to 37621. [2025-03-16 19:29:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37621 states, 37620 states have (on average 1.558266879319511) internal successors, (58622), 37620 states have internal predecessors, (58622), 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:29:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37621 states to 37621 states and 58622 transitions. [2025-03-16 19:29:31,699 INFO L78 Accepts]: Start accepts. Automaton has 37621 states and 58622 transitions. Word has length 97 [2025-03-16 19:29:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 37621 states and 58622 transitions. [2025-03-16 19:29:31,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37621 states and 58622 transitions. [2025-03-16 19:29:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:31,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:31,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:31,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:29:31,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1281949805, now seen corresponding path program 1 times [2025-03-16 19:29:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274051070] [2025-03-16 19:29:31,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:31,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:31,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:31,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:31,825 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:29:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274051070] [2025-03-16 19:29:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274051070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708355019] [2025-03-16 19:29:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:31,829 INFO L87 Difference]: Start difference. First operand 37621 states and 58622 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:32,324 INFO L93 Difference]: Finished difference Result 112389 states and 175236 transitions. [2025-03-16 19:29:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-16 19:29:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:32,436 INFO L225 Difference]: With dead ends: 112389 [2025-03-16 19:29:32,436 INFO L226 Difference]: Without dead ends: 74818 [2025-03-16 19:29:32,482 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:29:32,483 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1455 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:32,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 354 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74818 states. [2025-03-16 19:29:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74818 to 74816. [2025-03-16 19:29:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74816 states, 74815 states have (on average 1.5499699258170152) internal successors, (115961), 74815 states have internal predecessors, (115961), 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:29:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74816 states to 74816 states and 115961 transitions. [2025-03-16 19:29:33,734 INFO L78 Accepts]: Start accepts. Automaton has 74816 states and 115961 transitions. Word has length 97 [2025-03-16 19:29:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 74816 states and 115961 transitions. [2025-03-16 19:29:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:29:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 74816 states and 115961 transitions. [2025-03-16 19:29:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:33,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:33,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:33,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:29:33,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1945266198, now seen corresponding path program 1 times [2025-03-16 19:29:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682417755] [2025-03-16 19:29:33,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:33,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:33,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:33,968 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:29:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682417755] [2025-03-16 19:29:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682417755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:33,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029020841] [2025-03-16 19:29:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:33,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:33,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:33,971 INFO L87 Difference]: Start difference. First operand 74816 states and 115961 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:29:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:34,275 INFO L93 Difference]: Finished difference Result 76354 states and 118266 transitions. [2025-03-16 19:29:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 19:29:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:34,375 INFO L225 Difference]: With dead ends: 76354 [2025-03-16 19:29:34,375 INFO L226 Difference]: Without dead ends: 76352 [2025-03-16 19:29:34,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:34,400 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:34,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1402 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76352 states. [2025-03-16 19:29:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76352 to 76352. [2025-03-16 19:29:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76352 states, 76351 states have (on average 1.5389058427525508) internal successors, (117497), 76351 states have internal predecessors, (117497), 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:29:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76352 states to 76352 states and 117497 transitions. [2025-03-16 19:29:35,542 INFO L78 Accepts]: Start accepts. Automaton has 76352 states and 117497 transitions. Word has length 98 [2025-03-16 19:29:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:35,542 INFO L471 AbstractCegarLoop]: Abstraction has 76352 states and 117497 transitions. [2025-03-16 19:29:35,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:29:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 76352 states and 117497 transitions. [2025-03-16 19:29:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:35,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:35,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:29:35,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 178485369, now seen corresponding path program 1 times [2025-03-16 19:29:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091430089] [2025-03-16 19:29:35,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:35,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:35,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:35,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:35,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:36,018 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:29:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091430089] [2025-03-16 19:29:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091430089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:36,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5412710] [2025-03-16 19:29:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:36,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:36,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:36,021 INFO L87 Difference]: Start difference. First operand 76352 states and 117497 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:36,668 INFO L93 Difference]: Finished difference Result 92095 states and 140894 transitions. [2025-03-16 19:29:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:36,780 INFO L225 Difference]: With dead ends: 92095 [2025-03-16 19:29:36,780 INFO L226 Difference]: Without dead ends: 84738 [2025-03-16 19:29:36,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:29:36,815 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1428 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:36,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1130 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84738 states. [2025-03-16 19:29:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84738 to 76352. [2025-03-16 19:29:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76352 states, 76351 states have (on average 1.5388927453471468) internal successors, (117496), 76351 states have internal predecessors, (117496), 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:29:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76352 states to 76352 states and 117496 transitions. [2025-03-16 19:29:37,789 INFO L78 Accepts]: Start accepts. Automaton has 76352 states and 117496 transitions. Word has length 99 [2025-03-16 19:29:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 76352 states and 117496 transitions. [2025-03-16 19:29:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 76352 states and 117496 transitions. [2025-03-16 19:29:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:37,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:37,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:37,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:29:37,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -466641671, now seen corresponding path program 1 times [2025-03-16 19:29:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073544547] [2025-03-16 19:29:37,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:37,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:37,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:37,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:37,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:38,049 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:29:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073544547] [2025-03-16 19:29:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073544547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271861962] [2025-03-16 19:29:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:38,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:38,051 INFO L87 Difference]: Start difference. First operand 76352 states and 117496 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:38,877 INFO L93 Difference]: Finished difference Result 115287 states and 176065 transitions. [2025-03-16 19:29:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:38,991 INFO L225 Difference]: With dead ends: 115287 [2025-03-16 19:29:38,991 INFO L226 Difference]: Without dead ends: 94165 [2025-03-16 19:29:39,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:29:39,032 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 1714 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:39,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1160 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94165 states. [2025-03-16 19:29:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94165 to 77203. [2025-03-16 19:29:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77203 states, 77202 states have (on average 1.5383150695577834) internal successors, (118761), 77202 states have internal predecessors, (118761), 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:29:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77203 states to 77203 states and 118761 transitions. [2025-03-16 19:29:40,199 INFO L78 Accepts]: Start accepts. Automaton has 77203 states and 118761 transitions. Word has length 99 [2025-03-16 19:29:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 77203 states and 118761 transitions. [2025-03-16 19:29:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 77203 states and 118761 transitions. [2025-03-16 19:29:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:40,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:40,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:29:40,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:40,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 437617017, now seen corresponding path program 1 times [2025-03-16 19:29:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041375425] [2025-03-16 19:29:40,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:40,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:40,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:40,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:40,494 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:29:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:40,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041375425] [2025-03-16 19:29:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041375425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:40,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:40,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416000431] [2025-03-16 19:29:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:40,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:40,496 INFO L87 Difference]: Start difference. First operand 77203 states and 118761 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:41,432 INFO L93 Difference]: Finished difference Result 135736 states and 207517 transitions. [2025-03-16 19:29:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:41,554 INFO L225 Difference]: With dead ends: 135736 [2025-03-16 19:29:41,554 INFO L226 Difference]: Without dead ends: 101120 [2025-03-16 19:29:41,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:41,603 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 1494 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:41,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1252 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101120 states. [2025-03-16 19:29:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101120 to 78105. [2025-03-16 19:29:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78105 states, 78104 states have (on average 1.5365538256683398) internal successors, (120011), 78104 states have internal predecessors, (120011), 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:29:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78105 states to 78105 states and 120011 transitions. [2025-03-16 19:29:42,936 INFO L78 Accepts]: Start accepts. Automaton has 78105 states and 120011 transitions. Word has length 99 [2025-03-16 19:29:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:42,936 INFO L471 AbstractCegarLoop]: Abstraction has 78105 states and 120011 transitions. [2025-03-16 19:29:42,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 78105 states and 120011 transitions. [2025-03-16 19:29:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:42,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:29:42,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1769285113, now seen corresponding path program 1 times [2025-03-16 19:29:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45668676] [2025-03-16 19:29:42,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:42,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:42,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:42,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:42,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:43,404 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:29:43,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45668676] [2025-03-16 19:29:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45668676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:43,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270120326] [2025-03-16 19:29:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:43,406 INFO L87 Difference]: Start difference. First operand 78105 states and 120011 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:44,259 INFO L93 Difference]: Finished difference Result 156465 states and 238996 transitions. [2025-03-16 19:29:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:44,589 INFO L225 Difference]: With dead ends: 156465 [2025-03-16 19:29:44,589 INFO L226 Difference]: Without dead ends: 108922 [2025-03-16 19:29:44,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:29:44,628 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 978 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:44,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1254 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108922 states. [2025-03-16 19:29:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108922 to 79018. [2025-03-16 19:29:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79018 states, 79017 states have (on average 1.5345052330511155) internal successors, (121252), 79017 states have internal predecessors, (121252), 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:29:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79018 states to 79018 states and 121252 transitions. [2025-03-16 19:29:45,859 INFO L78 Accepts]: Start accepts. Automaton has 79018 states and 121252 transitions. Word has length 99 [2025-03-16 19:29:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:45,860 INFO L471 AbstractCegarLoop]: Abstraction has 79018 states and 121252 transitions. [2025-03-16 19:29:45,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 79018 states and 121252 transitions. [2025-03-16 19:29:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:45,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:45,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:45,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:29:45,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:45,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash -9532807, now seen corresponding path program 1 times [2025-03-16 19:29:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695179202] [2025-03-16 19:29:45,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:45,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:45,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:45,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:46,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:29:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695179202] [2025-03-16 19:29:46,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695179202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:46,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041378460] [2025-03-16 19:29:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:46,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:46,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:46,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:46,242 INFO L87 Difference]: Start difference. First operand 79018 states and 121252 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:47,433 INFO L93 Difference]: Finished difference Result 176004 states and 268524 transitions. [2025-03-16 19:29:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:47,571 INFO L225 Difference]: With dead ends: 176004 [2025-03-16 19:29:47,571 INFO L226 Difference]: Without dead ends: 116248 [2025-03-16 19:29:47,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:47,619 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1560 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:47,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 1256 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116248 states. [2025-03-16 19:29:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116248 to 79900. [2025-03-16 19:29:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79900 states, 79899 states have (on average 1.5318589719520894) internal successors, (122394), 79899 states have internal predecessors, (122394), 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:29:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79900 states to 79900 states and 122394 transitions. [2025-03-16 19:29:48,946 INFO L78 Accepts]: Start accepts. Automaton has 79900 states and 122394 transitions. Word has length 99 [2025-03-16 19:29:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:48,946 INFO L471 AbstractCegarLoop]: Abstraction has 79900 states and 122394 transitions. [2025-03-16 19:29:48,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 79900 states and 122394 transitions. [2025-03-16 19:29:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:29:48,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:48,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:48,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:29:48,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2032250617, now seen corresponding path program 1 times [2025-03-16 19:29:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807836371] [2025-03-16 19:29:48,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:29:48,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:29:48,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:49,182 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:29:49,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:49,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807836371] [2025-03-16 19:29:49,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807836371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:49,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279440240] [2025-03-16 19:29:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:49,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:49,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:49,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:49,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:49,184 INFO L87 Difference]: Start difference. First operand 79900 states and 122394 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:50,348 INFO L93 Difference]: Finished difference Result 198659 states and 302799 transitions. [2025-03-16 19:29:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:29:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:50,487 INFO L225 Difference]: With dead ends: 198659 [2025-03-16 19:29:50,487 INFO L226 Difference]: Without dead ends: 122241 [2025-03-16 19:29:50,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:29:50,540 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1125 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:50,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 2008 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122241 states. [2025-03-16 19:29:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122241 to 80656. [2025-03-16 19:29:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80656 states, 80655 states have (on average 1.528287148967826) internal successors, (123264), 80655 states have internal predecessors, (123264), 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:29:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80656 states to 80656 states and 123264 transitions. [2025-03-16 19:29:51,979 INFO L78 Accepts]: Start accepts. Automaton has 80656 states and 123264 transitions. Word has length 99 [2025-03-16 19:29:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 80656 states and 123264 transitions. [2025-03-16 19:29:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 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:29:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 80656 states and 123264 transitions. [2025-03-16 19:29:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:29:51,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:51,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:29:51,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 742101887, now seen corresponding path program 1 times [2025-03-16 19:29:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525567549] [2025-03-16 19:29:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:52,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:29:52,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:29:52,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:52,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:52,311 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:29:52,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525567549] [2025-03-16 19:29:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525567549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695679034] [2025-03-16 19:29:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:29:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:29:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:29:52,314 INFO L87 Difference]: Start difference. First operand 80656 states and 123264 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:29:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:52,760 INFO L93 Difference]: Finished difference Result 221844 states and 339826 transitions. [2025-03-16 19:29:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:29:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2025-03-16 19:29:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:52,963 INFO L225 Difference]: With dead ends: 221844 [2025-03-16 19:29:52,963 INFO L226 Difference]: Without dead ends: 147346 [2025-03-16 19:29:53,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:29:53,040 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 247 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:53,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 880 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147346 states. [2025-03-16 19:29:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147346 to 146608. [2025-03-16 19:29:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146608 states, 146607 states have (on average 1.52014569563527) internal successors, (222864), 146607 states have internal predecessors, (222864), 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:29:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146608 states to 146608 states and 222864 transitions. [2025-03-16 19:29:54,893 INFO L78 Accepts]: Start accepts. Automaton has 146608 states and 222864 transitions. Word has length 100 [2025-03-16 19:29:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 146608 states and 222864 transitions. [2025-03-16 19:29:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:29:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 146608 states and 222864 transitions. [2025-03-16 19:29:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:29:54,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:54,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:54,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:29:54,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1907480067, now seen corresponding path program 1 times [2025-03-16 19:29:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:54,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608242274] [2025-03-16 19:29:54,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:54,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:29:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:29:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:54,965 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:29:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608242274] [2025-03-16 19:29:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608242274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38815314] [2025-03-16 19:29:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:54,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:54,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:54,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:54,967 INFO L87 Difference]: Start difference. First operand 146608 states and 222864 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:29:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:56,333 INFO L93 Difference]: Finished difference Result 386808 states and 589333 transitions. [2025-03-16 19:29:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-03-16 19:29:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:56,741 INFO L225 Difference]: With dead ends: 386808 [2025-03-16 19:29:56,741 INFO L226 Difference]: Without dead ends: 259492 [2025-03-16 19:29:56,847 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:29:56,847 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 260 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:56,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 685 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259492 states. [2025-03-16 19:29:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259492 to 259170. [2025-03-16 19:29:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259170 states, 259169 states have (on average 1.5163387596510385) internal successors, (392988), 259169 states have internal predecessors, (392988), 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:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259170 states to 259170 states and 392988 transitions. [2025-03-16 19:30:00,376 INFO L78 Accepts]: Start accepts. Automaton has 259170 states and 392988 transitions. Word has length 100 [2025-03-16 19:30:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 259170 states and 392988 transitions. [2025-03-16 19:30:00,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 259170 states and 392988 transitions. [2025-03-16 19:30:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:30:00,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:00,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:00,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:30:00,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 50691031, now seen corresponding path program 1 times [2025-03-16 19:30:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714595466] [2025-03-16 19:30:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:00,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:00,448 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:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714595466] [2025-03-16 19:30:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714595466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:00,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:00,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712398064] [2025-03-16 19:30:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:00,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:00,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:00,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:00,450 INFO L87 Difference]: Start difference. First operand 259170 states and 392988 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:01,714 INFO L93 Difference]: Finished difference Result 334804 states and 507258 transitions. [2025-03-16 19:30:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-03-16 19:30:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:02,184 INFO L225 Difference]: With dead ends: 334804 [2025-03-16 19:30:02,184 INFO L226 Difference]: Without dead ends: 280862 [2025-03-16 19:30:02,295 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:02,296 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 211 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:02,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 822 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280862 states. [2025-03-16 19:30:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280862 to 255692. [2025-03-16 19:30:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255692 states, 255691 states have (on average 1.499286247853855) internal successors, (383354), 255691 states have internal predecessors, (383354), 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:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255692 states to 255692 states and 383354 transitions. [2025-03-16 19:30:05,902 INFO L78 Accepts]: Start accepts. Automaton has 255692 states and 383354 transitions. Word has length 100 [2025-03-16 19:30:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:05,902 INFO L471 AbstractCegarLoop]: Abstraction has 255692 states and 383354 transitions. [2025-03-16 19:30:05,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 255692 states and 383354 transitions. [2025-03-16 19:30:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:30:05,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:05,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:30:05,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1380034499, now seen corresponding path program 1 times [2025-03-16 19:30:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040478453] [2025-03-16 19:30:05,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:05,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:05,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:05,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:05,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:05,983 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:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040478453] [2025-03-16 19:30:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040478453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463482024] [2025-03-16 19:30:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:05,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:05,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:05,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:05,988 INFO L87 Difference]: Start difference. First operand 255692 states and 383354 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:07,400 INFO L93 Difference]: Finished difference Result 386011 states and 579559 transitions. [2025-03-16 19:30:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-03-16 19:30:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:07,847 INFO L225 Difference]: With dead ends: 386011 [2025-03-16 19:30:07,847 INFO L226 Difference]: Without dead ends: 285971 [2025-03-16 19:30:07,939 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:07,939 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 217 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:07,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 739 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285971 states.