./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2d3aad0694c3b388c0809528dd70602c78583397ee307f7b8ddb787c2822233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:59:36,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:59:36,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:59:36,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:59:36,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:59:36,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:59:36,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:59:36,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:59:36,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:59:36,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:59:36,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:59:36,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:59:36,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:59:36,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:59:36,276 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:59:36,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:59:36,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:59:36,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:59:36,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:36,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:59:36,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:59:36,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:59:36,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2d3aad0694c3b388c0809528dd70602c78583397ee307f7b8ddb787c2822233 [2025-03-03 14:59:36,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:59:36,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:59:36,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:59:36,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:59:36,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:59:36,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c [2025-03-03 14:59:37,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ca2326/97b67b7588f24145b0f79ca56d1f3aef/FLAG8e2b41aed [2025-03-03 14:59:38,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:59:38,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c [2025-03-03 14:59:38,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ca2326/97b67b7588f24145b0f79ca56d1f3aef/FLAG8e2b41aed [2025-03-03 14:59:38,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ca2326/97b67b7588f24145b0f79ca56d1f3aef [2025-03-03 14:59:38,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:59:38,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:59:38,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:38,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:59:38,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:59:38,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbdc84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38, skipping insertion in model container [2025-03-03 14:59:38,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:59:38,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c[1510,1523] [2025-03-03 14:59:38,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:38,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:59:38,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.bug1.i","-S") [38] [2025-03-03 14:59:38,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.1.M1-1.c[1510,1523] [2025-03-03 14:59:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:38,704 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:59:38,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38 WrapperNode [2025-03-03 14:59:38,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:38,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:38,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:59:38,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:59:38,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,928 INFO L138 Inliner]: procedures = 55, calls = 2249, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 4880 [2025-03-03 14:59:38,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:38,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:59:38,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:59:38,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:59:38,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:38,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,049 INFO L175 MemorySlicer]: Split 1588 memory accesses to 15 slices as follows [8, 2, 277, 4, 2, 285, 113, 113, 181, 203, 180, 203, 8, 2, 7]. 18 percent of accesses are in the largest equivalence class. The 220 initializations are split as follows [0, 2, 27, 0, 0, 27, 27, 27, 27, 27, 27, 27, 0, 0, 2]. The 229 writes are split as follows [4, 0, 27, 0, 1, 27, 27, 27, 28, 26, 28, 26, 4, 1, 3]. [2025-03-03 14:59:39,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:59:39,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:59:39,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:59:39,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:59:39,233 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (1/1) ... [2025-03-03 14:59:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:39,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:59:39,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:59:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:59:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-03 14:59:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-03 14:59:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-03-03 14:59:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-03-03 14:59:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:59:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-03 14:59:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-03 14:59:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-03-03 14:59:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 14:59:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-03 14:59:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-03-03 14:59:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-03 14:59:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-03 14:59:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-03 14:59:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-03 14:59:39,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 14:59:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-03-03 14:59:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:59:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:59:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:59:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-03-03 14:59:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-03 14:59:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-03 14:59:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-03-03 14:59:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-03-03 14:59:39,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:59:39,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:59:40,192 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: 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-03-03 14:59:40,193 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: 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-03-03 14:59:44,103 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2025-03-03 14:59:44,103 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:59:44,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:59:44,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:59:44,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:44 BoogieIcfgContainer [2025-03-03 14:59:44,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:59:44,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:59:44,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:59:44,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:59:44,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:59:38" (1/3) ... [2025-03-03 14:59:44,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d5c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:44, skipping insertion in model container [2025-03-03 14:59:44,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:38" (2/3) ... [2025-03-03 14:59:44,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d5c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:44, skipping insertion in model container [2025-03-03 14:59:44,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:44" (3/3) ... [2025-03-03 14:59:44,159 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.1.M1-1.c [2025-03-03 14:59:44,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:59:44,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.1.M1-1.c that has 16 procedures, 1472 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:59:44,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:59:44,270 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;@204d261b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:59:44,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:59:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 1472 states, 844 states have (on average 1.2618483412322274) internal successors, (1065), 973 states have internal predecessors, (1065), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-03 14:59:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2025-03-03 14:59:44,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:44,410 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:44,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 251454681, now seen corresponding path program 1 times [2025-03-03 14:59:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100514374] [2025-03-03 14:59:44,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:44,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-03 14:59:44,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-03 14:59:44,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:44,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 120576 trivial. 0 not checked. [2025-03-03 14:59:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100514374] [2025-03-03 14:59:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100514374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064870641] [2025-03-03 14:59:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:46,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:46,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:59:47,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-03 14:59:47,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-03 14:59:47,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:47,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 7426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:59:47,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 120576 trivial. 0 not checked. [2025-03-03 14:59:48,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064870641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 14:59:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412066684] [2025-03-03 14:59:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:48,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:59:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:48,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:59:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:48,069 INFO L87 Difference]: Start difference. First operand has 1472 states, 844 states have (on average 1.2618483412322274) internal successors, (1065), 973 states have internal predecessors, (1065), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) Second operand has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) [2025-03-03 14:59:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:48,223 INFO L93 Difference]: Finished difference Result 2939 states and 5163 transitions. [2025-03-03 14:59:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:59:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) Word has length 2130 [2025-03-03 14:59:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:48,247 INFO L225 Difference]: With dead ends: 2939 [2025-03-03 14:59:48,247 INFO L226 Difference]: Without dead ends: 1467 [2025-03-03 14:59:48,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 2131 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-03-03 14:59:48,270 INFO L435 NwaCegarLoop]: 2285 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, 2285 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-03-03 14:59:48,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:59:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-03 14:59:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2025-03-03 14:59:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 840 states have (on average 1.2595238095238095) internal successors, (1058), 968 states have internal predecessors, (1058), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-03 14:59:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2280 transitions. [2025-03-03 14:59:48,591 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2280 transitions. Word has length 2130 [2025-03-03 14:59:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2280 transitions. [2025-03-03 14:59:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 2 states have call successors, (273), 2 states have call predecessors, (273), 1 states have return successors, (273), 1 states have call predecessors, (273), 2 states have call successors, (273) [2025-03-03 14:59:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2280 transitions. [2025-03-03 14:59:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2025-03-03 14:59:48,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:48,691 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:48,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:48,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:59:48,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1404845610, now seen corresponding path program 1 times [2025-03-03 14:59:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288972524] [2025-03-03 14:59:48,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:49,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-03 14:59:49,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-03 14:59:49,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:49,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 120941 trivial. 0 not checked. [2025-03-03 14:59:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288972524] [2025-03-03 14:59:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288972524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040229958] [2025-03-03 14:59:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:51,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:51,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:59:52,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2130 statements into 1 equivalence classes. [2025-03-03 14:59:52,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2130 of 2130 statements. [2025-03-03 14:59:52,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:52,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:53,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 7426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:59:53,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 121056 backedges. 27793 proven. 0 refuted. 0 times theorem prover too weak. 93263 trivial. 0 not checked. [2025-03-03 14:59:53,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040229958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-03 14:59:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218250217] [2025-03-03 14:59:53,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:59:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:53,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:59:53,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:59:53,133 INFO L87 Difference]: Start difference. First operand 1467 states and 2280 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) [2025-03-03 14:59:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:53,216 INFO L93 Difference]: Finished difference Result 2459 states and 3872 transitions. [2025-03-03 14:59:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:59:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) Word has length 2130 [2025-03-03 14:59:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:53,238 INFO L225 Difference]: With dead ends: 2459 [2025-03-03 14:59:53,238 INFO L226 Difference]: Without dead ends: 1467 [2025-03-03 14:59:53,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2132 GetRequests, 2131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:59:53,244 INFO L435 NwaCegarLoop]: 2278 mSDtfsCounter, 0 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:53,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4546 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:59:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-03 14:59:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2025-03-03 14:59:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 840 states have (on average 1.2583333333333333) internal successors, (1057), 968 states have internal predecessors, (1057), 611 states have call successors, (611), 15 states have call predecessors, (611), 15 states have return successors, (611), 512 states have call predecessors, (611), 611 states have call successors, (611) [2025-03-03 14:59:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2279 transitions. [2025-03-03 14:59:53,406 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2279 transitions. Word has length 2130 [2025-03-03 14:59:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:53,412 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2279 transitions. [2025-03-03 14:59:53,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 2 states have call successors, (274), 2 states have call predecessors, (274), 2 states have return successors, (274), 2 states have call predecessors, (274), 2 states have call successors, (274) [2025-03-03 14:59:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2279 transitions. [2025-03-03 14:59:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2323 [2025-03-03 14:59:53,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:53,481 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:53,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:59:53,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:59:53,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:53,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -141459562, now seen corresponding path program 1 times [2025-03-03 14:59:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:53,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294629443] [2025-03-03 14:59:53,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:53,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-03 14:59:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-03 14:59:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 124992 backedges. 4 proven. 116 refuted. 0 times theorem prover too weak. 124872 trivial. 0 not checked. [2025-03-03 14:59:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294629443] [2025-03-03 14:59:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294629443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013753541] [2025-03-03 14:59:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:56,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:56,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:56,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:56,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:59:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-03 14:59:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-03 14:59:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:57,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 8194 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:59:57,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 124992 backedges. 27563 proven. 0 refuted. 0 times theorem prover too weak. 97429 trivial. 0 not checked. [2025-03-03 14:59:57,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013753541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279263902] [2025-03-03 14:59:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:57,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:57,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:57,928 INFO L87 Difference]: Start difference. First operand 1467 states and 2279 transitions. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) [2025-03-03 14:59:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:59,527 INFO L93 Difference]: Finished difference Result 2695 states and 4224 transitions. [2025-03-03 14:59:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) Word has length 2322 [2025-03-03 14:59:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:59,542 INFO L225 Difference]: With dead ends: 2695 [2025-03-03 14:59:59,542 INFO L226 Difference]: Without dead ends: 1703 [2025-03-03 14:59:59,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2328 GetRequests, 2321 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:59,549 INFO L435 NwaCegarLoop]: 2266 mSDtfsCounter, 1331 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 6660 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:59,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 6660 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:59:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-03-03 14:59:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1703. [2025-03-03 14:59:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1016 states have (on average 1.2726377952755905) internal successors, (1293), 1144 states have internal predecessors, (1293), 666 states have call successors, (666), 20 states have call predecessors, (666), 20 states have return successors, (666), 567 states have call predecessors, (666), 666 states have call successors, (666) [2025-03-03 14:59:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2625 transitions. [2025-03-03 14:59:59,705 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2625 transitions. Word has length 2322 [2025-03-03 14:59:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:59,708 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2625 transitions. [2025-03-03 14:59:59,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 3 states have call successors, (280), 3 states have call predecessors, (280), 3 states have return successors, (280), 3 states have call predecessors, (280), 3 states have call successors, (280) [2025-03-03 14:59:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2625 transitions. [2025-03-03 14:59:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2025-03-03 14:59:59,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:59,786 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 27, 27, 27, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:59,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:59:59,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:59,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1201619873, now seen corresponding path program 1 times [2025-03-03 14:59:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36981415] [2025-03-03 14:59:59,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2310 statements into 1 equivalence classes. [2025-03-03 15:00:00,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2310 of 2310 statements. [2025-03-03 15:00:00,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:00,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 124767 trivial. 0 not checked. [2025-03-03 15:00:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36981415] [2025-03-03 15:00:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36981415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136117311] [2025-03-03 15:00:04,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:04,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:04,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:00:05,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2310 statements into 1 equivalence classes. [2025-03-03 15:00:05,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2310 of 2310 statements. [2025-03-03 15:00:05,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:05,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:06,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 8158 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:00:06,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 25585 proven. 2 refuted. 0 times theorem prover too weak. 99537 trivial. 0 not checked. [2025-03-03 15:00:06,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:00:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 125124 backedges. 12 proven. 144 refuted. 0 times theorem prover too weak. 124968 trivial. 0 not checked. [2025-03-03 15:00:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136117311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:00:07,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:00:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-03 15:00:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488008329] [2025-03-03 15:00:07,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:00:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:00:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:00:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:00:07,337 INFO L87 Difference]: Start difference. First operand 1703 states and 2625 transitions. Second operand has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) [2025-03-03 15:00:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:10,848 INFO L93 Difference]: Finished difference Result 2938 states and 4573 transitions. [2025-03-03 15:00:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:00:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) Word has length 2310 [2025-03-03 15:00:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:10,862 INFO L225 Difference]: With dead ends: 2938 [2025-03-03 15:00:10,863 INFO L226 Difference]: Without dead ends: 1710 [2025-03-03 15:00:10,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4626 GetRequests, 4614 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:00:10,869 INFO L435 NwaCegarLoop]: 2607 mSDtfsCounter, 2572 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 6165 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 10673 SdHoareTripleChecker+Invalid, 6193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:10,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 10673 Invalid, 6193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 6165 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 15:00:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-03 15:00:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2025-03-03 15:00:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.2681017612524461) internal successors, (1296), 1150 states have internal predecessors, (1296), 665 states have call successors, (665), 22 states have call predecessors, (665), 22 states have return successors, (665), 566 states have call predecessors, (665), 665 states have call successors, (665) [2025-03-03 15:00:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2626 transitions. [2025-03-03 15:00:11,016 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2626 transitions. Word has length 2310 [2025-03-03 15:00:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:11,017 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2626 transitions. [2025-03-03 15:00:11,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 47.90909090909091) internal successors, (527), 13 states have internal predecessors, (527), 7 states have call successors, (346), 4 states have call predecessors, (346), 5 states have return successors, (348), 5 states have call predecessors, (348), 7 states have call successors, (348) [2025-03-03 15:00:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2626 transitions. [2025-03-03 15:00:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2435 [2025-03-03 15:00:11,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:11,054 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 26, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:11,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:00:11,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:11,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -618844254, now seen corresponding path program 1 times [2025-03-03 15:00:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:11,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788164672] [2025-03-03 15:00:11,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:11,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2434 statements into 1 equivalence classes. [2025-03-03 15:00:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2434 of 2434 statements. [2025-03-03 15:00:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:11,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 126404 backedges. 0 proven. 402 refuted. 0 times theorem prover too weak. 126002 trivial. 0 not checked. [2025-03-03 15:00:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788164672] [2025-03-03 15:00:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788164672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007941467] [2025-03-03 15:00:14,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:14,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:14,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:00:15,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2434 statements into 1 equivalence classes. [2025-03-03 15:00:15,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2434 of 2434 statements. [2025-03-03 15:00:15,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:15,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 8506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 15:00:15,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 126404 backedges. 27648 proven. 0 refuted. 0 times theorem prover too weak. 98756 trivial. 0 not checked. [2025-03-03 15:00:16,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:00:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007941467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:00:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:00:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380335242] [2025-03-03 15:00:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:16,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:16,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:16,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:16,894 INFO L87 Difference]: Start difference. First operand 1710 states and 2626 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) [2025-03-03 15:00:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:16,942 INFO L93 Difference]: Finished difference Result 2945 states and 4582 transitions. [2025-03-03 15:00:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) Word has length 2434 [2025-03-03 15:00:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:16,955 INFO L225 Difference]: With dead ends: 2945 [2025-03-03 15:00:16,956 INFO L226 Difference]: Without dead ends: 1710 [2025-03-03 15:00:16,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2439 GetRequests, 2435 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:16,962 INFO L435 NwaCegarLoop]: 2267 mSDtfsCounter, 1608 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:16,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 2267 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-03 15:00:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2025-03-03 15:00:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.264187866927593) internal successors, (1292), 1150 states have internal predecessors, (1292), 665 states have call successors, (665), 22 states have call predecessors, (665), 22 states have return successors, (665), 566 states have call predecessors, (665), 665 states have call successors, (665) [2025-03-03 15:00:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2622 transitions. [2025-03-03 15:00:17,090 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2622 transitions. Word has length 2434 [2025-03-03 15:00:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:17,094 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2622 transitions. [2025-03-03 15:00:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 2 states have internal predecessors, (451), 2 states have call successors, (278), 2 states have call predecessors, (278), 2 states have return successors, (278), 2 states have call predecessors, (278), 2 states have call successors, (278) [2025-03-03 15:00:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2622 transitions. [2025-03-03 15:00:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2436 [2025-03-03 15:00:17,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:17,124 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 48, 48, 27, 27, 27, 26, 26, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:17,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:00:17,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:17,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1352467487, now seen corresponding path program 1 times [2025-03-03 15:00:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71751019] [2025-03-03 15:00:17,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:17,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2435 statements into 1 equivalence classes. [2025-03-03 15:00:17,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2435 of 2435 statements. [2025-03-03 15:00:17,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:17,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 126441 trivial. 0 not checked. [2025-03-03 15:00:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71751019] [2025-03-03 15:00:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71751019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131340576] [2025-03-03 15:00:21,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:21,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:21,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:21,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:00:22,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2435 statements into 1 equivalence classes. [2025-03-03 15:00:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2435 of 2435 statements. [2025-03-03 15:00:23,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:23,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:23,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 8463 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 15:00:23,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:23,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 351 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 1 [2025-03-03 15:00:23,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 351 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 1 [2025-03-03 15:00:41,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-03 15:00:41,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-03 15:00:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 61164 proven. 2779 refuted. 0 times theorem prover too weak. 62509 trivial. 0 not checked. [2025-03-03 15:00:42,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:00:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 126452 backedges. 597 proven. 1554 refuted. 0 times theorem prover too weak. 124301 trivial. 0 not checked. [2025-03-03 15:00:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131340576] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:00:45,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:00:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20, 18] total 38 [2025-03-03 15:00:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375845334] [2025-03-03 15:00:45,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:00:45,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 15:00:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 15:00:45,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 15:00:45,262 INFO L87 Difference]: Start difference. First operand 1710 states and 2622 transitions. Second operand has 38 states, 30 states have (on average 38.4) internal successors, (1152), 36 states have internal predecessors, (1152), 18 states have call successors, (740), 8 states have call predecessors, (740), 14 states have return successors, (741), 12 states have call predecessors, (741), 18 states have call successors, (741) [2025-03-03 15:00:46,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:47,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:49,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:50,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:52,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:54,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:55,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:57,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:58,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:00:59,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []