./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-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 351e3bc8fe69313dfbfbeaf7f37de5791a1bf381bb5ef0945347e83cb39fb485 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:28:45,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:28:45,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:28:45,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:28:45,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:28:45,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:28:45,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:28:45,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:28:45,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:28:45,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:28:45,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:28:45,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:28:45,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:28:45,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:28:45,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:45,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:28:45,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:28:45,590 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 -> 351e3bc8fe69313dfbfbeaf7f37de5791a1bf381bb5ef0945347e83cb39fb485 [2025-03-16 19:28:45,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:28:45,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:28:45,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:28:45,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:28:45,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:28:45,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:28:46,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b535306eb/f7306023e6e64930bea1c5f041d0a526/FLAGda57f4cad [2025-03-16 19:28:47,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:28:47,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:28:47,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b535306eb/f7306023e6e64930bea1c5f041d0a526/FLAGda57f4cad [2025-03-16 19:28:47,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b535306eb/f7306023e6e64930bea1c5f041d0a526 [2025-03-16 19:28:47,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:28:47,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:28:47,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:47,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:28:47,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:28:47,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:47" (1/1) ... [2025-03-16 19:28:47,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:47, skipping insertion in model container [2025-03-16 19:28:47,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:47" (1/1) ... [2025-03-16 19:28:47,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:28:47,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[11101,11114] [2025-03-16 19:28:47,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:47,890 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:28:47,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[11101,11114] [2025-03-16 19:28:47,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:48,003 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:28:48,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48 WrapperNode [2025-03-16 19:28:48,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:48,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:48,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:28:48,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:28:48,009 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:28:48" (1/1) ... [2025-03-16 19:28:48,024 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:28:48" (1/1) ... [2025-03-16 19:28:48,054 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1197 [2025-03-16 19:28:48,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:48,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:28:48,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:28:48,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:28:48,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,078 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:28:48,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:28:48,093 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:28:48,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:28:48,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:28:48,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (1/1) ... [2025-03-16 19:28:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:48,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:28:48,123 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:28:48,126 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:28:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:28:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:28:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:28:48,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:28:48,251 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:28:48,253 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:28:49,040 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1324: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: havoc main_~node5__m5~0#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L505: havoc main_~node2__m2~2#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1496: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:49,041 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L837: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: havoc main_~node2__m2~1#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node4__m4~2#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1037: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L609: 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; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node4__m4~1#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1668: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1; [2025-03-16 19:28:49,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1009: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L779: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: havoc main_~node4__m4~0#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1410: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1840: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node1__m1~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; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1610: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: havoc main_~node1__m1~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; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:49,043 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node3__m3~2#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1382: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1152: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node3__m3~1#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node5__m5~2#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1124: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:49,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~node3__m3~0#1; [2025-03-16 19:28:49,098 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 19:28:49,099 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:28:49,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:28:49,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:28:49,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:49 BoogieIcfgContainer [2025-03-16 19:28:49,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:28:49,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:28:49,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:28:49,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:28:49,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:28:47" (1/3) ... [2025-03-16 19:28:49,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113a640d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:49, skipping insertion in model container [2025-03-16 19:28:49,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:48" (2/3) ... [2025-03-16 19:28:49,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113a640d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:49, skipping insertion in model container [2025-03-16 19:28:49,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:49" (3/3) ... [2025-03-16 19:28:49,122 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-16 19:28:49,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:28:49,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c that has 1 procedures, 329 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:28:49,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:28:49,177 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;@58d64a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:28:49,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:28:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 329 states, 327 states have (on average 1.654434250764526) internal successors, (541), 328 states have internal predecessors, (541), 0 states have call successors, (0), 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:28:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:49,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:49,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:49,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -255948889, now seen corresponding path program 1 times [2025-03-16 19:28:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725009201] [2025-03-16 19:28:49,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:49,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:49,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:49,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:49,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:49,640 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:28:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725009201] [2025-03-16 19:28:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725009201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696669362] [2025-03-16 19:28:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:49,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:49,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:49,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:49,659 INFO L87 Difference]: Start difference. First operand has 329 states, 327 states have (on average 1.654434250764526) internal successors, (541), 328 states have internal predecessors, (541), 0 states have call successors, (0), 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 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:49,770 INFO L93 Difference]: Finished difference Result 626 states and 1018 transitions. [2025-03-16 19:28:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:28:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:49,779 INFO L225 Difference]: With dead ends: 626 [2025-03-16 19:28:49,779 INFO L226 Difference]: Without dead ends: 326 [2025-03-16 19:28:49,782 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:28:49,783 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 154 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:49,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1409 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-16 19:28:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-16 19:28:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.5384615384615385) internal successors, (500), 325 states have internal predecessors, (500), 0 states have call successors, (0), 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:28:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 500 transitions. [2025-03-16 19:28:49,815 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 500 transitions. Word has length 78 [2025-03-16 19:28:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:49,815 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 500 transitions. [2025-03-16 19:28:49,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:28:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 500 transitions. [2025-03-16 19:28:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:28:49,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:49,818 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] [2025-03-16 19:28:49,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:28:49,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:49,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1535016679, now seen corresponding path program 1 times [2025-03-16 19:28:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512096634] [2025-03-16 19:28:49,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:49,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:28:49,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:28:49,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:49,994 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:28:49,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:49,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512096634] [2025-03-16 19:28:49,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512096634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:49,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:49,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957175858] [2025-03-16 19:28:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:49,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:49,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:49,996 INFO L87 Difference]: Start difference. First operand 326 states and 500 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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:28:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,037 INFO L93 Difference]: Finished difference Result 760 states and 1192 transitions. [2025-03-16 19:28:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 19:28:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,040 INFO L225 Difference]: With dead ends: 760 [2025-03-16 19:28:50,042 INFO L226 Difference]: Without dead ends: 482 [2025-03-16 19:28:50,042 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:28:50,043 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 304 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 889 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-16 19:28:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2025-03-16 19:28:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.5532359081419624) internal successors, (744), 479 states have internal predecessors, (744), 0 states have call successors, (0), 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:28:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 744 transitions. [2025-03-16 19:28:50,062 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 744 transitions. Word has length 109 [2025-03-16 19:28:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,062 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 744 transitions. [2025-03-16 19:28:50,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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:28:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 744 transitions. [2025-03-16 19:28:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:28:50,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,065 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] [2025-03-16 19:28:50,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:28:50,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:50,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1576489922, now seen corresponding path program 1 times [2025-03-16 19:28:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781832188] [2025-03-16 19:28:50,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:28:50,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:28:50,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,186 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:28:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781832188] [2025-03-16 19:28:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781832188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061236055] [2025-03-16 19:28:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:50,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:50,187 INFO L87 Difference]: Start difference. First operand 480 states and 744 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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:28:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,217 INFO L93 Difference]: Finished difference Result 1162 states and 1831 transitions. [2025-03-16 19:28:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:28:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,222 INFO L225 Difference]: With dead ends: 1162 [2025-03-16 19:28:50,222 INFO L226 Difference]: Without dead ends: 743 [2025-03-16 19:28:50,223 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:28:50,224 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 289 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 952 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-16 19:28:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2025-03-16 19:28:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.5635135135135134) internal successors, (1157), 740 states have internal predecessors, (1157), 0 states have call successors, (0), 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:28:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1157 transitions. [2025-03-16 19:28:50,246 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1157 transitions. Word has length 111 [2025-03-16 19:28:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,246 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1157 transitions. [2025-03-16 19:28:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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:28:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1157 transitions. [2025-03-16 19:28:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:28:50,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,249 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] [2025-03-16 19:28:50,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:28:50,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:50,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2004670115, now seen corresponding path program 1 times [2025-03-16 19:28:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658753514] [2025-03-16 19:28:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:28:50,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:28:50,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,362 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:28:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658753514] [2025-03-16 19:28:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658753514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140951901] [2025-03-16 19:28:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:50,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:50,364 INFO L87 Difference]: Start difference. First operand 741 states and 1157 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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:28:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,408 INFO L93 Difference]: Finished difference Result 1833 states and 2893 transitions. [2025-03-16 19:28:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 19:28:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,412 INFO L225 Difference]: With dead ends: 1833 [2025-03-16 19:28:50,415 INFO L226 Difference]: Without dead ends: 1166 [2025-03-16 19:28:50,415 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:28:50,418 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 274 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 819 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-16 19:28:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1164. [2025-03-16 19:28:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.5674978503869303) internal successors, (1823), 1163 states have internal predecessors, (1823), 0 states have call successors, (0), 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:28:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1823 transitions. [2025-03-16 19:28:50,440 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1823 transitions. Word has length 113 [2025-03-16 19:28:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,442 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1823 transitions. [2025-03-16 19:28:50,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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:28:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1823 transitions. [2025-03-16 19:28:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:28:50,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,445 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] [2025-03-16 19:28:50,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:28:50,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -287243486, now seen corresponding path program 1 times [2025-03-16 19:28:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621612756] [2025-03-16 19:28:50,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:28:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:28:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621612756] [2025-03-16 19:28:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621612756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884591821] [2025-03-16 19:28:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:50,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:50,529 INFO L87 Difference]: Start difference. First operand 1164 states and 1823 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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:28:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,565 INFO L93 Difference]: Finished difference Result 2886 states and 4546 transitions. [2025-03-16 19:28:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:28:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,572 INFO L225 Difference]: With dead ends: 2886 [2025-03-16 19:28:50,573 INFO L226 Difference]: Without dead ends: 1809 [2025-03-16 19:28:50,575 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:28:50,576 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 259 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 784 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-03-16 19:28:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1807. [2025-03-16 19:28:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1806 states have (on average 1.5642303433001108) internal successors, (2825), 1806 states have internal predecessors, (2825), 0 states have call successors, (0), 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:28:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2825 transitions. [2025-03-16 19:28:50,606 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2825 transitions. Word has length 115 [2025-03-16 19:28:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,606 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2825 transitions. [2025-03-16 19:28:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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:28:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2825 transitions. [2025-03-16 19:28:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:28:50,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,610 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] [2025-03-16 19:28:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:28:50,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -887584957, now seen corresponding path program 1 times [2025-03-16 19:28:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264842297] [2025-03-16 19:28:50,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:28:50,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:28:50,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,696 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:28:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264842297] [2025-03-16 19:28:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264842297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288144861] [2025-03-16 19:28:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:50,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:50,697 INFO L87 Difference]: Start difference. First operand 1807 states and 2825 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:28:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,730 INFO L93 Difference]: Finished difference Result 4391 states and 6871 transitions. [2025-03-16 19:28:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-16 19:28:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,739 INFO L225 Difference]: With dead ends: 4391 [2025-03-16 19:28:50,739 INFO L226 Difference]: Without dead ends: 2684 [2025-03-16 19:28:50,742 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:28:50,742 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 244 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 760 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2025-03-16 19:28:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682. [2025-03-16 19:28:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2681 states have (on average 1.5512868332711676) internal successors, (4159), 2681 states have internal predecessors, (4159), 0 states have call successors, (0), 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:28:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4159 transitions. [2025-03-16 19:28:50,813 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 4159 transitions. Word has length 117 [2025-03-16 19:28:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:50,813 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 4159 transitions. [2025-03-16 19:28:50,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:28:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 4159 transitions. [2025-03-16 19:28:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:28:50,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:50,817 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] [2025-03-16 19:28:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:28:50,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:50,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -44790938, now seen corresponding path program 1 times [2025-03-16 19:28:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382295291] [2025-03-16 19:28:50,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:28:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:28:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:50,995 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:28:50,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:50,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382295291] [2025-03-16 19:28:50,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382295291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:50,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947243473] [2025-03-16 19:28:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:50,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:50,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:50,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:50,998 INFO L87 Difference]: Start difference. First operand 2682 states and 4159 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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:28:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:51,234 INFO L93 Difference]: Finished difference Result 15783 states and 24518 transitions. [2025-03-16 19:28:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 19:28:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:51,272 INFO L225 Difference]: With dead ends: 15783 [2025-03-16 19:28:51,273 INFO L226 Difference]: Without dead ends: 13205 [2025-03-16 19:28:51,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:51,278 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 3064 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 3248 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:51,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 3248 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13205 states. [2025-03-16 19:28:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13205 to 5165. [2025-03-16 19:28:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.5296281951975212) internal successors, (7899), 5164 states have internal predecessors, (7899), 0 states have call successors, (0), 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:28:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 7899 transitions. [2025-03-16 19:28:51,441 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 7899 transitions. Word has length 119 [2025-03-16 19:28:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:51,442 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 7899 transitions. [2025-03-16 19:28:51,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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:28:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 7899 transitions. [2025-03-16 19:28:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:28:51,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:51,449 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] [2025-03-16 19:28:51,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:28:51,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1662624234, now seen corresponding path program 1 times [2025-03-16 19:28:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174309284] [2025-03-16 19:28:51,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:28:51,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:28:51,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:51,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:51,677 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:28:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174309284] [2025-03-16 19:28:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174309284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:51,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:51,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361175015] [2025-03-16 19:28:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:51,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:51,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:51,679 INFO L87 Difference]: Start difference. First operand 5165 states and 7899 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 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:28:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:51,941 INFO L93 Difference]: Finished difference Result 26106 states and 39535 transitions. [2025-03-16 19:28:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-16 19:28:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:51,990 INFO L225 Difference]: With dead ends: 26106 [2025-03-16 19:28:51,990 INFO L226 Difference]: Without dead ends: 21035 [2025-03-16 19:28:52,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:52,003 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 3630 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3630 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:52,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3630 Valid, 1599 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21035 states. [2025-03-16 19:28:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21035 to 21027. [2025-03-16 19:28:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21027 states, 21026 states have (on average 1.5041377342338058) internal successors, (31626), 21026 states have internal predecessors, (31626), 0 states have call successors, (0), 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:28:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21027 states to 21027 states and 31626 transitions. [2025-03-16 19:28:52,410 INFO L78 Accepts]: Start accepts. Automaton has 21027 states and 31626 transitions. Word has length 122 [2025-03-16 19:28:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:52,410 INFO L471 AbstractCegarLoop]: Abstraction has 21027 states and 31626 transitions. [2025-03-16 19:28:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 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:28:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21027 states and 31626 transitions. [2025-03-16 19:28:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:28:52,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:52,441 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] [2025-03-16 19:28:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:28:52,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 84226088, now seen corresponding path program 1 times [2025-03-16 19:28:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145647299] [2025-03-16 19:28:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:28:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:28:52,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:52,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:52,526 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:28:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145647299] [2025-03-16 19:28:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145647299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705754653] [2025-03-16 19:28:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:52,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:52,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:52,529 INFO L87 Difference]: Start difference. First operand 21027 states and 31626 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:52,662 INFO L93 Difference]: Finished difference Result 31850 states and 47779 transitions. [2025-03-16 19:28:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-16 19:28:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:52,714 INFO L225 Difference]: With dead ends: 31850 [2025-03-16 19:28:52,714 INFO L226 Difference]: Without dead ends: 27491 [2025-03-16 19:28:52,725 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:28:52,728 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 262 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:52,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1132 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27491 states. [2025-03-16 19:28:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27491 to 27489. [2025-03-16 19:28:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27489 states, 27488 states have (on average 1.4949432479627474) internal successors, (41093), 27488 states have internal predecessors, (41093), 0 states have call successors, (0), 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:28:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 41093 transitions. [2025-03-16 19:28:53,232 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 41093 transitions. Word has length 124 [2025-03-16 19:28:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:53,232 INFO L471 AbstractCegarLoop]: Abstraction has 27489 states and 41093 transitions. [2025-03-16 19:28:53,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 41093 transitions. [2025-03-16 19:28:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:28:53,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:53,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:28:53,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 221092908, now seen corresponding path program 1 times [2025-03-16 19:28:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465716353] [2025-03-16 19:28:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:53,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:28:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:28:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:53,420 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:28:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465716353] [2025-03-16 19:28:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465716353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:53,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:53,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54162242] [2025-03-16 19:28:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:53,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:53,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:53,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:53,422 INFO L87 Difference]: Start difference. First operand 27489 states and 41093 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:53,539 INFO L93 Difference]: Finished difference Result 56734 states and 84413 transitions. [2025-03-16 19:28:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-16 19:28:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:53,610 INFO L225 Difference]: With dead ends: 56734 [2025-03-16 19:28:53,610 INFO L226 Difference]: Without dead ends: 41672 [2025-03-16 19:28:53,639 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:28:53,639 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 309 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:53,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1171 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41672 states. [2025-03-16 19:28:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41672 to 41670. [2025-03-16 19:28:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41670 states, 41669 states have (on average 1.4806930811874535) internal successors, (61699), 41669 states have internal predecessors, (61699), 0 states have call successors, (0), 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:28:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41670 states to 41670 states and 61699 transitions. [2025-03-16 19:28:54,280 INFO L78 Accepts]: Start accepts. Automaton has 41670 states and 61699 transitions. Word has length 124 [2025-03-16 19:28:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 41670 states and 61699 transitions. [2025-03-16 19:28:54,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41670 states and 61699 transitions. [2025-03-16 19:28:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:28:54,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:54,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:28:54,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:54,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash 784762792, now seen corresponding path program 1 times [2025-03-16 19:28:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:54,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842184780] [2025-03-16 19:28:54,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:54,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:28:54,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:28:54,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:54,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842184780] [2025-03-16 19:28:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842184780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:54,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405348506] [2025-03-16 19:28:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:54,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:54,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:54,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:54,406 INFO L87 Difference]: Start difference. First operand 41670 states and 61699 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:54,938 INFO L93 Difference]: Finished difference Result 104131 states and 153378 transitions. [2025-03-16 19:28:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-16 19:28:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:55,066 INFO L225 Difference]: With dead ends: 104131 [2025-03-16 19:28:55,067 INFO L226 Difference]: Without dead ends: 71047 [2025-03-16 19:28:55,114 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:28:55,114 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 299 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:55,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1190 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71047 states. [2025-03-16 19:28:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71047 to 71045. [2025-03-16 19:28:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71045 states, 71044 states have (on average 1.4635437193851697) internal successors, (103976), 71044 states have internal predecessors, (103976), 0 states have call successors, (0), 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:28:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71045 states to 71045 states and 103976 transitions. [2025-03-16 19:28:56,085 INFO L78 Accepts]: Start accepts. Automaton has 71045 states and 103976 transitions. Word has length 124 [2025-03-16 19:28:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 71045 states and 103976 transitions. [2025-03-16 19:28:56,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71045 states and 103976 transitions. [2025-03-16 19:28:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:28:56,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:56,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:28:56,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -202719572, now seen corresponding path program 1 times [2025-03-16 19:28:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180844178] [2025-03-16 19:28:56,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:56,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:28:56,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:28:56,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:56,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:56,371 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:28:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180844178] [2025-03-16 19:28:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180844178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605482676] [2025-03-16 19:28:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:56,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:56,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:56,373 INFO L87 Difference]: Start difference. First operand 71045 states and 103976 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:56,919 INFO L93 Difference]: Finished difference Result 181691 states and 264346 transitions. [2025-03-16 19:28:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:56,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-16 19:28:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:57,057 INFO L225 Difference]: With dead ends: 181691 [2025-03-16 19:28:57,057 INFO L226 Difference]: Without dead ends: 116543 [2025-03-16 19:28:57,105 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:28:57,111 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 346 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:57,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1207 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116543 states. [2025-03-16 19:28:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116543 to 116541. [2025-03-16 19:28:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116541 states, 116540 states have (on average 1.442732109147074) internal successors, (168136), 116540 states have internal predecessors, (168136), 0 states have call successors, (0), 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:28:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116541 states to 116541 states and 168136 transitions. [2025-03-16 19:28:59,058 INFO L78 Accepts]: Start accepts. Automaton has 116541 states and 168136 transitions. Word has length 124 [2025-03-16 19:28:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 116541 states and 168136 transitions. [2025-03-16 19:28:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:28:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 116541 states and 168136 transitions. [2025-03-16 19:28:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:28:59,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:59,169 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] [2025-03-16 19:28:59,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:28:59,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:59,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1683553681, now seen corresponding path program 1 times [2025-03-16 19:28:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:59,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253383938] [2025-03-16 19:28:59,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:59,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:28:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:28:59,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:59,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:59,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253383938] [2025-03-16 19:28:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253383938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:59,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759999900] [2025-03-16 19:28:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:59,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:59,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:59,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:59,240 INFO L87 Difference]: Start difference. First operand 116541 states and 168136 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:00,600 INFO L93 Difference]: Finished difference Result 325224 states and 466897 transitions. [2025-03-16 19:29:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:29:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:00,955 INFO L225 Difference]: With dead ends: 325224 [2025-03-16 19:29:00,956 INFO L226 Difference]: Without dead ends: 230874 [2025-03-16 19:29:01,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:01,040 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 248 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:01,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 614 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230874 states. [2025-03-16 19:29:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230874 to 230872. [2025-03-16 19:29:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230872 states, 230871 states have (on average 1.4302575897362597) internal successors, (330205), 230871 states have internal predecessors, (330205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230872 states to 230872 states and 330205 transitions. [2025-03-16 19:29:04,814 INFO L78 Accepts]: Start accepts. Automaton has 230872 states and 330205 transitions. Word has length 126 [2025-03-16 19:29:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 230872 states and 330205 transitions. [2025-03-16 19:29:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 230872 states and 330205 transitions. [2025-03-16 19:29:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:29:05,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:05,041 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] [2025-03-16 19:29:05,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:29:05,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1200008816, now seen corresponding path program 1 times [2025-03-16 19:29:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183811872] [2025-03-16 19:29:05,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:29:05,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:29:05,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:05,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:05,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183811872] [2025-03-16 19:29:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183811872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:05,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:05,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:05,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476544562] [2025-03-16 19:29:05,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:05,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:05,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:05,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:05,153 INFO L87 Difference]: Start difference. First operand 230872 states and 330205 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:07,019 INFO L93 Difference]: Finished difference Result 551543 states and 789345 transitions. [2025-03-16 19:29:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:29:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:07,511 INFO L225 Difference]: With dead ends: 551543 [2025-03-16 19:29:07,512 INFO L226 Difference]: Without dead ends: 328568 [2025-03-16 19:29:07,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:07,633 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1556 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:07,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 397 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:29:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328568 states. [2025-03-16 19:29:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328568 to 324740. [2025-03-16 19:29:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324740 states, 324739 states have (on average 1.429446416968704) internal successors, (464197), 324739 states have internal predecessors, (464197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324740 states to 324740 states and 464197 transitions. [2025-03-16 19:29:12,464 INFO L78 Accepts]: Start accepts. Automaton has 324740 states and 464197 transitions. Word has length 126 [2025-03-16 19:29:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 324740 states and 464197 transitions. [2025-03-16 19:29:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 324740 states and 464197 transitions. [2025-03-16 19:29:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:29:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:12,575 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] [2025-03-16 19:29:12,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:29:12,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:12,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1203113614, now seen corresponding path program 1 times [2025-03-16 19:29:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907162707] [2025-03-16 19:29:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:12,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:29:12,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:29:12,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:12,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907162707] [2025-03-16 19:29:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907162707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522544765] [2025-03-16 19:29:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:12,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:12,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:12,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:12,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:12,689 INFO L87 Difference]: Start difference. First operand 324740 states and 464197 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:14,496 INFO L93 Difference]: Finished difference Result 615940 states and 881487 transitions. [2025-03-16 19:29:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:29:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:14,890 INFO L225 Difference]: With dead ends: 615940 [2025-03-16 19:29:14,890 INFO L226 Difference]: Without dead ends: 309421 [2025-03-16 19:29:15,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:15,070 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 201 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:15,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 744 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309421 states. [2025-03-16 19:29:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309421 to 309405. [2025-03-16 19:29:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309405 states, 309404 states have (on average 1.4201820273816756) internal successors, (439410), 309404 states have internal predecessors, (439410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309405 states to 309405 states and 439410 transitions. [2025-03-16 19:29:19,969 INFO L78 Accepts]: Start accepts. Automaton has 309405 states and 439410 transitions. Word has length 126 [2025-03-16 19:29:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:19,969 INFO L471 AbstractCegarLoop]: Abstraction has 309405 states and 439410 transitions. [2025-03-16 19:29:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 309405 states and 439410 transitions. [2025-03-16 19:29:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:29:20,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:20,029 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] [2025-03-16 19:29:20,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:29:20,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:20,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash -118225674, now seen corresponding path program 1 times [2025-03-16 19:29:20,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:20,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038091975] [2025-03-16 19:29:20,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:20,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:29:20,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:29:20,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038091975] [2025-03-16 19:29:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038091975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:20,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140692608] [2025-03-16 19:29:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:20,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:20,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:20,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:20,142 INFO L87 Difference]: Start difference. First operand 309405 states and 439410 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:21,585 INFO L93 Difference]: Finished difference Result 455021 states and 646380 transitions. [2025-03-16 19:29:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:29:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:21,759 INFO L225 Difference]: With dead ends: 455021 [2025-03-16 19:29:21,759 INFO L226 Difference]: Without dead ends: 155725 [2025-03-16 19:29:21,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:21,858 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 187 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:21,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 726 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155725 states. [2025-03-16 19:29:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155725 to 155709. [2025-03-16 19:29:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155709 states, 155708 states have (on average 1.4088421917948981) internal successors, (219368), 155708 states have internal predecessors, (219368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155709 states to 155709 states and 219368 transitions. [2025-03-16 19:29:24,160 INFO L78 Accepts]: Start accepts. Automaton has 155709 states and 219368 transitions. Word has length 126 [2025-03-16 19:29:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 155709 states and 219368 transitions. [2025-03-16 19:29:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 155709 states and 219368 transitions. [2025-03-16 19:29:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:29:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:24,191 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] [2025-03-16 19:29:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:29:24,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:24,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 634957338, now seen corresponding path program 1 times [2025-03-16 19:29:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447476297] [2025-03-16 19:29:24,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:29:24,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:29:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:24,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:24,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447476297] [2025-03-16 19:29:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447476297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:24,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:24,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:24,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085286150] [2025-03-16 19:29:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:24,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:24,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:24,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:24,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:24,275 INFO L87 Difference]: Start difference. First operand 155709 states and 219368 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:24,797 INFO L93 Difference]: Finished difference Result 228533 states and 322026 transitions. [2025-03-16 19:29:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 19:29:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:24,890 INFO L225 Difference]: With dead ends: 228533 [2025-03-16 19:29:24,890 INFO L226 Difference]: Without dead ends: 78965 [2025-03-16 19:29:24,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:24,979 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 162 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:24,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 689 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78965 states. [2025-03-16 19:29:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78965 to 78949. [2025-03-16 19:29:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78949 states, 78948 states have (on average 1.3970461569640775) internal successors, (110294), 78948 states have internal predecessors, (110294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78949 states to 78949 states and 110294 transitions. [2025-03-16 19:29:26,160 INFO L78 Accepts]: Start accepts. Automaton has 78949 states and 110294 transitions. Word has length 126 [2025-03-16 19:29:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:26,160 INFO L471 AbstractCegarLoop]: Abstraction has 78949 states and 110294 transitions. [2025-03-16 19:29:26,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78949 states and 110294 transitions. [2025-03-16 19:29:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:29:26,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:26,178 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] [2025-03-16 19:29:26,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:29:26,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:26,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 844423926, now seen corresponding path program 1 times [2025-03-16 19:29:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335112505] [2025-03-16 19:29:26,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:29:26,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:29:26,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:26,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat