./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5ce8f2917f3c045e2dd62444de112f0f7cfab2516baa3561b477720f1fd4fa0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:17:11,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:17:11,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:17:11,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:17:11,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:17:11,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:17:11,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:17:11,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:17:11,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:17:11,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:17:11,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:17:11,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:17:11,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:17:11,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:17:11,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:17:11,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:17:11,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:17:11,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:17:11,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:17:11,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:17:11,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:17:11,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:17:11,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:17:11,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:17:11,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:17:11,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:17:11,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:17:11,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:17:11,990 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-jdk21/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 -> 5ce8f2917f3c045e2dd62444de112f0f7cfab2516baa3561b477720f1fd4fa0b [2025-02-07 21:17:12,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:17:12,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:17:12,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:17:12,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:17:12,303 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:17:12,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c [2025-02-07 21:17:13,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c335a50cb/a873937d5bb34773acb74bc9e94b7cee/FLAG27125cd5c [2025-02-07 21:17:14,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:17:14,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c [2025-02-07 21:17:14,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c335a50cb/a873937d5bb34773acb74bc9e94b7cee/FLAG27125cd5c [2025-02-07 21:17:14,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c335a50cb/a873937d5bb34773acb74bc9e94b7cee [2025-02-07 21:17:14,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:17:14,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:17:14,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:17:14,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:17:14,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:17:14,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:14,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14, skipping insertion in model container [2025-02-07 21:17:14,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:14,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:17:14,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c[1937,1950] [2025-02-07 21:17:14,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:17:14,623 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:17:14,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.ok2.i","-S") [47] [2025-02-07 21:17:14,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-2.c[1937,1950] [2025-02-07 21:17:14,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:17:14,868 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:17:14,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14 WrapperNode [2025-02-07 21:17:14,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:17:14,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:17:14,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:17:14,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:17:14,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:14,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,105 INFO L138 Inliner]: procedures = 59, calls = 1914, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 4117 [2025-02-07 21:17:15,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:17:15,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:17:15,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:17:15,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:17:15,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,227 INFO L175 MemorySlicer]: Split 1439 memory accesses to 20 slices as follows [2, 2, 50, 5, 3, 264, 305, 156, 113, 79, 8, 57, 82, 105, 82, 2, 105, 8, 7, 4]. 21 percent of accesses are in the largest equivalence class. The 169 initializations are split as follows [2, 0, 0, 2, 1, 24, 24, 2, 2, 1, 0, 1, 27, 27, 27, 0, 27, 0, 2, 0]. The 203 writes are split as follows [0, 1, 26, 1, 1, 24, 24, 2, 2, 1, 4, 1, 28, 26, 28, 1, 26, 4, 3, 0]. [2025-02-07 21:17:15,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:17:15,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:17:15,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:17:15,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:17:15,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (1/1) ... [2025-02-07 21:17:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:17:15,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:17:15,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:17:15,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-07 21:17:15,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:17:15,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-07 21:17:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-07 21:17:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-07 21:17:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-07 21:17:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-07 21:17:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-07 21:17:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-07 21:17:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:17:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-07 21:17:15,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-07 21:17:15,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-07 21:17:15,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:17:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-07 21:17:15,513 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-07 21:17:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:17:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:17:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:17:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:17:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:17:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-07 21:17:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:17:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:17:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-07 21:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-07 21:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-07 21:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:17:15,931 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:17:15,933 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:17:16,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: assume 0 != OSEK_Task_ts1_~tmp___2~0#1 % 256;OSEK_Task_ts1_~cmd_forward~0#1 := -100;OSEK_Task_ts1_~cmd_turn~0#1 := 0; [2025-02-07 21:17:16,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: assume !(0 != OSEK_Task_ts1_~tmp___2~0#1 % 256); [2025-02-07 21:17:16,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L250: havoc ecrobot_sound_tone_~arg0#1, ecrobot_sound_tone_~arg1#1, ecrobot_sound_tone_~arg2#1;havoc ecrobot_sound_tone_#in~arg0#1, ecrobot_sound_tone_#in~arg1#1, ecrobot_sound_tone_#in~arg2#1;assume { :end_inline_ecrobot_sound_tone } true; [2025-02-07 21:17:16,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: assume { :begin_inline_ecrobot_bt_data_logger } true;ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1 := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#1;havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;ecrobot_bt_data_logger_~arg0#1 := ecrobot_bt_data_logger_#in~arg0#1;ecrobot_bt_data_logger_~arg1#1 := ecrobot_bt_data_logger_#in~arg1#1; [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271-1: SUMMARY for call nxt_motor_set_speed(1, OSEK_Task_ts1_#t~mem48#1, 1); srcloc: null [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L238: SUMMARY for call nxt_motor_set_count(1, 0); srcloc: null [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: OSEK_Task_ts1_#t~ret43#1 := ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;assume { :end_inline_ecrobot_get_battery_voltage } true;OSEK_Task_ts1_~tmp___3~0#1 := OSEK_Task_ts1_#t~ret43#1; [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume { :begin_inline_ecrobot_get_battery_voltage } true;havoc ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_~tmp~3#1 := ecrobot_get_battery_voltage_#t~nondet30#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_#res#1 := ecrobot_get_battery_voltage_~tmp~3#1; [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: __startrek_read_obstacle_flag_~c2~1#1 := (if 0 == __startrek_read_obstacle_flag_#t~ret1225#1 % 256 then 0 else 1);havoc __startrek_read_obstacle_flag_#t~ret1225#1; [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857-1: SUMMARY for call __startrek_read_obstacle_flag_#t~ret1225#1 := __startrek_cs_t0(); srcloc: null [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: havoc ecrobot_read_bt_packet_#t~nondet28#1, ecrobot_read_bt_packet_#t~nondet29#1, ecrobot_read_bt_packet_~bt_receive_buf#1.base, ecrobot_read_bt_packet_~bt_receive_buf#1.offset, ecrobot_read_bt_packet_~sz#1;havoc ecrobot_read_bt_packet_#in~bt_receive_buf#1.base, ecrobot_read_bt_packet_#in~bt_receive_buf#1.offset, ecrobot_read_bt_packet_#in~sz#1;assume { :end_inline_ecrobot_read_bt_packet } true;call OSEK_Task_ts1_#t~mem40#1 := read~int#18(~#bt_receive_buf~0.base, ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_forward~0#1 := (if -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 <= 127 then -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 else -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 - 256);call OSEK_Task_ts1_#t~mem41#1 := read~int#18(~#bt_receive_buf~0.base, 1 + ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_turn~0#1 := (if OSEK_Task_ts1_#t~mem41#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem41#1 % 256 % 256 else OSEK_Task_ts1_#t~mem41#1 % 256 % 256 - 256);assume { :begin_inline___startrek_read_obstacle_flag } true;havoc __startrek_read_obstacle_flag_#res#1;havoc __startrek_read_obstacle_flag_#t~switch1224#1, __startrek_read_obstacle_flag_#t~ret1225#1, __startrek_read_obstacle_flag_#t~ret1226#1, __startrek_read_obstacle_flag_#t~ret1227#1, __startrek_read_obstacle_flag_#t~mem1228#1, __startrek_read_obstacle_flag_~r1~1#1, __startrek_read_obstacle_flag_~c2~1#1, __startrek_read_obstacle_flag_~or3~1#1;havoc __startrek_read_obstacle_flag_~r1~1#1;havoc __startrek_read_obstacle_flag_~c2~1#1;havoc __startrek_read_obstacle_flag_~or3~1#1;__startrek_read_obstacle_flag_#t~switch1224#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: SUMMARY for call __startrek_write_nxtway_gs_mode(2); srcloc: null [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-02-07 21:17:16,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;havoc ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1;assume { :end_inline_ecrobot_bt_data_logger } true; [2025-02-07 21:17:16,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: ~cal_start_time~0 := OSEK_Task_ts1_#t~ret36#1; [2025-02-07 21:17:16,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L239-1: SUMMARY for call OSEK_Task_ts1_#t~ret36#1 := ecrobot_get_systick_ms(); srcloc: null [2025-02-07 21:17:16,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: __startrek_read_obstacle_flag_~c2~1#1 := (if 0 == __startrek_read_obstacle_flag_#t~ret1226#1 % 256 then 0 else 1);havoc __startrek_read_obstacle_flag_#t~ret1226#1; [2025-02-07 21:17:16,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866-1: SUMMARY for call __startrek_read_obstacle_flag_#t~ret1226#1 := __startrek_cs_t1(); srcloc: null [2025-02-07 21:17:16,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: assume -128 <= OSEK_Task_ts1_#t~ret44#1 && OSEK_Task_ts1_#t~ret44#1 <= 127;OSEK_Task_ts1_~tmp___4~0#1 := OSEK_Task_ts1_#t~ret44#1; [2025-02-07 21:17:16,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264-1: SUMMARY for call OSEK_Task_ts1_#t~ret44#1 := nxt_motor_get_count(1); srcloc: null [2025-02-07 21:17:16,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1854-1: assume __startrek_read_obstacle_flag_#t~switch1224#1;__startrek_read_obstacle_flag_~or3~1#1 := ~__startrek_round~0; [2025-02-07 21:17:16,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1854-1: assume !__startrek_read_obstacle_flag_#t~switch1224#1;__startrek_read_obstacle_flag_#t~switch1224#1 := __startrek_read_obstacle_flag_#t~switch1224#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:17:16,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;havoc balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;assume { :end_inline_balance_control } true;call OSEK_Task_ts1_#t~mem47#1 := read~int#15(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, 1); [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT((~K_I~0 * ~ud_err_theta~0 + balance_control_~tmp_pwm_r_limiter~0#1) % 4294967296 / ((~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296)), 100.0));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_turn#1), 100.0), ~convertUINTToFLOAT(~K_PHIDOT~0)));balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet20#1;assume -2147483648 <= balance_control_#t~nondet20#1 && balance_control_#t~nondet20#1 <= 2147483647;balance_control_~tmp___0~0#1 := balance_control_#t~nondet20#1;havoc balance_control_#t~nondet20#1;balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp___0~0#1;call write~int#15((if balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, 1);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 - balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet21#1;assume -2147483648 <= balance_control_#t~nondet21#1 && balance_control_#t~nondet21#1 <= 2147483647;balance_control_~tmp___1~0#1 := balance_control_#t~nondet21#1;havoc balance_control_#t~nondet21#1;balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp___1~0#1;call write~int#1((if balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, 1);balance_control_~tmp_pwm_l_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_thetadot_cmd_lpf~0#1)), ~convertUINTToFLOAT(~ud_theta_ref~0)));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_psidot~0#1)), ~convertUINTToFLOAT(~ud_psi~0)));balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(~ud_theta_ref~0 - balance_control_~tmp_theta~0#1), 0.00400000019), ~convertUINTToFLOAT(~ud_err_theta~0)));~ud_err_theta~0 := balance_control_~tmp_pwm_r_limiter~0#1;~ud_theta_ref~0 := balance_control_~tmp_pwm_l_limiter~0#1;~ud_thetadot_cmd_lpf~0 := balance_control_~tmp_thetadot_cmd_lpf~0#1;~ud_psi~0 := balance_control_~tmp_pwm_turn~0#1;~ud_theta_lpf~0 := balance_control_~tmp_theta_lpf~0#1;call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116-1: SUMMARY for call assume_abort_if_not((if 0 != (~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296 then 1 else 0)); srcloc: null [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1875: __startrek_read_obstacle_flag_~c2~1#1 := (if 0 == __startrek_read_obstacle_flag_#t~ret1227#1 % 256 then 0 else 1);havoc __startrek_read_obstacle_flag_#t~ret1227#1; [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1875-1: SUMMARY for call __startrek_read_obstacle_flag_#t~ret1227#1 := __startrek_cs_t2(); srcloc: null [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: SUMMARY for call __startrek_write_nxtway_gs_mode(1); srcloc: null [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L236: assume { :end_inline_balance_init } true; [2025-02-07 21:17:16,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume -128 <= OSEK_Task_ts1_#t~ret45#1 && OSEK_Task_ts1_#t~ret45#1 <= 127;OSEK_Task_ts1_~tmp___5~0#1 := OSEK_Task_ts1_#t~ret45#1; [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265-1: SUMMARY for call OSEK_Task_ts1_#t~ret45#1 := nxt_motor_get_count(0); srcloc: null [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-1: assume __startrek_read_obstacle_flag_#t~switch1224#1;__startrek_read_obstacle_flag_~or3~1#1 := ~__startrek_round~0; [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-1: assume !__startrek_read_obstacle_flag_#t~switch1224#1;__startrek_read_obstacle_flag_#t~switch1224#1 := __startrek_read_obstacle_flag_#t~switch1224#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-1: assume __startrek_read_obstacle_flag_#t~switch1224#1;__startrek_read_obstacle_flag_~or3~1#1 := ~__startrek_round~0; [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-1: assume !__startrek_read_obstacle_flag_#t~switch1224#1;havoc __startrek_read_obstacle_flag_#t~switch1224#1;havoc __startrek_read_obstacle_flag_#t~switch1224#1;call __startrek_read_obstacle_flag_#t~mem1228#1 := read~int#14(~#_obstacle_flag_~0.base, ~#_obstacle_flag_~0.offset + (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296), 1);__startrek_read_obstacle_flag_~r1~1#1 := (if 0 == __startrek_read_obstacle_flag_#t~mem1228#1 % 256 then 0 else 1);havoc __startrek_read_obstacle_flag_#t~mem1228#1;__startrek_read_obstacle_flag_#res#1 := (if 0 == __startrek_read_obstacle_flag_~r1~1#1 % 256 then 0 else 1); [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L270: call OSEK_Task_ts1_#t~mem48#1 := read~int#1(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset, 1); [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L270-1: SUMMARY for call nxt_motor_set_speed(0, OSEK_Task_ts1_#t~mem47#1, 1); srcloc: null [2025-02-07 21:17:16,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L237: SUMMARY for call nxt_motor_set_count(0, 0); srcloc: null [2025-02-07 21:17:16,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: OSEK_Task_ts1_~tmp___6~0#1 := OSEK_Task_ts1_#t~ret46#1;assume { :begin_inline_balance_control } true;balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#1, OSEK_Task_ts1_~tmp___6~0#1, ~gyro_offset~0, OSEK_Task_ts1_~tmp___5~0#1, OSEK_Task_ts1_~tmp___4~0#1, OSEK_Task_ts1_~tmp___3~0#1, OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;balance_control_~args_cmd_forward#1 := balance_control_#in~args_cmd_forward#1;balance_control_~args_cmd_turn#1 := balance_control_#in~args_cmd_turn#1;balance_control_~args_gyro#1 := balance_control_#in~args_gyro#1;balance_control_~args_gyro_offset#1 := balance_control_#in~args_gyro_offset#1;balance_control_~args_theta_m_l#1 := balance_control_#in~args_theta_m_l#1;balance_control_~args_theta_m_r#1 := balance_control_#in~args_theta_m_r#1;balance_control_~args_battery#1 := balance_control_#in~args_battery#1;balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset := balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset;balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset := balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;havoc balance_control_~tmp_theta~0#1;havoc balance_control_~tmp_theta_lpf~0#1;havoc balance_control_~tmp_pwm_r_limiter~0#1;havoc balance_control_~tmp_psidot~0#1;havoc balance_control_~tmp_pwm_turn~0#1;havoc balance_control_~tmp_pwm_l_limiter~0#1;havoc balance_control_~tmp_thetadot_cmd_lpf~0#1;call balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset := #Ultimate.allocOnStack(16);call balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset := #Ultimate.allocOnStack(16);havoc balance_control_~tmp_0~0#1;havoc balance_control_~tmp___0~0#1;havoc balance_control_~tmp___1~0#1;balance_control_~tmp_thetadot_cmd_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_forward#1), 100.0), ~convertUINTToFLOAT(~K_THETADOT~0)), ~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_R~0))), ~convertUINTToFLOAT(~A_R~0 * ~ud_thetadot_cmd_lpf~0)));balance_control_~tmp_theta~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_l#1)), ~convertUINTToFLOAT(~ud_psi~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_r#1)), ~convertUINTToFLOAT(~ud_psi~0))), 0.5));balance_control_~tmp_theta_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_D~0)), ~convertUINTToFLOAT(balance_control_~tmp_theta~0#1)), ~convertUINTToFLOAT(~A_D~0 * ~ud_theta_lpf~0)));balance_control_~tmp_psidot~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_gyro#1 - balance_control_~args_gyro_offset#1), 0.01745329238));call write~int#17(~ud_theta_ref~0, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, 4);call write~int#17(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 4 + balance_control_~#tmp~0#1.offset, 4);call write~int#17(balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, 8 + balance_control_~#tmp~0#1.offset, 4);call write~int#17(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 12 + balance_control_~#tmp~0#1.offset, 4);call write~int#10(balance_control_~tmp_theta~0#1, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#10(~ud_psi~0, balance_control_~#tmp_theta_0~0#1.base, 4 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#10(~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~tmp_theta_lpf~0#1 - ~ud_theta_lpf~0), 0.00400000019)), balance_control_~#tmp_theta_0~0#1.base, 8 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#10(balance_control_~tmp_psidot~0#1, balance_control_~#tmp_theta_0~0#1.base, 12 + balance_control_~#tmp_theta_0~0#1.offset, 4);balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(0.0);balance_control_~tmp_0~0#1 := 0;call balance_control_#t~mem4#1 := read~int#17(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem5#1 := read~int#10(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem6#1 := read~int#19(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem4#1 - balance_control_#t~mem5#1) * balance_control_#t~mem6#1;havoc balance_control_#t~mem4#1;havoc balance_control_#t~mem5#1;havoc balance_control_#t~mem6#1;balance_control_#t~post7#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post7#1;havoc balance_control_#t~post7#1;call balance_control_#t~mem8#1 := read~int#17(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem9#1 := read~int#10(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem10#1 := read~int#19(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem8#1 - balance_control_#t~mem9#1) * balance_control_#t~mem10#1;havoc balance_control_#t~mem8#1;havoc balance_control_#t~mem9#1;havoc balance_control_#t~mem10#1;balance_control_#t~post11#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post11#1;havoc balance_control_#t~post11#1;call balance_control_#t~mem12#1 := read~int#17(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem13#1 := read~int#10(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem14#1 := read~int#19(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem12#1 - balance_control_#t~mem13#1) * balance_control_#t~mem14#1;havoc balance_control_#t~mem12#1;havoc balance_control_#t~mem13#1;havoc balance_control_#t~mem14#1;balance_control_#t~post15#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post15#1;havoc balance_control_#t~post15#1;call balance_control_#t~mem16#1 := read~int#17(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem17#1 := read~int#10(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem18#1 := read~int#19(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem16#1 - balance_control_#t~mem17#1) * balance_control_#t~mem18#1;havoc balance_control_#t~mem16#1;havoc balance_control_#t~mem17#1;havoc balance_control_#t~mem18#1;balance_control_#t~post19#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post19#1;havoc balance_control_#t~post19#1; [2025-02-07 21:17:16,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266-1: SUMMARY for call OSEK_Task_ts1_#t~ret46#1 := ecrobot_get_gyro_sensor(3); srcloc: null [2025-02-07 21:17:16,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: OSEK_Task_ts1_#t~ret42#1 := __startrek_read_obstacle_flag_#res#1;havoc __startrek_read_obstacle_flag_#t~switch1224#1, __startrek_read_obstacle_flag_#t~ret1225#1, __startrek_read_obstacle_flag_#t~ret1226#1, __startrek_read_obstacle_flag_#t~ret1227#1, __startrek_read_obstacle_flag_#t~mem1228#1, __startrek_read_obstacle_flag_~r1~1#1, __startrek_read_obstacle_flag_~c2~1#1, __startrek_read_obstacle_flag_~or3~1#1;assume { :end_inline___startrek_read_obstacle_flag } true;OSEK_Task_ts1_~tmp___2~0#1 := (if 0 == OSEK_Task_ts1_#t~ret42#1 % 256 then 0 else 1); [2025-02-07 21:17:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: SUMMARY for call __startrek_write_obstacle_flag(1); srcloc: null [2025-02-07 21:17:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: assume (if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25; [2025-02-07 21:17:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: assume !((if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25); [2025-02-07 21:17:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: OSEK_Task_ts2_#t~ret51#1 := ecrobot_get_sonar_sensor_#res#1;havoc ecrobot_get_sonar_sensor_#t~nondet49#1, ecrobot_get_sonar_sensor_~port#1, ecrobot_get_sonar_sensor_~tmp~5#1;havoc ecrobot_get_sonar_sensor_#in~port#1;assume { :end_inline_ecrobot_get_sonar_sensor } true;OSEK_Task_ts2_~tmp___0~2#1 := OSEK_Task_ts2_#t~ret51#1;havoc OSEK_Task_ts2_#t~ret51#1; [2025-02-07 21:17:21,097 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-07 21:17:21,098 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:17:21,146 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:17:21,150 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:17:21,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:17:21 BoogieIcfgContainer [2025-02-07 21:17:21,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:17:21,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:17:21,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:17:21,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:17:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:17:14" (1/3) ... [2025-02-07 21:17:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7058b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:17:21, skipping insertion in model container [2025-02-07 21:17:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:14" (2/3) ... [2025-02-07 21:17:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7058b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:17:21, skipping insertion in model container [2025-02-07 21:17:21,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:17:21" (3/3) ... [2025-02-07 21:17:21,191 INFO L128 eAbstractionObserver]: Analyzing ICFG rekcba_nxt.2.M1-2.c [2025-02-07 21:17:21,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:17:21,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekcba_nxt.2.M1-2.c that has 17 procedures, 1155 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 21:17:21,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:17:21,326 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;@59ab5ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:17:21,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:17:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 1140 states, 714 states have (on average 1.2913165266106443) internal successors, (922), 750 states have internal predecessors, (922), 401 states have call successors, (401), 13 states have call predecessors, (401), 13 states have return successors, (401), 401 states have call predecessors, (401), 401 states have call successors, (401) [2025-02-07 21:17:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2025-02-07 21:17:21,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:21,382 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:21,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:21,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 133619190, now seen corresponding path program 1 times [2025-02-07 21:17:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518473372] [2025-02-07 21:17:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:21,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 717 statements into 1 equivalence classes. [2025-02-07 21:17:22,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 717 of 717 statements. [2025-02-07 21:17:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:22,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-02-07 21:17:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518473372] [2025-02-07 21:17:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518473372] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:17:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720296635] [2025-02-07 21:17:22,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:17:22,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:17:22,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:17:22,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:17:23,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 717 statements into 1 equivalence classes. [2025-02-07 21:17:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 717 of 717 statements. [2025-02-07 21:17:24,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:24,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:24,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 2632 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:17:24,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:17:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-02-07 21:17:24,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:17:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720296635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:17:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 21:17:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269941490] [2025-02-07 21:17:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:24,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:17:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:24,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:17:24,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:17:24,257 INFO L87 Difference]: Start difference. First operand has 1140 states, 714 states have (on average 1.2913165266106443) internal successors, (922), 750 states have internal predecessors, (922), 401 states have call successors, (401), 13 states have call predecessors, (401), 13 states have return successors, (401), 401 states have call predecessors, (401), 401 states have call successors, (401) Second operand has 2 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-02-07 21:17:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:24,453 INFO L93 Difference]: Finished difference Result 2270 states and 3803 transitions. [2025-02-07 21:17:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:17:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) Word has length 717 [2025-02-07 21:17:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:24,478 INFO L225 Difference]: With dead ends: 2270 [2025-02-07 21:17:24,479 INFO L226 Difference]: Without dead ends: 1054 [2025-02-07 21:17:24,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:17:24,495 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:24,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:17:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-02-07 21:17:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2025-02-07 21:17:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 662 states have (on average 1.2658610271903323) internal successors, (838), 690 states have internal predecessors, (838), 384 states have call successors, (384), 7 states have call predecessors, (384), 7 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1605 transitions. [2025-02-07 21:17:24,734 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1605 transitions. Word has length 717 [2025-02-07 21:17:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:24,734 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1605 transitions. [2025-02-07 21:17:24,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-02-07 21:17:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1605 transitions. [2025-02-07 21:17:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2025-02-07 21:17:24,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:24,759 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:24,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:17:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 21:17:24,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1473158591, now seen corresponding path program 1 times [2025-02-07 21:17:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244549397] [2025-02-07 21:17:24,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:25,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 717 statements into 1 equivalence classes. [2025-02-07 21:17:26,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 717 of 717 statements. [2025-02-07 21:17:26,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-02-07 21:17:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:29,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244549397] [2025-02-07 21:17:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244549397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237919348] [2025-02-07 21:17:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:29,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:29,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:29,975 INFO L87 Difference]: Start difference. First operand 1054 states and 1605 transitions. Second operand has 6 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-02-07 21:17:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:30,329 INFO L93 Difference]: Finished difference Result 1060 states and 1610 transitions. [2025-02-07 21:17:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:30,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 717 [2025-02-07 21:17:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:30,345 INFO L225 Difference]: With dead ends: 1060 [2025-02-07 21:17:30,345 INFO L226 Difference]: Without dead ends: 1058 [2025-02-07 21:17:30,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:30,351 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1237 mSDsluCounter, 4707 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 6285 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:30,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 6285 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:17:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-02-07 21:17:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-02-07 21:17:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 665 states have (on average 1.2646616541353384) internal successors, (841), 693 states have internal predecessors, (841), 384 states have call successors, (384), 8 states have call predecessors, (384), 8 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1608 transitions. [2025-02-07 21:17:30,482 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1608 transitions. Word has length 717 [2025-02-07 21:17:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:30,486 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1608 transitions. [2025-02-07 21:17:30,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-02-07 21:17:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1608 transitions. [2025-02-07 21:17:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-02-07 21:17:30,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:30,522 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:30,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:17:30,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 993870357, now seen corresponding path program 1 times [2025-02-07 21:17:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753725864] [2025-02-07 21:17:30,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:30,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-02-07 21:17:31,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-02-07 21:17:31,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:31,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14282 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-02-07 21:17:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753725864] [2025-02-07 21:17:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753725864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:33,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:33,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664807317] [2025-02-07 21:17:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:33,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:33,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:33,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:33,909 INFO L87 Difference]: Start difference. First operand 1058 states and 1608 transitions. Second operand has 6 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-02-07 21:17:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:34,233 INFO L93 Difference]: Finished difference Result 1064 states and 1613 transitions. [2025-02-07 21:17:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 723 [2025-02-07 21:17:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:34,245 INFO L225 Difference]: With dead ends: 1064 [2025-02-07 21:17:34,245 INFO L226 Difference]: Without dead ends: 1062 [2025-02-07 21:17:34,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:34,249 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1232 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:34,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:17:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-02-07 21:17:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-02-07 21:17:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 668 states have (on average 1.2634730538922156) internal successors, (844), 696 states have internal predecessors, (844), 384 states have call successors, (384), 9 states have call predecessors, (384), 9 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1611 transitions. [2025-02-07 21:17:34,387 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1611 transitions. Word has length 723 [2025-02-07 21:17:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:34,389 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1611 transitions. [2025-02-07 21:17:34,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-02-07 21:17:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1611 transitions. [2025-02-07 21:17:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-02-07 21:17:34,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:34,401 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:34,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:17:34,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:34,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1925720555, now seen corresponding path program 1 times [2025-02-07 21:17:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522345736] [2025-02-07 21:17:34,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:34,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-02-07 21:17:34,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-02-07 21:17:34,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:34,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14288 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14284 trivial. 0 not checked. [2025-02-07 21:17:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522345736] [2025-02-07 21:17:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522345736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756225605] [2025-02-07 21:17:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:37,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:37,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:37,079 INFO L87 Difference]: Start difference. First operand 1062 states and 1611 transitions. Second operand has 6 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (88), 2 states have call predecessors, (88), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-02-07 21:17:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:37,380 INFO L93 Difference]: Finished difference Result 1068 states and 1616 transitions. [2025-02-07 21:17:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (88), 2 states have call predecessors, (88), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 729 [2025-02-07 21:17:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:37,395 INFO L225 Difference]: With dead ends: 1068 [2025-02-07 21:17:37,395 INFO L226 Difference]: Without dead ends: 1066 [2025-02-07 21:17:37,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:37,398 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1230 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:37,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-02-07 21:17:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2025-02-07 21:17:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 671 states have (on average 1.2622950819672132) internal successors, (847), 699 states have internal predecessors, (847), 384 states have call successors, (384), 10 states have call predecessors, (384), 10 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1614 transitions. [2025-02-07 21:17:37,528 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1614 transitions. Word has length 729 [2025-02-07 21:17:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:37,533 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1614 transitions. [2025-02-07 21:17:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (88), 2 states have call predecessors, (88), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-02-07 21:17:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1614 transitions. [2025-02-07 21:17:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-02-07 21:17:37,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:37,545 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:37,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:17:37,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1329107011, now seen corresponding path program 1 times [2025-02-07 21:17:37,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:37,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770554142] [2025-02-07 21:17:37,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-02-07 21:17:38,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-02-07 21:17:38,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:38,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14298 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14292 trivial. 0 not checked. [2025-02-07 21:17:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770554142] [2025-02-07 21:17:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770554142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:40,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:40,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971922880] [2025-02-07 21:17:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:40,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:40,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:40,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:40,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:40,402 INFO L87 Difference]: Start difference. First operand 1066 states and 1614 transitions. Second operand has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (88), 1 states have call predecessors, (88), 1 states have call successors, (88) [2025-02-07 21:17:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:40,753 INFO L93 Difference]: Finished difference Result 1072 states and 1619 transitions. [2025-02-07 21:17:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (88), 1 states have call predecessors, (88), 1 states have call successors, (88) Word has length 735 [2025-02-07 21:17:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:40,764 INFO L225 Difference]: With dead ends: 1072 [2025-02-07 21:17:40,766 INFO L226 Difference]: Without dead ends: 1070 [2025-02-07 21:17:40,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:40,769 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1228 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:40,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:17:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-02-07 21:17:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-02-07 21:17:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 674 states have (on average 1.261127596439169) internal successors, (850), 702 states have internal predecessors, (850), 384 states have call successors, (384), 11 states have call predecessors, (384), 11 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1617 transitions. [2025-02-07 21:17:40,894 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1617 transitions. Word has length 735 [2025-02-07 21:17:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:40,898 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1617 transitions. [2025-02-07 21:17:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (88), 1 states have call predecessors, (88), 1 states have call successors, (88) [2025-02-07 21:17:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1617 transitions. [2025-02-07 21:17:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2025-02-07 21:17:40,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:40,909 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:40,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:17:40,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:40,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -18740323, now seen corresponding path program 1 times [2025-02-07 21:17:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:40,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789109971] [2025-02-07 21:17:40,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:40,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-02-07 21:17:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-02-07 21:17:41,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:41,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14312 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14304 trivial. 0 not checked. [2025-02-07 21:17:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789109971] [2025-02-07 21:17:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789109971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:43,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158295615] [2025-02-07 21:17:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:43,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:43,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:43,281 INFO L87 Difference]: Start difference. First operand 1070 states and 1617 transitions. Second operand has 6 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-07 21:17:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:43,570 INFO L93 Difference]: Finished difference Result 1076 states and 1622 transitions. [2025-02-07 21:17:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:43,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 741 [2025-02-07 21:17:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:43,581 INFO L225 Difference]: With dead ends: 1076 [2025-02-07 21:17:43,582 INFO L226 Difference]: Without dead ends: 1074 [2025-02-07 21:17:43,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:43,583 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1226 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:43,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-02-07 21:17:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2025-02-07 21:17:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 677 states have (on average 1.259970457902511) internal successors, (853), 705 states have internal predecessors, (853), 384 states have call successors, (384), 12 states have call predecessors, (384), 12 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1620 transitions. [2025-02-07 21:17:43,729 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1620 transitions. Word has length 741 [2025-02-07 21:17:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:43,731 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1620 transitions. [2025-02-07 21:17:43,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-07 21:17:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1620 transitions. [2025-02-07 21:17:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-02-07 21:17:43,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:43,742 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:43,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:17:43,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1079160199, now seen corresponding path program 1 times [2025-02-07 21:17:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778952447] [2025-02-07 21:17:43,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-02-07 21:17:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-02-07 21:17:44,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14330 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14320 trivial. 0 not checked. [2025-02-07 21:17:46,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778952447] [2025-02-07 21:17:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778952447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163782703] [2025-02-07 21:17:46,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:46,121 INFO L87 Difference]: Start difference. First operand 1074 states and 1620 transitions. Second operand has 6 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-07 21:17:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:46,383 INFO L93 Difference]: Finished difference Result 1080 states and 1625 transitions. [2025-02-07 21:17:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 747 [2025-02-07 21:17:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:46,394 INFO L225 Difference]: With dead ends: 1080 [2025-02-07 21:17:46,394 INFO L226 Difference]: Without dead ends: 1078 [2025-02-07 21:17:46,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:46,396 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1224 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-02-07 21:17:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2025-02-07 21:17:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 680 states have (on average 1.2588235294117647) internal successors, (856), 708 states have internal predecessors, (856), 384 states have call successors, (384), 13 states have call predecessors, (384), 13 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1623 transitions. [2025-02-07 21:17:46,527 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1623 transitions. Word has length 747 [2025-02-07 21:17:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1623 transitions. [2025-02-07 21:17:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-07 21:17:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1623 transitions. [2025-02-07 21:17:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-02-07 21:17:46,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:46,539 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:46,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:17:46,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash -490718377, now seen corresponding path program 1 times [2025-02-07 21:17:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139592568] [2025-02-07 21:17:46,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:46,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-02-07 21:17:46,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-02-07 21:17:46,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:46,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14352 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14340 trivial. 0 not checked. [2025-02-07 21:17:48,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139592568] [2025-02-07 21:17:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139592568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467380071] [2025-02-07 21:17:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:48,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:48,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:48,692 INFO L87 Difference]: Start difference. First operand 1078 states and 1623 transitions. Second operand has 6 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-07 21:17:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:48,938 INFO L93 Difference]: Finished difference Result 1084 states and 1628 transitions. [2025-02-07 21:17:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 753 [2025-02-07 21:17:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:48,948 INFO L225 Difference]: With dead ends: 1084 [2025-02-07 21:17:48,948 INFO L226 Difference]: Without dead ends: 1082 [2025-02-07 21:17:48,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:48,949 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1222 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:48,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-02-07 21:17:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2025-02-07 21:17:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 683 states have (on average 1.2576866764275256) internal successors, (859), 711 states have internal predecessors, (859), 384 states have call successors, (384), 14 states have call predecessors, (384), 14 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1626 transitions. [2025-02-07 21:17:49,075 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1626 transitions. Word has length 753 [2025-02-07 21:17:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1626 transitions. [2025-02-07 21:17:49,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-07 21:17:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1626 transitions. [2025-02-07 21:17:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-02-07 21:17:49,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:49,094 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:17:49,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1915075767, now seen corresponding path program 1 times [2025-02-07 21:17:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271515857] [2025-02-07 21:17:49,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:49,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-02-07 21:17:49,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-02-07 21:17:49,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:49,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14378 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14364 trivial. 0 not checked. [2025-02-07 21:17:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271515857] [2025-02-07 21:17:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271515857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046362499] [2025-02-07 21:17:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:51,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:51,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:51,157 INFO L87 Difference]: Start difference. First operand 1082 states and 1626 transitions. Second operand has 6 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-07 21:17:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:51,412 INFO L93 Difference]: Finished difference Result 1088 states and 1631 transitions. [2025-02-07 21:17:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 759 [2025-02-07 21:17:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:51,422 INFO L225 Difference]: With dead ends: 1088 [2025-02-07 21:17:51,422 INFO L226 Difference]: Without dead ends: 1086 [2025-02-07 21:17:51,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:51,423 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1220 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:51,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-02-07 21:17:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2025-02-07 21:17:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 686 states have (on average 1.2565597667638484) internal successors, (862), 714 states have internal predecessors, (862), 384 states have call successors, (384), 15 states have call predecessors, (384), 15 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1629 transitions. [2025-02-07 21:17:51,568 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1629 transitions. Word has length 759 [2025-02-07 21:17:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1629 transitions. [2025-02-07 21:17:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-07 21:17:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1629 transitions. [2025-02-07 21:17:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-02-07 21:17:51,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:51,582 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:17:51,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -126489319, now seen corresponding path program 1 times [2025-02-07 21:17:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18641204] [2025-02-07 21:17:51,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-02-07 21:17:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-02-07 21:17:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14408 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14392 trivial. 0 not checked. [2025-02-07 21:17:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18641204] [2025-02-07 21:17:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18641204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250831265] [2025-02-07 21:17:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:53,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:53,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:53,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:53,562 INFO L87 Difference]: Start difference. First operand 1086 states and 1629 transitions. Second operand has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-02-07 21:17:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:53,829 INFO L93 Difference]: Finished difference Result 1092 states and 1634 transitions. [2025-02-07 21:17:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 765 [2025-02-07 21:17:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:53,844 INFO L225 Difference]: With dead ends: 1092 [2025-02-07 21:17:53,844 INFO L226 Difference]: Without dead ends: 1090 [2025-02-07 21:17:53,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:53,845 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1218 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:53,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-02-07 21:17:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2025-02-07 21:17:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 689 states have (on average 1.25544267053701) internal successors, (865), 717 states have internal predecessors, (865), 384 states have call successors, (384), 16 states have call predecessors, (384), 16 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1632 transitions. [2025-02-07 21:17:53,984 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1632 transitions. Word has length 765 [2025-02-07 21:17:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1632 transitions. [2025-02-07 21:17:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-02-07 21:17:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1632 transitions. [2025-02-07 21:17:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2025-02-07 21:17:53,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:53,995 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:53,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:17:53,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -360840451, now seen corresponding path program 1 times [2025-02-07 21:17:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870906057] [2025-02-07 21:17:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:54,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-02-07 21:17:54,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-02-07 21:17:54,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:54,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14442 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14424 trivial. 0 not checked. [2025-02-07 21:17:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:56,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870906057] [2025-02-07 21:17:56,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870906057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:56,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107131306] [2025-02-07 21:17:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:56,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:56,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:56,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:56,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:56,232 INFO L87 Difference]: Start difference. First operand 1090 states and 1632 transitions. Second operand has 6 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-02-07 21:17:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:56,488 INFO L93 Difference]: Finished difference Result 1096 states and 1637 transitions. [2025-02-07 21:17:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 771 [2025-02-07 21:17:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:56,497 INFO L225 Difference]: With dead ends: 1096 [2025-02-07 21:17:56,497 INFO L226 Difference]: Without dead ends: 1094 [2025-02-07 21:17:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:56,499 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1216 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:56,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-02-07 21:17:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2025-02-07 21:17:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 692 states have (on average 1.254335260115607) internal successors, (868), 720 states have internal predecessors, (868), 384 states have call successors, (384), 17 states have call predecessors, (384), 17 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1635 transitions. [2025-02-07 21:17:56,684 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1635 transitions. Word has length 771 [2025-02-07 21:17:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:56,685 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1635 transitions. [2025-02-07 21:17:56,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-02-07 21:17:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1635 transitions. [2025-02-07 21:17:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-02-07 21:17:56,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:56,701 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:56,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:17:56,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash 854086883, now seen corresponding path program 1 times [2025-02-07 21:17:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:56,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909102427] [2025-02-07 21:17:56,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-02-07 21:17:57,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-02-07 21:17:57,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:57,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14480 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14460 trivial. 0 not checked. [2025-02-07 21:17:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909102427] [2025-02-07 21:17:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909102427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864989155] [2025-02-07 21:17:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:58,862 INFO L87 Difference]: Start difference. First operand 1094 states and 1635 transitions. Second operand has 6 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-02-07 21:17:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:59,121 INFO L93 Difference]: Finished difference Result 1100 states and 1640 transitions. [2025-02-07 21:17:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 777 [2025-02-07 21:17:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:59,130 INFO L225 Difference]: With dead ends: 1100 [2025-02-07 21:17:59,131 INFO L226 Difference]: Without dead ends: 1098 [2025-02-07 21:17:59,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:17:59,133 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1214 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:17:59,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-02-07 21:17:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2025-02-07 21:17:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 695 states have (on average 1.2532374100719423) internal successors, (871), 723 states have internal predecessors, (871), 384 states have call successors, (384), 18 states have call predecessors, (384), 18 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:17:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1638 transitions. [2025-02-07 21:17:59,283 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1638 transitions. Word has length 777 [2025-02-07 21:17:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1638 transitions. [2025-02-07 21:17:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-02-07 21:17:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1638 transitions. [2025-02-07 21:17:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2025-02-07 21:17:59,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:59,294 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:17:59,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:17:59,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1608800587, now seen corresponding path program 1 times [2025-02-07 21:17:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936326657] [2025-02-07 21:17:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:59,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-02-07 21:17:59,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-02-07 21:17:59,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14522 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14500 trivial. 0 not checked. [2025-02-07 21:18:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936326657] [2025-02-07 21:18:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936326657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420648758] [2025-02-07 21:18:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:01,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:01,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:01,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:01,297 INFO L87 Difference]: Start difference. First operand 1098 states and 1638 transitions. Second operand has 6 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-07 21:18:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:01,554 INFO L93 Difference]: Finished difference Result 1104 states and 1643 transitions. [2025-02-07 21:18:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 783 [2025-02-07 21:18:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:01,563 INFO L225 Difference]: With dead ends: 1104 [2025-02-07 21:18:01,563 INFO L226 Difference]: Without dead ends: 1102 [2025-02-07 21:18:01,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:01,565 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1212 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:01,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-02-07 21:18:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-02-07 21:18:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 698 states have (on average 1.2521489971346704) internal successors, (874), 726 states have internal predecessors, (874), 384 states have call successors, (384), 19 states have call predecessors, (384), 19 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1641 transitions. [2025-02-07 21:18:01,717 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1641 transitions. Word has length 783 [2025-02-07 21:18:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1641 transitions. [2025-02-07 21:18:01,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-07 21:18:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1641 transitions. [2025-02-07 21:18:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-02-07 21:18:01,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:01,727 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:18:01,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:01,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -221337931, now seen corresponding path program 1 times [2025-02-07 21:18:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473121627] [2025-02-07 21:18:01,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:01,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-02-07 21:18:02,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-02-07 21:18:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14568 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14544 trivial. 0 not checked. [2025-02-07 21:18:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473121627] [2025-02-07 21:18:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473121627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672467894] [2025-02-07 21:18:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:03,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:03,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:03,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:03,823 INFO L87 Difference]: Start difference. First operand 1102 states and 1641 transitions. Second operand has 6 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-07 21:18:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:04,109 INFO L93 Difference]: Finished difference Result 1108 states and 1646 transitions. [2025-02-07 21:18:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 789 [2025-02-07 21:18:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:04,119 INFO L225 Difference]: With dead ends: 1108 [2025-02-07 21:18:04,119 INFO L226 Difference]: Without dead ends: 1106 [2025-02-07 21:18:04,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:04,120 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1210 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:04,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-07 21:18:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-02-07 21:18:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 701 states have (on average 1.2510699001426533) internal successors, (877), 729 states have internal predecessors, (877), 384 states have call successors, (384), 20 states have call predecessors, (384), 20 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1644 transitions. [2025-02-07 21:18:04,309 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1644 transitions. Word has length 789 [2025-02-07 21:18:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:04,310 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1644 transitions. [2025-02-07 21:18:04,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-07 21:18:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1644 transitions. [2025-02-07 21:18:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-02-07 21:18:04,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:04,319 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:04,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:18:04,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1373172641, now seen corresponding path program 1 times [2025-02-07 21:18:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675780778] [2025-02-07 21:18:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-02-07 21:18:04,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-02-07 21:18:04,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:04,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14618 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14592 trivial. 0 not checked. [2025-02-07 21:18:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675780778] [2025-02-07 21:18:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675780778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492574012] [2025-02-07 21:18:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:06,450 INFO L87 Difference]: Start difference. First operand 1106 states and 1644 transitions. Second operand has 6 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-07 21:18:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:06,720 INFO L93 Difference]: Finished difference Result 1112 states and 1649 transitions. [2025-02-07 21:18:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 795 [2025-02-07 21:18:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:06,728 INFO L225 Difference]: With dead ends: 1112 [2025-02-07 21:18:06,728 INFO L226 Difference]: Without dead ends: 1110 [2025-02-07 21:18:06,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:06,730 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1208 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:06,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-07 21:18:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-02-07 21:18:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 704 states have (on average 1.25) internal successors, (880), 732 states have internal predecessors, (880), 384 states have call successors, (384), 21 states have call predecessors, (384), 21 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1647 transitions. [2025-02-07 21:18:06,887 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1647 transitions. Word has length 795 [2025-02-07 21:18:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:06,891 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1647 transitions. [2025-02-07 21:18:06,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-02-07 21:18:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1647 transitions. [2025-02-07 21:18:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2025-02-07 21:18:06,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:06,901 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:06,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:18:06,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash -609085809, now seen corresponding path program 1 times [2025-02-07 21:18:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919897779] [2025-02-07 21:18:06,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:07,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-02-07 21:18:07,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-02-07 21:18:07,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:07,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14672 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14644 trivial. 0 not checked. [2025-02-07 21:18:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919897779] [2025-02-07 21:18:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919897779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403987961] [2025-02-07 21:18:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:09,288 INFO L87 Difference]: Start difference. First operand 1110 states and 1647 transitions. Second operand has 6 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-07 21:18:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:09,580 INFO L93 Difference]: Finished difference Result 1116 states and 1652 transitions. [2025-02-07 21:18:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 801 [2025-02-07 21:18:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:09,591 INFO L225 Difference]: With dead ends: 1116 [2025-02-07 21:18:09,591 INFO L226 Difference]: Without dead ends: 1114 [2025-02-07 21:18:09,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:09,594 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1206 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:09,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-02-07 21:18:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2025-02-07 21:18:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 707 states have (on average 1.2489391796322489) internal successors, (883), 735 states have internal predecessors, (883), 384 states have call successors, (384), 22 states have call predecessors, (384), 22 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1650 transitions. [2025-02-07 21:18:09,770 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1650 transitions. Word has length 801 [2025-02-07 21:18:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:09,773 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1650 transitions. [2025-02-07 21:18:09,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-07 21:18:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1650 transitions. [2025-02-07 21:18:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-02-07 21:18:09,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:09,782 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:09,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:18:09,782 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:09,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1657928193, now seen corresponding path program 1 times [2025-02-07 21:18:09,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:09,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46657033] [2025-02-07 21:18:09,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-02-07 21:18:10,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-02-07 21:18:10,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:10,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14730 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14700 trivial. 0 not checked. [2025-02-07 21:18:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46657033] [2025-02-07 21:18:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46657033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035970436] [2025-02-07 21:18:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:11,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:11,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:11,942 INFO L87 Difference]: Start difference. First operand 1114 states and 1650 transitions. Second operand has 6 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-07 21:18:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:12,192 INFO L93 Difference]: Finished difference Result 1120 states and 1655 transitions. [2025-02-07 21:18:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 807 [2025-02-07 21:18:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:12,200 INFO L225 Difference]: With dead ends: 1120 [2025-02-07 21:18:12,200 INFO L226 Difference]: Without dead ends: 1118 [2025-02-07 21:18:12,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:12,202 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1204 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:12,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-07 21:18:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-02-07 21:18:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 710 states have (on average 1.2478873239436619) internal successors, (886), 738 states have internal predecessors, (886), 384 states have call successors, (384), 23 states have call predecessors, (384), 23 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1653 transitions. [2025-02-07 21:18:12,407 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1653 transitions. Word has length 807 [2025-02-07 21:18:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:12,408 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1653 transitions. [2025-02-07 21:18:12,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-07 21:18:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1653 transitions. [2025-02-07 21:18:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-02-07 21:18:12,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:12,417 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:12,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:18:12,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:12,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash 686676081, now seen corresponding path program 1 times [2025-02-07 21:18:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633208481] [2025-02-07 21:18:12,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:12,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-02-07 21:18:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-02-07 21:18:12,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:12,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14792 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 14760 trivial. 0 not checked. [2025-02-07 21:18:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633208481] [2025-02-07 21:18:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633208481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074345408] [2025-02-07 21:18:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:14,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:14,732 INFO L87 Difference]: Start difference. First operand 1118 states and 1653 transitions. Second operand has 6 states, 5 states have (on average 62.6) internal successors, (313), 5 states have internal predecessors, (313), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-07 21:18:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:14,979 INFO L93 Difference]: Finished difference Result 1124 states and 1658 transitions. [2025-02-07 21:18:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 62.6) internal successors, (313), 5 states have internal predecessors, (313), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 813 [2025-02-07 21:18:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:14,986 INFO L225 Difference]: With dead ends: 1124 [2025-02-07 21:18:14,987 INFO L226 Difference]: Without dead ends: 1122 [2025-02-07 21:18:14,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:14,988 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1202 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:14,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-02-07 21:18:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-02-07 21:18:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 713 states have (on average 1.246844319775596) internal successors, (889), 741 states have internal predecessors, (889), 384 states have call successors, (384), 24 states have call predecessors, (384), 24 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1656 transitions. [2025-02-07 21:18:15,166 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1656 transitions. Word has length 813 [2025-02-07 21:18:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:15,167 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1656 transitions. [2025-02-07 21:18:15,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 62.6) internal successors, (313), 5 states have internal predecessors, (313), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-07 21:18:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1656 transitions. [2025-02-07 21:18:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-02-07 21:18:15,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:15,176 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:18:15,176 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 285721701, now seen corresponding path program 1 times [2025-02-07 21:18:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912489308] [2025-02-07 21:18:15,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-02-07 21:18:15,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-02-07 21:18:15,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:15,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14858 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14824 trivial. 0 not checked. [2025-02-07 21:18:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912489308] [2025-02-07 21:18:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912489308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959520142] [2025-02-07 21:18:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:17,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:17,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:17,480 INFO L87 Difference]: Start difference. First operand 1122 states and 1656 transitions. Second operand has 6 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-02-07 21:18:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:17,692 INFO L93 Difference]: Finished difference Result 1128 states and 1661 transitions. [2025-02-07 21:18:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 819 [2025-02-07 21:18:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:17,699 INFO L225 Difference]: With dead ends: 1128 [2025-02-07 21:18:17,700 INFO L226 Difference]: Without dead ends: 1126 [2025-02-07 21:18:17,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:17,701 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1200 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:17,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 6292 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-02-07 21:18:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2025-02-07 21:18:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 716 states have (on average 1.2458100558659218) internal successors, (892), 744 states have internal predecessors, (892), 384 states have call successors, (384), 25 states have call predecessors, (384), 25 states have return successors, (383), 383 states have call predecessors, (383), 383 states have call successors, (383) [2025-02-07 21:18:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1659 transitions. [2025-02-07 21:18:17,890 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1659 transitions. Word has length 819 [2025-02-07 21:18:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1659 transitions. [2025-02-07 21:18:17,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-02-07 21:18:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1659 transitions. [2025-02-07 21:18:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-02-07 21:18:17,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:17,900 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:18:17,901 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2102452133, now seen corresponding path program 1 times [2025-02-07 21:18:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978406158] [2025-02-07 21:18:17,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-02-07 21:18:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-02-07 21:18:18,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:18,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat