./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 15:10:26,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:10:26,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:10:26,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:10:26,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:10:26,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:10:26,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:10:26,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:10:26,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:10:26,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:10:26,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:10:26,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:10:26,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:10:26,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:10:26,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:10:26,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:10:26,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:10:26,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:10:26,967 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-03 15:10:27,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:10:27,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:10:27,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:10:27,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:10:27,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:10:27,189 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-03 15:10:28,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c888a294/7c146dc6861a4476be1c008467134545/FLAG47937bafa [2025-03-03 15:10:28,652 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:10:28,653 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-03 15:10:28,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c888a294/7c146dc6861a4476be1c008467134545/FLAG47937bafa [2025-03-03 15:10:28,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c888a294/7c146dc6861a4476be1c008467134545 [2025-03-03 15:10:28,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:10:28,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:10:28,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:10:28,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:10:28,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:10:28,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:10:28" (1/1) ... [2025-03-03 15:10:28,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:28, skipping insertion in model container [2025-03-03 15:10:28,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:10:28" (1/1) ... [2025-03-03 15:10:28,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:10:29,138 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-03 15:10:29,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:10:29,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:10:29,290 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-03 15:10:29,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:10:29,333 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:10:29,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29 WrapperNode [2025-03-03 15:10:29,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:10:29,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:10:29,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:10:29,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:10:29,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,387 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1034 [2025-03-03 15:10:29,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:10:29,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:10:29,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:10:29,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:10:29,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,409 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:10:29,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:10:29,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:10:29,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:10:29,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:10:29,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (1/1) ... [2025-03-03 15:10:29,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:10:29,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:10:29,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:10:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:10:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:10:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:10:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:10:29,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:10:29,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:10:29,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:10:30,240 INFO L1325 $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-03 15:10:30,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:30,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1396: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3__m3~2#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node5__m5~2#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,241 INFO L1325 $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-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1142: havoc main_~node6____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1572: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1440: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_~node2__m2~2#1; [2025-03-03 15:10:30,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4__m4~2#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1484: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~node6____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:30,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:30,284 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-03 15:10:30,284 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:10:30,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:10:30,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:10:30,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:10:30 BoogieIcfgContainer [2025-03-03 15:10:30,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:10:30,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:10:30,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:10:30,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:10:30,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:10:28" (1/3) ... [2025-03-03 15:10:30,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb11e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:10:30, skipping insertion in model container [2025-03-03 15:10:30,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:29" (2/3) ... [2025-03-03 15:10:30,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb11e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:10:30, skipping insertion in model container [2025-03-03 15:10:30,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:10:30" (3/3) ... [2025-03-03 15:10:30,312 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:10:30,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:10:30,324 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, 258 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:10:30,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:10:30,380 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;@5488a319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:10:30,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:10:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 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-03 15:10:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:10:30,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:30,390 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-03 15:10:30,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1982564949, now seen corresponding path program 1 times [2025-03-03 15:10:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257651011] [2025-03-03 15:10:30,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:10:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:10:30,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:30,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:30,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257651011] [2025-03-03 15:10:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257651011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:30,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:30,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884989649] [2025-03-03 15:10:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:30,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:10:30,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:30,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:10:30,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:10:30,974 INFO L87 Difference]: Start difference. First operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 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 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-03 15:10:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:31,285 INFO L93 Difference]: Finished difference Result 1163 states and 1886 transitions. [2025-03-03 15:10:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:31,287 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-03 15:10:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:31,304 INFO L225 Difference]: With dead ends: 1163 [2025-03-03 15:10:31,304 INFO L226 Difference]: Without dead ends: 1022 [2025-03-03 15:10:31,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:10:31,309 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 3310 mSDsluCounter, 4460 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:31,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 4908 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-03-03 15:10:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 395. [2025-03-03 15:10:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 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-03 15:10:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 594 transitions. [2025-03-03 15:10:31,365 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 594 transitions. Word has length 96 [2025-03-03 15:10:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:31,365 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 594 transitions. [2025-03-03 15:10:31,365 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-03 15:10:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 594 transitions. [2025-03-03 15:10:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:31,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:31,367 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-03 15:10:31,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:10:31,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:31,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1329009148, now seen corresponding path program 1 times [2025-03-03 15:10:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105148619] [2025-03-03 15:10:31,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:31,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:31,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:31,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:31,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:31,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105148619] [2025-03-03 15:10:31,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105148619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:31,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:31,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486072500] [2025-03-03 15:10:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:31,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:10:31,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:31,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:10:31,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:10:31,727 INFO L87 Difference]: Start difference. First operand 395 states and 594 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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-03 15:10:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:32,005 INFO L93 Difference]: Finished difference Result 1972 states and 3070 transitions. [2025-03-03 15:10:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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-03 15:10:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:32,015 INFO L225 Difference]: With dead ends: 1972 [2025-03-03 15:10:32,015 INFO L226 Difference]: Without dead ends: 1676 [2025-03-03 15:10:32,018 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-03 15:10:32,018 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 4036 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:32,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 1498 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-03-03 15:10:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1666. [2025-03-03 15:10:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 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-03 15:10:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2587 transitions. [2025-03-03 15:10:32,074 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2587 transitions. Word has length 97 [2025-03-03 15:10:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:32,075 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2587 transitions. [2025-03-03 15:10:32,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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-03 15:10:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2587 transitions. [2025-03-03 15:10:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:32,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:32,079 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-03 15:10:32,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:10:32,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1421715677, now seen corresponding path program 1 times [2025-03-03 15:10:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:32,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-03-03 15:10:32,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:32,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:32,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:32,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:32,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:32,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-03 15:10:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-03-03 15:10:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547707811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945754509] [2025-03-03 15:10:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:32,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:32,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:32,244 INFO L87 Difference]: Start difference. First operand 1666 states and 2587 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:32,509 INFO L93 Difference]: Finished difference Result 4276 states and 6731 transitions. [2025-03-03 15:10:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:32,520 INFO L225 Difference]: With dead ends: 4276 [2025-03-03 15:10:32,520 INFO L226 Difference]: Without dead ends: 2808 [2025-03-03 15:10:32,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:32,523 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1351 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:32,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 372 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2025-03-03 15:10:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2806. [2025-03-03 15:10:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2805 states have (on average 1.5647058823529412) internal successors, (4389), 2805 states have internal predecessors, (4389), 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-03 15:10:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4389 transitions. [2025-03-03 15:10:32,595 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4389 transitions. Word has length 98 [2025-03-03 15:10:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4389 transitions. [2025-03-03 15:10:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4389 transitions. [2025-03-03 15:10:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:32,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:32,599 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-03 15:10:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:10:32,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2029995273, now seen corresponding path program 1 times [2025-03-03 15:10:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215293900] [2025-03-03 15:10:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:32,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215293900] [2025-03-03 15:10:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215293900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:32,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:32,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627752194] [2025-03-03 15:10:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:32,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:32,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:32,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:32,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:32,780 INFO L87 Difference]: Start difference. First operand 2806 states and 4389 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:33,025 INFO L93 Difference]: Finished difference Result 7747 states and 12210 transitions. [2025-03-03 15:10:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:33,041 INFO L225 Difference]: With dead ends: 7747 [2025-03-03 15:10:33,041 INFO L226 Difference]: Without dead ends: 5098 [2025-03-03 15:10:33,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:33,046 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1353 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:33,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 363 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2025-03-03 15:10:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5096. [2025-03-03 15:10:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5096 states, 5095 states have (on average 1.568792934249264) internal successors, (7993), 5095 states have internal predecessors, (7993), 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-03 15:10:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5096 states to 5096 states and 7993 transitions. [2025-03-03 15:10:33,140 INFO L78 Accepts]: Start accepts. Automaton has 5096 states and 7993 transitions. Word has length 98 [2025-03-03 15:10:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:33,140 INFO L471 AbstractCegarLoop]: Abstraction has 5096 states and 7993 transitions. [2025-03-03 15:10:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5096 states and 7993 transitions. [2025-03-03 15:10:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:33,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:33,142 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-03 15:10:33,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:10:33,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:33,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -763292469, now seen corresponding path program 1 times [2025-03-03 15:10:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551151035] [2025-03-03 15:10:33,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:33,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:33,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:33,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:33,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551151035] [2025-03-03 15:10:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551151035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230508388] [2025-03-03 15:10:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:33,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:33,253 INFO L87 Difference]: Start difference. First operand 5096 states and 7993 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:33,515 INFO L93 Difference]: Finished difference Result 14700 states and 23155 transitions. [2025-03-03 15:10:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:33,546 INFO L225 Difference]: With dead ends: 14700 [2025-03-03 15:10:33,547 INFO L226 Difference]: Without dead ends: 9724 [2025-03-03 15:10:33,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:33,557 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1379 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:33,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 361 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2025-03-03 15:10:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 9722. [2025-03-03 15:10:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9722 states, 9721 states have (on average 1.5683571649007304) internal successors, (15246), 9721 states have internal predecessors, (15246), 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-03 15:10:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9722 states to 9722 states and 15246 transitions. [2025-03-03 15:10:33,753 INFO L78 Accepts]: Start accepts. Automaton has 9722 states and 15246 transitions. Word has length 98 [2025-03-03 15:10:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:33,753 INFO L471 AbstractCegarLoop]: Abstraction has 9722 states and 15246 transitions. [2025-03-03 15:10:33,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9722 states and 15246 transitions. [2025-03-03 15:10:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:33,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:33,757 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-03 15:10:33,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:10:33,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:33,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1339581599, now seen corresponding path program 1 times [2025-03-03 15:10:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353219103] [2025-03-03 15:10:33,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:33,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:33,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353219103] [2025-03-03 15:10:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353219103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:33,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707587940] [2025-03-03 15:10:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:33,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:33,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:33,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:33,876 INFO L87 Difference]: Start difference. First operand 9722 states and 15246 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:34,209 INFO L93 Difference]: Finished difference Result 28648 states and 45030 transitions. [2025-03-03 15:10:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:34,257 INFO L225 Difference]: With dead ends: 28648 [2025-03-03 15:10:34,257 INFO L226 Difference]: Without dead ends: 19016 [2025-03-03 15:10:34,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:34,267 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1405 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:34,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 359 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19016 states. [2025-03-03 15:10:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19016 to 19014. [2025-03-03 15:10:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 19013 states have (on average 1.564508494188187) internal successors, (29746), 19013 states have internal predecessors, (29746), 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-03 15:10:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 29746 transitions. [2025-03-03 15:10:34,517 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 29746 transitions. Word has length 98 [2025-03-03 15:10:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:34,517 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 29746 transitions. [2025-03-03 15:10:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 29746 transitions. [2025-03-03 15:10:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:34,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:34,522 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-03 15:10:34,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:10:34,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1365529997, now seen corresponding path program 1 times [2025-03-03 15:10:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713262399] [2025-03-03 15:10:34,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:34,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:34,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:34,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:34,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713262399] [2025-03-03 15:10:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713262399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668144221] [2025-03-03 15:10:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:34,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:34,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:34,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:34,707 INFO L87 Difference]: Start difference. First operand 19014 states and 29746 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:35,072 INFO L93 Difference]: Finished difference Result 56571 states and 88615 transitions. [2025-03-03 15:10:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:35,142 INFO L225 Difference]: With dead ends: 56571 [2025-03-03 15:10:35,142 INFO L226 Difference]: Without dead ends: 37624 [2025-03-03 15:10:35,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:35,176 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1431 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:35,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 357 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37624 states. [2025-03-03 15:10:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37624 to 37622. [2025-03-03 15:10:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37622 states, 37621 states have (on average 1.5582520400839956) internal successors, (58623), 37621 states have internal predecessors, (58623), 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-03 15:10:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37622 states to 37622 states and 58623 transitions. [2025-03-03 15:10:35,642 INFO L78 Accepts]: Start accepts. Automaton has 37622 states and 58623 transitions. Word has length 98 [2025-03-03 15:10:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:35,642 INFO L471 AbstractCegarLoop]: Abstraction has 37622 states and 58623 transitions. [2025-03-03 15:10:35,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37622 states and 58623 transitions. [2025-03-03 15:10:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:35,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:35,648 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-03 15:10:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:10:35,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -874518969, now seen corresponding path program 1 times [2025-03-03 15:10:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115358644] [2025-03-03 15:10:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:35,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:35,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:35,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:35,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115358644] [2025-03-03 15:10:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115358644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:35,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:35,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:35,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038423924] [2025-03-03 15:10:35,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:35,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:35,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:35,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:35,829 INFO L87 Difference]: Start difference. First operand 37622 states and 58623 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:36,407 INFO L93 Difference]: Finished difference Result 112390 states and 175237 transitions. [2025-03-03 15:10:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:36,565 INFO L225 Difference]: With dead ends: 112390 [2025-03-03 15:10:36,565 INFO L226 Difference]: Without dead ends: 74819 [2025-03-03 15:10:36,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:36,597 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1455 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:36,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 355 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74819 states. [2025-03-03 15:10:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74819 to 74817. [2025-03-03 15:10:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74817 states, 74816 states have (on average 1.5499625748502994) internal successors, (115962), 74816 states have internal predecessors, (115962), 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-03 15:10:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74817 states to 74817 states and 115962 transitions. [2025-03-03 15:10:37,819 INFO L78 Accepts]: Start accepts. Automaton has 74817 states and 115962 transitions. Word has length 98 [2025-03-03 15:10:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:37,819 INFO L471 AbstractCegarLoop]: Abstraction has 74817 states and 115962 transitions. [2025-03-03 15:10:37,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-03 15:10:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 74817 states and 115962 transitions. [2025-03-03 15:10:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:10:37,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:37,830 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-03 15:10:37,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:10:37,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:37,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1690720226, now seen corresponding path program 1 times [2025-03-03 15:10:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722217188] [2025-03-03 15:10:37,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:37,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:10:37,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:10:37,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:37,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722217188] [2025-03-03 15:10:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722217188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:10:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357618957] [2025-03-03 15:10:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:38,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:38,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:38,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:38,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:38,164 INFO L87 Difference]: Start difference. First operand 74817 states and 115962 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-03 15:10:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:38,414 INFO L93 Difference]: Finished difference Result 76355 states and 118267 transitions. [2025-03-03 15:10:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-03 15:10:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:38,544 INFO L225 Difference]: With dead ends: 76355 [2025-03-03 15:10:38,545 INFO L226 Difference]: Without dead ends: 76353 [2025-03-03 15:10:38,566 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-03 15:10:38,566 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1406 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-03 15:10:38,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1406 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76353 states. [2025-03-03 15:10:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76353 to 76353. [2025-03-03 15:10:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.5388987845766975) internal successors, (117498), 76352 states have internal predecessors, (117498), 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-03 15:10:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 117498 transitions. [2025-03-03 15:10:39,614 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 117498 transitions. Word has length 99 [2025-03-03 15:10:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 117498 transitions. [2025-03-03 15:10:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-03 15:10:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 117498 transitions. [2025-03-03 15:10:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:39,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:39,627 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-03 15:10:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:10:39,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash 877494829, now seen corresponding path program 1 times [2025-03-03 15:10:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985099109] [2025-03-03 15:10:39,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:39,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:39,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:39,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:39,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985099109] [2025-03-03 15:10:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985099109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:40,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156460389] [2025-03-03 15:10:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:40,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:40,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:40,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:40,152 INFO L87 Difference]: Start difference. First operand 76353 states and 117498 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:41,025 INFO L93 Difference]: Finished difference Result 92096 states and 140895 transitions. [2025-03-03 15:10:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:10:41,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:41,149 INFO L225 Difference]: With dead ends: 92096 [2025-03-03 15:10:41,150 INFO L226 Difference]: Without dead ends: 84739 [2025-03-03 15:10:41,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:10:41,184 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1980 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:41,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1131 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:10:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84739 states. [2025-03-03 15:10:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84739 to 76353. [2025-03-03 15:10:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.5388856873428332) internal successors, (117497), 76352 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-03 15:10:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 117497 transitions. [2025-03-03 15:10:42,166 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 117497 transitions. Word has length 100 [2025-03-03 15:10:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:42,166 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 117497 transitions. [2025-03-03 15:10:42,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 117497 transitions. [2025-03-03 15:10:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:42,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:42,177 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-03 15:10:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:10:42,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash 232367789, now seen corresponding path program 1 times [2025-03-03 15:10:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140951901] [2025-03-03 15:10:42,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:42,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:42,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:42,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:42,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:42,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140951901] [2025-03-03 15:10:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140951901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639127998] [2025-03-03 15:10:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:42,520 INFO L87 Difference]: Start difference. First operand 76353 states and 117497 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:43,632 INFO L93 Difference]: Finished difference Result 115288 states and 176066 transitions. [2025-03-03 15:10:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:43,757 INFO L225 Difference]: With dead ends: 115288 [2025-03-03 15:10:43,758 INFO L226 Difference]: Without dead ends: 94166 [2025-03-03 15:10:43,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:10:43,792 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 1675 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1161 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:10:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94166 states. [2025-03-03 15:10:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94166 to 77204. [2025-03-03 15:10:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77204 states, 77203 states have (on average 1.538308096835615) internal successors, (118762), 77203 states have internal predecessors, (118762), 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-03 15:10:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77204 states to 77204 states and 118762 transitions. [2025-03-03 15:10:44,927 INFO L78 Accepts]: Start accepts. Automaton has 77204 states and 118762 transitions. Word has length 100 [2025-03-03 15:10:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:44,927 INFO L471 AbstractCegarLoop]: Abstraction has 77204 states and 118762 transitions. [2025-03-03 15:10:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 77204 states and 118762 transitions. [2025-03-03 15:10:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:44,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:44,938 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-03 15:10:44,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:10:44,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1136626477, now seen corresponding path program 1 times [2025-03-03 15:10:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:44,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51539660] [2025-03-03 15:10:44,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:44,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:44,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51539660] [2025-03-03 15:10:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51539660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:45,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827355519] [2025-03-03 15:10:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:45,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:45,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:45,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:45,299 INFO L87 Difference]: Start difference. First operand 77204 states and 118762 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:46,331 INFO L93 Difference]: Finished difference Result 135737 states and 207518 transitions. [2025-03-03 15:10:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:46,484 INFO L225 Difference]: With dead ends: 135737 [2025-03-03 15:10:46,484 INFO L226 Difference]: Without dead ends: 101121 [2025-03-03 15:10:46,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:10:46,541 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 2046 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:46,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 1253 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:10:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101121 states. [2025-03-03 15:10:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101121 to 78106. [2025-03-03 15:10:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78106 states, 78105 states have (on average 1.5365469560207412) internal successors, (120012), 78105 states have internal predecessors, (120012), 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-03 15:10:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78106 states to 78106 states and 120012 transitions. [2025-03-03 15:10:47,767 INFO L78 Accepts]: Start accepts. Automaton has 78106 states and 120012 transitions. Word has length 100 [2025-03-03 15:10:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 78106 states and 120012 transitions. [2025-03-03 15:10:47,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 78106 states and 120012 transitions. [2025-03-03 15:10:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:47,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:47,781 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-03 15:10:47,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:10:47,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:47,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1826672723, now seen corresponding path program 1 times [2025-03-03 15:10:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414381817] [2025-03-03 15:10:47,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:47,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:47,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:47,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:47,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414381817] [2025-03-03 15:10:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414381817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456358799] [2025-03-03 15:10:48,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:48,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:48,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:48,257 INFO L87 Difference]: Start difference. First operand 78106 states and 120012 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:49,499 INFO L93 Difference]: Finished difference Result 156466 states and 238997 transitions. [2025-03-03 15:10:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:49,640 INFO L225 Difference]: With dead ends: 156466 [2025-03-03 15:10:49,640 INFO L226 Difference]: Without dead ends: 108923 [2025-03-03 15:10:49,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:10:49,664 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 980 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:49,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1255 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:10:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108923 states. [2025-03-03 15:10:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108923 to 79019. [2025-03-03 15:10:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79019 states, 79018 states have (on average 1.5344984687033334) internal successors, (121253), 79018 states have internal predecessors, (121253), 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-03 15:10:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79019 states to 79019 states and 121253 transitions. [2025-03-03 15:10:50,873 INFO L78 Accepts]: Start accepts. Automaton has 79019 states and 121253 transitions. Word has length 100 [2025-03-03 15:10:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:50,873 INFO L471 AbstractCegarLoop]: Abstraction has 79019 states and 121253 transitions. [2025-03-03 15:10:50,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 79019 states and 121253 transitions. [2025-03-03 15:10:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:50,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:50,887 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-03 15:10:50,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:10:50,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:50,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash 689476653, now seen corresponding path program 1 times [2025-03-03 15:10:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173904560] [2025-03-03 15:10:50,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:50,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:50,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:50,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:50,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173904560] [2025-03-03 15:10:51,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173904560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877577515] [2025-03-03 15:10:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:51,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:51,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:51,150 INFO L87 Difference]: Start difference. First operand 79019 states and 121253 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:52,299 INFO L93 Difference]: Finished difference Result 176005 states and 268525 transitions. [2025-03-03 15:10:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:52,467 INFO L225 Difference]: With dead ends: 176005 [2025-03-03 15:10:52,467 INFO L226 Difference]: Without dead ends: 116249 [2025-03-03 15:10:52,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:10:52,543 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2132 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:52,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 1257 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116249 states. [2025-03-03 15:10:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116249 to 79901. [2025-03-03 15:10:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79901 states, 79900 states have (on average 1.5318523153942427) internal successors, (122395), 79900 states have internal predecessors, (122395), 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-03 15:10:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79901 states to 79901 states and 122395 transitions. [2025-03-03 15:10:53,946 INFO L78 Accepts]: Start accepts. Automaton has 79901 states and 122395 transitions. Word has length 100 [2025-03-03 15:10:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 79901 states and 122395 transitions. [2025-03-03 15:10:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 79901 states and 122395 transitions. [2025-03-03 15:10:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:10:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:53,961 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-03 15:10:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:10:53,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1563707219, now seen corresponding path program 1 times [2025-03-03 15:10:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081113142] [2025-03-03 15:10:53,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:53,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:10:53,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:10:53,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:53,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081113142] [2025-03-03 15:10:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081113142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910178054] [2025-03-03 15:10:54,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:54,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:54,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:54,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:54,225 INFO L87 Difference]: Start difference. First operand 79901 states and 122395 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:55,554 INFO L93 Difference]: Finished difference Result 198660 states and 302800 transitions. [2025-03-03 15:10:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:55,707 INFO L225 Difference]: With dead ends: 198660 [2025-03-03 15:10:55,708 INFO L226 Difference]: Without dead ends: 122242 [2025-03-03 15:10:55,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:10:55,773 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1569 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:55,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1955 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:10:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122242 states. [2025-03-03 15:10:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122242 to 80657. [2025-03-03 15:10:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80657 states, 80656 states have (on average 1.5282805990874826) internal successors, (123265), 80656 states have internal predecessors, (123265), 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-03 15:10:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80657 states to 80657 states and 123265 transitions. [2025-03-03 15:10:57,473 INFO L78 Accepts]: Start accepts. Automaton has 80657 states and 123265 transitions. Word has length 100 [2025-03-03 15:10:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:57,474 INFO L471 AbstractCegarLoop]: Abstraction has 80657 states and 123265 transitions. [2025-03-03 15:10:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 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-03 15:10:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 80657 states and 123265 transitions. [2025-03-03 15:10:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:10:57,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:57,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:57,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:10:57,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash 936558667, now seen corresponding path program 1 times [2025-03-03 15:10:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242199033] [2025-03-03 15:10:57,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:57,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:10:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:10:57,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:57,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242199033] [2025-03-03 15:10:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242199033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257352450] [2025-03-03 15:10:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:10:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:10:57,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:10:57,587 INFO L87 Difference]: Start difference. First operand 80657 states and 123265 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-03 15:10:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:58,340 INFO L93 Difference]: Finished difference Result 221845 states and 339827 transitions. [2025-03-03 15:10:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 101 [2025-03-03 15:10:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:58,569 INFO L225 Difference]: With dead ends: 221845 [2025-03-03 15:10:58,569 INFO L226 Difference]: Without dead ends: 147347 [2025-03-03 15:10:58,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:58,614 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 247 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:58,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 881 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147347 states. [2025-03-03 15:11:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147347 to 146609. [2025-03-03 15:11:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146609 states, 146608 states have (on average 1.5201421477681982) internal successors, (222865), 146608 states have internal predecessors, (222865), 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-03 15:11:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146609 states to 146609 states and 222865 transitions. [2025-03-03 15:11:00,458 INFO L78 Accepts]: Start accepts. Automaton has 146609 states and 222865 transitions. Word has length 101 [2025-03-03 15:11:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 146609 states and 222865 transitions. [2025-03-03 15:11:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-03 15:11:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 146609 states and 222865 transitions. [2025-03-03 15:11:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:11:00,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:00,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:11:00,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:00,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1713023287, now seen corresponding path program 1 times [2025-03-03 15:11:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264802251] [2025-03-03 15:11:00,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:00,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:11:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:11:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264802251] [2025-03-03 15:11:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264802251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284421566] [2025-03-03 15:11:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:00,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:00,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:00,530 INFO L87 Difference]: Start difference. First operand 146609 states and 222865 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03 15:11:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:01,965 INFO L93 Difference]: Finished difference Result 386809 states and 589334 transitions. [2025-03-03 15:11:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-03 15:11:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:02,337 INFO L225 Difference]: With dead ends: 386809 [2025-03-03 15:11:02,338 INFO L226 Difference]: Without dead ends: 259493 [2025-03-03 15:11:02,412 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-03 15:11:02,412 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 260 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:02,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 686 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259493 states. [2025-03-03 15:11:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259493 to 259171. [2025-03-03 15:11:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259171 states, 259170 states have (on average 1.516336767372767) internal successors, (392989), 259170 states have internal predecessors, (392989), 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-03 15:11:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259171 states to 259171 states and 392989 transitions. [2025-03-03 15:11:05,804 INFO L78 Accepts]: Start accepts. Automaton has 259171 states and 392989 transitions. Word has length 101 [2025-03-03 15:11:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:05,804 INFO L471 AbstractCegarLoop]: Abstraction has 259171 states and 392989 transitions. [2025-03-03 15:11:05,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03 15:11:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 259171 states and 392989 transitions. [2025-03-03 15:11:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:11:05,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:05,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:05,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:11:05,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:05,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash 245147811, now seen corresponding path program 1 times [2025-03-03 15:11:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080567864] [2025-03-03 15:11:05,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:05,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:11:05,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:11:05,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:05,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080567864] [2025-03-03 15:11:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080567864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533666510] [2025-03-03 15:11:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:05,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:05,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:05,879 INFO L87 Difference]: Start difference. First operand 259171 states and 392989 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03 15:11:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:07,172 INFO L93 Difference]: Finished difference Result 334805 states and 507259 transitions. [2025-03-03 15:11:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-03 15:11:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:07,672 INFO L225 Difference]: With dead ends: 334805 [2025-03-03 15:11:07,673 INFO L226 Difference]: Without dead ends: 280863 [2025-03-03 15:11:07,771 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-03 15:11:07,771 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 211 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:07,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 823 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280863 states. [2025-03-03 15:11:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280863 to 255693. [2025-03-03 15:11:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255693 states, 255692 states have (on average 1.4992842951676235) internal successors, (383355), 255692 states have internal predecessors, (383355), 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-03 15:11:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255693 states to 255693 states and 383355 transitions. [2025-03-03 15:11:11,338 INFO L78 Accepts]: Start accepts. Automaton has 255693 states and 383355 transitions. Word has length 101 [2025-03-03 15:11:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:11,338 INFO L471 AbstractCegarLoop]: Abstraction has 255693 states and 383355 transitions. [2025-03-03 15:11:11,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03 15:11:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 255693 states and 383355 transitions. [2025-03-03 15:11:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:11:11,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:11,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:11:11,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1185577719, now seen corresponding path program 1 times [2025-03-03 15:11:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370204723] [2025-03-03 15:11:11,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:11,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:11:11,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:11:11,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:11,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370204723] [2025-03-03 15:11:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370204723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:11,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774846335] [2025-03-03 15:11:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:11,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:11,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:11,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:11,478 INFO L87 Difference]: Start difference. First operand 255693 states and 383355 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03 15:11:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:12,857 INFO L93 Difference]: Finished difference Result 386012 states and 579560 transitions. [2025-03-03 15:11:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-03 15:11:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:13,339 INFO L225 Difference]: With dead ends: 386012 [2025-03-03 15:11:13,339 INFO L226 Difference]: Without dead ends: 285972 [2025-03-03 15:11:13,445 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-03 15:11:13,446 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 217 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:13,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 740 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285972 states.