./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.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 f80bfa5d5133b0a22059cd1d412c5ee55e27da1e07175dcd83a431b56441bb30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:38:47,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:38:47,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:38:47,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:38:47,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:38:47,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:38:47,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:38:47,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:38:47,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:38:47,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:38:47,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:38:47,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:38:47,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:38:47,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:38:47,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:38:47,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:47,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:38:47,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:38:47,973 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 -> f80bfa5d5133b0a22059cd1d412c5ee55e27da1e07175dcd83a431b56441bb30 [2025-03-16 19:38:48,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:38:48,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:38:48,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:38:48,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:38:48,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:38:48,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:49,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047ed666/fcdb8aa7ba6a40cea2dacb131eb62a0e/FLAG847baf6ce [2025-03-16 19:38:49,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:38:49,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:49,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047ed666/fcdb8aa7ba6a40cea2dacb131eb62a0e/FLAG847baf6ce [2025-03-16 19:38:49,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047ed666/fcdb8aa7ba6a40cea2dacb131eb62a0e [2025-03-16 19:38:49,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:38:49,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:38:49,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:49,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:38:49,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:38:49,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:49" (1/1) ... [2025-03-16 19:38:49,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccdb064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:49, skipping insertion in model container [2025-03-16 19:38:49,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:49" (1/1) ... [2025-03-16 19:38:49,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:38:50,252 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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15542,15555] [2025-03-16 19:38:50,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:50,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:38:50,381 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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15542,15555] [2025-03-16 19:38:50,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:50,426 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:38:50,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50 WrapperNode [2025-03-16 19:38:50,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:50,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:50,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:38:50,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:38:50,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,481 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1350 [2025-03-16 19:38:50,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:50,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:38:50,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:38:50,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:38:50,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:38:50,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:38:50,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:38:50,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:38:50,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:38:50,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (1/1) ... [2025-03-16 19:38:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:38:50,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:38:50,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:38:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:38:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:38:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:38:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:38:50,720 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:38:50,722 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:38:51,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1291: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:38:51,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L967: havoc main_~node3__newmax~4#1; [2025-03-16 19:38:51,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~node2__newmax~4#1; [2025-03-16 19:38:51,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L901: havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1__newmax~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-16 19:38:51,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1406: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:38:51,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1176: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:38:51,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: havoc main_~check__tmp~4#1; [2025-03-16 19:38:51,685 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-16 19:38:51,686 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:38:51,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:38:51,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:38:51,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:51 BoogieIcfgContainer [2025-03-16 19:38:51,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:38:51,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:38:51,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:38:51,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:38:51,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:38:49" (1/3) ... [2025-03-16 19:38:51,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65eb028a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:51, skipping insertion in model container [2025-03-16 19:38:51,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:50" (2/3) ... [2025-03-16 19:38:51,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65eb028a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:51, skipping insertion in model container [2025-03-16 19:38:51,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:51" (3/3) ... [2025-03-16 19:38:51,713 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:51,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:38:51,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 323 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:38:51,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:38:51,781 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;@652bcb3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:38:51,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:38:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 321 states have (on average 1.7819314641744548) internal successors, (572), 322 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 19:38:51,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:51,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:51,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1148177381, now seen corresponding path program 1 times [2025-03-16 19:38:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532138698] [2025-03-16 19:38:51,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:38:52,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:38:52,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:52,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532138698] [2025-03-16 19:38:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532138698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:52,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614790906] [2025-03-16 19:38:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:52,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:52,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:52,747 INFO L87 Difference]: Start difference. First operand has 323 states, 321 states have (on average 1.7819314641744548) internal successors, (572), 322 states have internal predecessors, (572), 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 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:52,919 INFO L93 Difference]: Finished difference Result 1556 states and 2763 transitions. [2025-03-16 19:38:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-03-16 19:38:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:52,936 INFO L225 Difference]: With dead ends: 1556 [2025-03-16 19:38:52,936 INFO L226 Difference]: Without dead ends: 1233 [2025-03-16 19:38:52,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 19:38:52,943 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 1673 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:52,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 2578 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-16 19:38:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 620. [2025-03-16 19:38:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4588045234248788) internal successors, (903), 619 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 903 transitions. [2025-03-16 19:38:53,014 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 903 transitions. Word has length 149 [2025-03-16 19:38:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:53,014 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 903 transitions. [2025-03-16 19:38:53,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 903 transitions. [2025-03-16 19:38:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:38:53,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:53,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:53,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:38:53,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:53,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 344526701, now seen corresponding path program 1 times [2025-03-16 19:38:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:53,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774852157] [2025-03-16 19:38:53,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:38:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:38:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:53,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774852157] [2025-03-16 19:38:53,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774852157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790129368] [2025-03-16 19:38:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:53,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:53,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:53,164 INFO L87 Difference]: Start difference. First operand 620 states and 903 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:53,200 INFO L93 Difference]: Finished difference Result 1215 states and 1764 transitions. [2025-03-16 19:38:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:53,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2025-03-16 19:38:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:53,202 INFO L225 Difference]: With dead ends: 1215 [2025-03-16 19:38:53,202 INFO L226 Difference]: Without dead ends: 622 [2025-03-16 19:38:53,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:53,207 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:53,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-16 19:38:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2025-03-16 19:38:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.4573268921095008) internal successors, (905), 621 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 905 transitions. [2025-03-16 19:38:53,230 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 905 transitions. Word has length 150 [2025-03-16 19:38:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:53,231 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 905 transitions. [2025-03-16 19:38:53,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 905 transitions. [2025-03-16 19:38:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:38:53,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:53,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:38:53,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1883602765, now seen corresponding path program 1 times [2025-03-16 19:38:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973624870] [2025-03-16 19:38:53,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:38:53,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:38:53,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:53,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973624870] [2025-03-16 19:38:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973624870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903859734] [2025-03-16 19:38:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:53,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:53,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:53,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:53,749 INFO L87 Difference]: Start difference. First operand 622 states and 905 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:53,787 INFO L93 Difference]: Finished difference Result 1231 states and 1790 transitions. [2025-03-16 19:38:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 151 [2025-03-16 19:38:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:53,790 INFO L225 Difference]: With dead ends: 1231 [2025-03-16 19:38:53,790 INFO L226 Difference]: Without dead ends: 622 [2025-03-16 19:38:53,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:53,795 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 20 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:53,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-16 19:38:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 621. [2025-03-16 19:38:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.4548387096774194) internal successors, (902), 620 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 902 transitions. [2025-03-16 19:38:53,813 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 902 transitions. Word has length 151 [2025-03-16 19:38:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:53,813 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 902 transitions. [2025-03-16 19:38:53,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 902 transitions. [2025-03-16 19:38:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:38:53,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:53,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:38:53,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1447510440, now seen corresponding path program 1 times [2025-03-16 19:38:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527821696] [2025-03-16 19:38:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:38:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:38:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527821696] [2025-03-16 19:38:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527821696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821451119] [2025-03-16 19:38:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:53,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:53,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:53,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:53,926 INFO L87 Difference]: Start difference. First operand 621 states and 902 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:53,970 INFO L93 Difference]: Finished difference Result 1626 states and 2369 transitions. [2025-03-16 19:38:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:53,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2025-03-16 19:38:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:53,975 INFO L225 Difference]: With dead ends: 1626 [2025-03-16 19:38:53,976 INFO L226 Difference]: Without dead ends: 1198 [2025-03-16 19:38:53,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:53,979 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 394 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:53,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1311 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-16 19:38:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1196. [2025-03-16 19:38:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.4384937238493725) internal successors, (1719), 1195 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1719 transitions. [2025-03-16 19:38:54,021 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1719 transitions. Word has length 151 [2025-03-16 19:38:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1719 transitions. [2025-03-16 19:38:54,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1719 transitions. [2025-03-16 19:38:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:38:54,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:54,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:54,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:38:54,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1712157930, now seen corresponding path program 1 times [2025-03-16 19:38:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539119976] [2025-03-16 19:38:54,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:54,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:38:54,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:38:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:54,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539119976] [2025-03-16 19:38:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539119976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636895120] [2025-03-16 19:38:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:54,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:54,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:54,405 INFO L87 Difference]: Start difference. First operand 1196 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:54,441 INFO L93 Difference]: Finished difference Result 1928 states and 2784 transitions. [2025-03-16 19:38:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 151 [2025-03-16 19:38:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:54,445 INFO L225 Difference]: With dead ends: 1928 [2025-03-16 19:38:54,445 INFO L226 Difference]: Without dead ends: 913 [2025-03-16 19:38:54,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:54,448 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 23 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:54,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1482 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-16 19:38:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-03-16 19:38:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.4342105263157894) internal successors, (1308), 912 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1308 transitions. [2025-03-16 19:38:54,465 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1308 transitions. Word has length 151 [2025-03-16 19:38:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:54,465 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1308 transitions. [2025-03-16 19:38:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1308 transitions. [2025-03-16 19:38:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 19:38:54,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:54,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:38:54,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:54,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash 101148475, now seen corresponding path program 1 times [2025-03-16 19:38:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:54,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11706244] [2025-03-16 19:38:54,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:54,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 19:38:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 19:38:54,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:54,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11706244] [2025-03-16 19:38:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11706244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318553940] [2025-03-16 19:38:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:54,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:54,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:54,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:54,544 INFO L87 Difference]: Start difference. First operand 913 states and 1308 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:54,582 INFO L93 Difference]: Finished difference Result 1867 states and 2759 transitions. [2025-03-16 19:38:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:54,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2025-03-16 19:38:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:54,587 INFO L225 Difference]: With dead ends: 1867 [2025-03-16 19:38:54,587 INFO L226 Difference]: Without dead ends: 1138 [2025-03-16 19:38:54,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:54,589 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 225 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:54,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 944 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-16 19:38:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1121. [2025-03-16 19:38:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.46875) internal successors, (1645), 1120 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1645 transitions. [2025-03-16 19:38:54,613 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1645 transitions. Word has length 152 [2025-03-16 19:38:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:54,615 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1645 transitions. [2025-03-16 19:38:54,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1645 transitions. [2025-03-16 19:38:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 19:38:54,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:54,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:38:54,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1964596700, now seen corresponding path program 1 times [2025-03-16 19:38:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187217882] [2025-03-16 19:38:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:54,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 19:38:54,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 19:38:54,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:54,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187217882] [2025-03-16 19:38:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187217882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166168034] [2025-03-16 19:38:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:54,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:54,696 INFO L87 Difference]: Start difference. First operand 1121 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:54,736 INFO L93 Difference]: Finished difference Result 2492 states and 3760 transitions. [2025-03-16 19:38:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:54,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2025-03-16 19:38:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:54,742 INFO L225 Difference]: With dead ends: 2492 [2025-03-16 19:38:54,742 INFO L226 Difference]: Without dead ends: 1639 [2025-03-16 19:38:54,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:54,744 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 298 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:54,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 959 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-03-16 19:38:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1498. [2025-03-16 19:38:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.5050100200400802) internal successors, (2253), 1497 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2253 transitions. [2025-03-16 19:38:54,773 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2253 transitions. Word has length 155 [2025-03-16 19:38:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:54,773 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2253 transitions. [2025-03-16 19:38:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2253 transitions. [2025-03-16 19:38:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 19:38:54,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:54,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:38:54,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 417989685, now seen corresponding path program 1 times [2025-03-16 19:38:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686205665] [2025-03-16 19:38:54,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 19:38:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 19:38:54,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686205665] [2025-03-16 19:38:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686205665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495543379] [2025-03-16 19:38:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:55,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:55,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:55,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:55,334 INFO L87 Difference]: Start difference. First operand 1498 states and 2253 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:55,966 INFO L93 Difference]: Finished difference Result 6562 states and 10251 transitions. [2025-03-16 19:38:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:38:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 8 states have internal predecessors, (155), 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 155 [2025-03-16 19:38:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:55,982 INFO L225 Difference]: With dead ends: 6562 [2025-03-16 19:38:55,983 INFO L226 Difference]: Without dead ends: 5281 [2025-03-16 19:38:55,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:38:55,986 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 4713 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4713 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:55,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4713 Valid, 2152 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:38:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2025-03-16 19:38:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 3505. [2025-03-16 19:38:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3504 states have (on average 1.5276826484018264) internal successors, (5353), 3504 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 5353 transitions. [2025-03-16 19:38:56,093 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 5353 transitions. Word has length 155 [2025-03-16 19:38:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:56,094 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 5353 transitions. [2025-03-16 19:38:56,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 5353 transitions. [2025-03-16 19:38:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 19:38:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:56,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:38:56,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:56,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1576155021, now seen corresponding path program 1 times [2025-03-16 19:38:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153149484] [2025-03-16 19:38:56,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:56,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 19:38:56,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 19:38:56,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:56,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:56,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:56,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153149484] [2025-03-16 19:38:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153149484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:56,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298892557] [2025-03-16 19:38:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:56,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:56,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:56,355 INFO L87 Difference]: Start difference. First operand 3505 states and 5353 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:56,447 INFO L93 Difference]: Finished difference Result 6987 states and 10940 transitions. [2025-03-16 19:38:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:56,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 155 [2025-03-16 19:38:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:56,461 INFO L225 Difference]: With dead ends: 6987 [2025-03-16 19:38:56,461 INFO L226 Difference]: Without dead ends: 4405 [2025-03-16 19:38:56,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:56,466 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 804 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:56,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 853 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2025-03-16 19:38:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4403. [2025-03-16 19:38:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4403 states, 4402 states have (on average 1.53430258973194) internal successors, (6754), 4402 states have internal predecessors, (6754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 6754 transitions. [2025-03-16 19:38:56,575 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 6754 transitions. Word has length 155 [2025-03-16 19:38:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:56,575 INFO L471 AbstractCegarLoop]: Abstraction has 4403 states and 6754 transitions. [2025-03-16 19:38:56,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 6754 transitions. [2025-03-16 19:38:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 19:38:56,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:56,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:38:56,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1707695025, now seen corresponding path program 1 times [2025-03-16 19:38:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747172193] [2025-03-16 19:38:56,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:56,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 19:38:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 19:38:56,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747172193] [2025-03-16 19:38:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747172193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:56,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571204161] [2025-03-16 19:38:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:56,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:56,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:56,850 INFO L87 Difference]: Start difference. First operand 4403 states and 6754 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:56,930 INFO L93 Difference]: Finished difference Result 11519 states and 17667 transitions. [2025-03-16 19:38:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2025-03-16 19:38:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:56,954 INFO L225 Difference]: With dead ends: 11519 [2025-03-16 19:38:56,954 INFO L226 Difference]: Without dead ends: 7152 [2025-03-16 19:38:56,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:56,962 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 395 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:56,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1579 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7152 states. [2025-03-16 19:38:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7152 to 7150. [2025-03-16 19:38:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7149 states have (on average 1.5209120156665268) internal successors, (10873), 7149 states have internal predecessors, (10873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 10873 transitions. [2025-03-16 19:38:57,121 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 10873 transitions. Word has length 155 [2025-03-16 19:38:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:57,121 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 10873 transitions. [2025-03-16 19:38:57,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 10873 transitions. [2025-03-16 19:38:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 19:38:57,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:57,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:38:57,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1773733266, now seen corresponding path program 1 times [2025-03-16 19:38:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:57,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054856530] [2025-03-16 19:38:57,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:57,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 19:38:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 19:38:57,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054856530] [2025-03-16 19:38:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054856530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:57,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:57,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331974196] [2025-03-16 19:38:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:57,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:57,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:57,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:57,195 INFO L87 Difference]: Start difference. First operand 7150 states and 10873 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:57,278 INFO L93 Difference]: Finished difference Result 17945 states and 27370 transitions. [2025-03-16 19:38:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2025-03-16 19:38:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:57,307 INFO L225 Difference]: With dead ends: 17945 [2025-03-16 19:38:57,307 INFO L226 Difference]: Without dead ends: 11162 [2025-03-16 19:38:57,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:57,318 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 384 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:57,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1197 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11162 states. [2025-03-16 19:38:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11162 to 11160. [2025-03-16 19:38:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11160 states, 11159 states have (on average 1.5065866117035576) internal successors, (16812), 11159 states have internal predecessors, (16812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11160 states to 11160 states and 16812 transitions. [2025-03-16 19:38:57,556 INFO L78 Accepts]: Start accepts. Automaton has 11160 states and 16812 transitions. Word has length 157 [2025-03-16 19:38:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:57,558 INFO L471 AbstractCegarLoop]: Abstraction has 11160 states and 16812 transitions. [2025-03-16 19:38:57,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11160 states and 16812 transitions. [2025-03-16 19:38:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:38:57,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:57,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:38:57,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:57,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -660527365, now seen corresponding path program 1 times [2025-03-16 19:38:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381867679] [2025-03-16 19:38:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:57,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:38:57,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:38:57,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:57,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381867679] [2025-03-16 19:38:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381867679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:58,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:58,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034817157] [2025-03-16 19:38:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:58,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:58,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:58,024 INFO L87 Difference]: Start difference. First operand 11160 states and 16812 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:58,870 INFO L93 Difference]: Finished difference Result 56782 states and 86378 transitions. [2025-03-16 19:38:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:38:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 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 161 [2025-03-16 19:38:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:58,971 INFO L225 Difference]: With dead ends: 56782 [2025-03-16 19:38:58,971 INFO L226 Difference]: Without dead ends: 46107 [2025-03-16 19:38:58,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:38:58,988 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 4466 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:58,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4466 Valid, 2106 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:38:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46107 states. [2025-03-16 19:38:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46107 to 30291. [2025-03-16 19:38:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30291 states, 30290 states have (on average 1.506602839220865) internal successors, (45635), 30290 states have internal predecessors, (45635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30291 states to 30291 states and 45635 transitions. [2025-03-16 19:38:59,785 INFO L78 Accepts]: Start accepts. Automaton has 30291 states and 45635 transitions. Word has length 161 [2025-03-16 19:38:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:59,785 INFO L471 AbstractCegarLoop]: Abstraction has 30291 states and 45635 transitions. [2025-03-16 19:38:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30291 states and 45635 transitions. [2025-03-16 19:38:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:38:59,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:59,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:38:59,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash 40537213, now seen corresponding path program 1 times [2025-03-16 19:38:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886433009] [2025-03-16 19:38:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:38:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:38:59,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886433009] [2025-03-16 19:39:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886433009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893044816] [2025-03-16 19:39:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:00,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:00,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:00,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:00,034 INFO L87 Difference]: Start difference. First operand 30291 states and 45635 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:00,426 INFO L93 Difference]: Finished difference Result 65131 states and 99565 transitions. [2025-03-16 19:39:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 161 [2025-03-16 19:39:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:00,511 INFO L225 Difference]: With dead ends: 65131 [2025-03-16 19:39:00,511 INFO L226 Difference]: Without dead ends: 39157 [2025-03-16 19:39:00,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:00,537 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 750 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:00,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 842 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39157 states. [2025-03-16 19:39:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39157 to 39155. [2025-03-16 19:39:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39155 states, 39154 states have (on average 1.5113398375644889) internal successors, (59175), 39154 states have internal predecessors, (59175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39155 states to 39155 states and 59175 transitions. [2025-03-16 19:39:01,261 INFO L78 Accepts]: Start accepts. Automaton has 39155 states and 59175 transitions. Word has length 161 [2025-03-16 19:39:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:01,261 INFO L471 AbstractCegarLoop]: Abstraction has 39155 states and 59175 transitions. [2025-03-16 19:39:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39155 states and 59175 transitions. [2025-03-16 19:39:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:39:01,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:01,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:01,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:39:01,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:01,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1815544575, now seen corresponding path program 1 times [2025-03-16 19:39:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:01,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748916106] [2025-03-16 19:39:01,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:01,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:39:01,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:39:01,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:01,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748916106] [2025-03-16 19:39:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748916106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:39:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571164574] [2025-03-16 19:39:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:01,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:39:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:01,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:39:01,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:39:01,451 INFO L87 Difference]: Start difference. First operand 39155 states and 59175 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:01,915 INFO L93 Difference]: Finished difference Result 122116 states and 186252 transitions. [2025-03-16 19:39:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:39:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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 161 [2025-03-16 19:39:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:02,152 INFO L225 Difference]: With dead ends: 122116 [2025-03-16 19:39:02,152 INFO L226 Difference]: Without dead ends: 103344 [2025-03-16 19:39:02,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:39:02,212 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1073 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:02,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1348 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103344 states. [2025-03-16 19:39:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103344 to 78322. [2025-03-16 19:39:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78322 states, 78321 states have (on average 1.5146895468648256) internal successors, (118632), 78321 states have internal predecessors, (118632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78322 states to 78322 states and 118632 transitions. [2025-03-16 19:39:03,727 INFO L78 Accepts]: Start accepts. Automaton has 78322 states and 118632 transitions. Word has length 161 [2025-03-16 19:39:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 78322 states and 118632 transitions. [2025-03-16 19:39:03,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 78322 states and 118632 transitions. [2025-03-16 19:39:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:39:03,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:03,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:39:03,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:03,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 10106241, now seen corresponding path program 1 times [2025-03-16 19:39:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551884501] [2025-03-16 19:39:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:03,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:39:03,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:39:03,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:03,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551884501] [2025-03-16 19:39:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551884501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073642828] [2025-03-16 19:39:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:03,824 INFO L87 Difference]: Start difference. First operand 78322 states and 118632 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:04,624 INFO L93 Difference]: Finished difference Result 207397 states and 315753 transitions. [2025-03-16 19:39:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 161 [2025-03-16 19:39:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:04,884 INFO L225 Difference]: With dead ends: 207397 [2025-03-16 19:39:04,885 INFO L226 Difference]: Without dead ends: 133745 [2025-03-16 19:39:04,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:04,955 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 279 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:04,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 757 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133745 states. [2025-03-16 19:39:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133745 to 133743. [2025-03-16 19:39:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133743 states, 133742 states have (on average 1.5150139821447264) internal successors, (202621), 133742 states have internal predecessors, (202621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133743 states to 133743 states and 202621 transitions. [2025-03-16 19:39:07,164 INFO L78 Accepts]: Start accepts. Automaton has 133743 states and 202621 transitions. Word has length 161 [2025-03-16 19:39:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 133743 states and 202621 transitions. [2025-03-16 19:39:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 133743 states and 202621 transitions. [2025-03-16 19:39:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:39:07,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:07,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:07,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:39:07,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 994477371, now seen corresponding path program 1 times [2025-03-16 19:39:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122264095] [2025-03-16 19:39:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:07,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:39:07,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:39:07,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:07,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122264095] [2025-03-16 19:39:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122264095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406142126] [2025-03-16 19:39:07,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:07,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:07,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:07,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:07,658 INFO L87 Difference]: Start difference. First operand 133743 states and 202621 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:09,561 INFO L93 Difference]: Finished difference Result 648121 states and 983091 transitions. [2025-03-16 19:39:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:39:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 161 [2025-03-16 19:39:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:10,519 INFO L225 Difference]: With dead ends: 648121 [2025-03-16 19:39:10,519 INFO L226 Difference]: Without dead ends: 514426 [2025-03-16 19:39:10,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 19:39:10,940 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1243 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:10,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1955 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514426 states. [2025-03-16 19:39:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514426 to 257264. [2025-03-16 19:39:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257264 states, 257263 states have (on average 1.5063378721386285) internal successors, (387525), 257263 states have internal predecessors, (387525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257264 states to 257264 states and 387525 transitions. [2025-03-16 19:39:16,971 INFO L78 Accepts]: Start accepts. Automaton has 257264 states and 387525 transitions. Word has length 161 [2025-03-16 19:39:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:16,971 INFO L471 AbstractCegarLoop]: Abstraction has 257264 states and 387525 transitions. [2025-03-16 19:39:16,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 257264 states and 387525 transitions. [2025-03-16 19:39:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 19:39:16,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:16,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:16,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:39:16,994 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -443094979, now seen corresponding path program 1 times [2025-03-16 19:39:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081708790] [2025-03-16 19:39:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:17,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 19:39:17,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 19:39:17,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:17,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081708790] [2025-03-16 19:39:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081708790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:17,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682464094] [2025-03-16 19:39:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:17,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:17,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:17,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:17,118 INFO L87 Difference]: Start difference. First operand 257264 states and 387525 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:19,041 INFO L93 Difference]: Finished difference Result 514414 states and 774898 transitions. [2025-03-16 19:39:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 162 [2025-03-16 19:39:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:19,524 INFO L225 Difference]: With dead ends: 514414 [2025-03-16 19:39:19,524 INFO L226 Difference]: Without dead ends: 257272 [2025-03-16 19:39:19,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:19,677 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:19,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 898 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257272 states. [2025-03-16 19:39:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257272 to 257272. [2025-03-16 19:39:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257272 states, 257271 states have (on average 1.506322127251031) internal successors, (387533), 257271 states have internal predecessors, (387533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257272 states to 257272 states and 387533 transitions. [2025-03-16 19:39:23,558 INFO L78 Accepts]: Start accepts. Automaton has 257272 states and 387533 transitions. Word has length 162 [2025-03-16 19:39:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 257272 states and 387533 transitions. [2025-03-16 19:39:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 257272 states and 387533 transitions. [2025-03-16 19:39:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 19:39:23,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:23,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:39:23,574 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1377439789, now seen corresponding path program 1 times [2025-03-16 19:39:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345780307] [2025-03-16 19:39:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:23,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 19:39:23,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 19:39:23,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:23,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345780307] [2025-03-16 19:39:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345780307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:24,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:24,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:24,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975468614] [2025-03-16 19:39:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:24,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:24,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:24,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:24,177 INFO L87 Difference]: Start difference. First operand 257272 states and 387533 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:26,027 INFO L93 Difference]: Finished difference Result 514496 states and 774999 transitions. [2025-03-16 19:39:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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 163 [2025-03-16 19:39:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:26,497 INFO L225 Difference]: With dead ends: 514496 [2025-03-16 19:39:26,497 INFO L226 Difference]: Without dead ends: 257264 [2025-03-16 19:39:26,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:26,584 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 14 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:26,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257264 states. [2025-03-16 19:39:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257264 to 257264. [2025-03-16 19:39:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257264 states, 257263 states have (on average 1.5063067755565316) internal successors, (387517), 257263 states have internal predecessors, (387517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257264 states to 257264 states and 387517 transitions. [2025-03-16 19:39:30,674 INFO L78 Accepts]: Start accepts. Automaton has 257264 states and 387517 transitions. Word has length 163 [2025-03-16 19:39:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:30,674 INFO L471 AbstractCegarLoop]: Abstraction has 257264 states and 387517 transitions. [2025-03-16 19:39:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 257264 states and 387517 transitions. [2025-03-16 19:39:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 19:39:30,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:30,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:39:30,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -932005768, now seen corresponding path program 1 times [2025-03-16 19:39:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733670232] [2025-03-16 19:39:30,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 19:39:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 19:39:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733670232] [2025-03-16 19:39:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733670232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:30,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335355896] [2025-03-16 19:39:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:30,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:30,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:30,779 INFO L87 Difference]: Start difference. First operand 257264 states and 387517 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:33,096 INFO L93 Difference]: Finished difference Result 622510 states and 936207 transitions. [2025-03-16 19:39:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2025-03-16 19:39:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:33,730 INFO L225 Difference]: With dead ends: 622510 [2025-03-16 19:39:33,730 INFO L226 Difference]: Without dead ends: 366132 [2025-03-16 19:39:33,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:33,834 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 363 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:33,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1238 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366132 states.