./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 564efe4dc14fe185d57e5aeec9a3ab580efe33ed3c6c6b76402e1a3f93fbdd78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:34:28,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:34:28,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:34:28,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:34:28,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:34:28,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:34:28,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:34:28,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:34:28,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:34:28,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:34:28,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:34:28,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:34:28,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:34:28,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:34:28,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:34:28,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:34:28,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:34:28,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:34:28,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:34:28,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:34:28,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:34:28,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:34:28,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:34:28,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:34:28,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:34:28,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:34:28,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:34:28,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564efe4dc14fe185d57e5aeec9a3ab580efe33ed3c6c6b76402e1a3f93fbdd78 [2025-01-09 04:34:29,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:34:29,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:34:29,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:34:29,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:34:29,306 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:34:29,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c [2025-01-09 04:34:30,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6afe5bc2c/6ddff750a2674a359b770038eed13242/FLAG121816bde [2025-01-09 04:34:31,148 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:34:31,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c [2025-01-09 04:34:31,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6afe5bc2c/6ddff750a2674a359b770038eed13242/FLAG121816bde [2025-01-09 04:34:31,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6afe5bc2c/6ddff750a2674a359b770038eed13242 [2025-01-09 04:34:31,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:34:31,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:34:31,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:34:31,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:34:31,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:34:31,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:31" (1/1) ... [2025-01-09 04:34:31,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c889853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:31, skipping insertion in model container [2025-01-09 04:34:31,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:31" (1/1) ... [2025-01-09 04:34:31,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:34:31,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c[1765,1778] [2025-01-09 04:34:31,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:34:31,768 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:34:31,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.bug2.i","-S") [42] [2025-01-09 04:34:31,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-2.c[1765,1778] [2025-01-09 04:34:32,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:34:32,057 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:34:32,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32 WrapperNode [2025-01-09 04:34:32,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:34:32,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:34:32,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:34:32,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:34:32,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,420 INFO L138 Inliner]: procedures = 60, calls = 2813, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 6102 [2025-01-09 04:34:32,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:34:32,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:34:32,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:34:32,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:34:32,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,565 INFO L175 MemorySlicer]: Split 1988 memory accesses to 17 slices as follows [2, 277, 285, 2, 113, 113, 186, 203, 186, 203, 186, 203, 8, 4, 2, 8, 7]. 14 percent of accesses are in the largest equivalence class. The 274 initializations are split as follows [2, 27, 27, 0, 27, 27, 27, 27, 27, 27, 27, 27, 0, 0, 0, 0, 2]. The 292 writes are split as follows [0, 27, 27, 1, 27, 27, 31, 26, 31, 26, 31, 26, 4, 0, 1, 4, 3]. [2025-01-09 04:34:32,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:34:32,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:34:32,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:34:32,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:34:32,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (1/1) ... [2025-01-09 04:34:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:34:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:32,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:34:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:34:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_observer_obstacle_flag [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_observer_obstacle_flag [2025-01-09 04:34:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-01-09 04:34:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:34:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:34:32,937 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-01-09 04:34:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-01-09 04:34:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-01-09 04:34:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-01-09 04:34:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-01-09 04:34:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:34:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:34:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:34:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:34:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:34:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:34:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-01-09 04:34:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-01-09 04:34:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 04:34:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:34:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:34:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-01-09 04:34:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:34:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:34:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-01-09 04:34:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-01-09 04:34:33,439 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:34:33,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:34:42,526 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2025-01-09 04:34:42,526 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:34:42,585 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:34:42,585 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:34:42,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:42 BoogieIcfgContainer [2025-01-09 04:34:42,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:34:42,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:34:42,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:34:42,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:34:42,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:34:31" (1/3) ... [2025-01-09 04:34:42,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a249a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:42, skipping insertion in model container [2025-01-09 04:34:42,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:32" (2/3) ... [2025-01-09 04:34:42,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a249a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:42, skipping insertion in model container [2025-01-09 04:34:42,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:42" (3/3) ... [2025-01-09 04:34:42,598 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.2.M4-2.c [2025-01-09 04:34:42,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:34:42,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.2.M4-2.c that has 20 procedures, 1819 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:34:42,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:34:42,750 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;@2a7c8918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:34:42,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:34:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 1819 states, 1024 states have (on average 1.2265625) internal successors, (1256), 1153 states have internal predecessors, (1256), 774 states have call successors, (774), 19 states have call predecessors, (774), 19 states have return successors, (774), 675 states have call predecessors, (774), 774 states have call successors, (774) [2025-01-09 04:34:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1311 [2025-01-09 04:34:42,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:42,888 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:42,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:42,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -431190571, now seen corresponding path program 1 times [2025-01-09 04:34:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:42,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799330384] [2025-01-09 04:34:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:43,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-01-09 04:34:44,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-01-09 04:34:44,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:44,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-01-09 04:34:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799330384] [2025-01-09 04:34:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799330384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:34:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575590904] [2025-01-09 04:34:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:45,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:34:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:45,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:34:45,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:34:45,996 INFO L87 Difference]: Start difference. First operand has 1819 states, 1024 states have (on average 1.2265625) internal successors, (1256), 1153 states have internal predecessors, (1256), 774 states have call successors, (774), 19 states have call predecessors, (774), 19 states have return successors, (774), 675 states have call predecessors, (774), 774 states have call successors, (774) Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-01-09 04:34:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:46,439 INFO L93 Difference]: Finished difference Result 3633 states and 6358 transitions. [2025-01-09 04:34:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:34:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1310 [2025-01-09 04:34:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:46,497 INFO L225 Difference]: With dead ends: 3633 [2025-01-09 04:34:46,497 INFO L226 Difference]: Without dead ends: 1814 [2025-01-09 04:34:46,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:34:46,542 INFO L435 NwaCegarLoop]: 2800 mSDtfsCounter, 0 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5590 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:46,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5590 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:34:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2025-01-09 04:34:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2025-01-09 04:34:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1020 states have (on average 1.2245098039215687) internal successors, (1249), 1149 states have internal predecessors, (1249), 774 states have call successors, (774), 19 states have call predecessors, (774), 19 states have return successors, (773), 674 states have call predecessors, (773), 773 states have call successors, (773) [2025-01-09 04:34:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2796 transitions. [2025-01-09 04:34:47,062 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2796 transitions. Word has length 1310 [2025-01-09 04:34:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2796 transitions. [2025-01-09 04:34:47,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-01-09 04:34:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2796 transitions. [2025-01-09 04:34:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-01-09 04:34:47,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:47,113 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:34:47,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:34:47,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1995859929, now seen corresponding path program 1 times [2025-01-09 04:34:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684703353] [2025-01-09 04:34:47,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:47,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1318 statements into 1 equivalence classes. [2025-01-09 04:34:48,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1318 of 1318 statements. [2025-01-09 04:34:48,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:48,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:34:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684703353] [2025-01-09 04:34:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684703353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:53,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:53,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933295829] [2025-01-09 04:34:53,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:53,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:53,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:53,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:53,017 INFO L87 Difference]: Start difference. First operand 1814 states and 2796 transitions. Second operand has 5 states, 4 states have (on average 66.0) internal successors, (264), 5 states have internal predecessors, (264), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-01-09 04:34:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:59,171 INFO L93 Difference]: Finished difference Result 4334 states and 6675 transitions. [2025-01-09 04:34:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 66.0) internal successors, (264), 5 states have internal predecessors, (264), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) Word has length 1318 [2025-01-09 04:34:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:59,209 INFO L225 Difference]: With dead ends: 4334 [2025-01-09 04:34:59,209 INFO L226 Difference]: Without dead ends: 2525 [2025-01-09 04:34:59,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:59,234 INFO L435 NwaCegarLoop]: 3831 mSDtfsCounter, 3824 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 3419 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3824 SdHoareTripleChecker+Valid, 6467 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:59,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3824 Valid, 6467 Invalid, 3447 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 3419 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 04:34:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2025-01-09 04:34:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2522. [2025-01-09 04:34:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 1444 states have (on average 1.2105263157894737) internal successors, (1748), 1573 states have internal predecessors, (1748), 1053 states have call successors, (1053), 25 states have call predecessors, (1053), 24 states have return successors, (1052), 952 states have call predecessors, (1052), 1052 states have call successors, (1052) [2025-01-09 04:34:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3853 transitions. [2025-01-09 04:34:59,683 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3853 transitions. Word has length 1318 [2025-01-09 04:34:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:59,685 INFO L471 AbstractCegarLoop]: Abstraction has 2522 states and 3853 transitions. [2025-01-09 04:34:59,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 66.0) internal successors, (264), 5 states have internal predecessors, (264), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-01-09 04:34:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3853 transitions. [2025-01-09 04:34:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1323 [2025-01-09 04:34:59,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:59,701 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:34:59,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:34:59,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2126799921, now seen corresponding path program 1 times [2025-01-09 04:34:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494508659] [2025-01-09 04:34:59,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-01-09 04:35:00,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-01-09 04:35:00,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:00,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:35:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494508659] [2025-01-09 04:35:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494508659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:02,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:02,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255529132] [2025-01-09 04:35:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:02,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:02,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:02,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:02,438 INFO L87 Difference]: Start difference. First operand 2522 states and 3853 transitions. Second operand has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-01-09 04:35:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:06,755 INFO L93 Difference]: Finished difference Result 4570 states and 7021 transitions. [2025-01-09 04:35:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) Word has length 1322 [2025-01-09 04:35:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:06,786 INFO L225 Difference]: With dead ends: 4570 [2025-01-09 04:35:06,786 INFO L226 Difference]: Without dead ends: 2521 [2025-01-09 04:35:06,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:06,807 INFO L435 NwaCegarLoop]: 3824 mSDtfsCounter, 4573 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4573 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 946 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:06,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4573 Valid, 5516 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [946 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 04:35:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-01-09 04:35:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2518. [2025-01-09 04:35:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 1442 states have (on average 1.2094313453536754) internal successors, (1744), 1571 states have internal predecessors, (1744), 1051 states have call successors, (1051), 25 states have call predecessors, (1051), 24 states have return successors, (1050), 950 states have call predecessors, (1050), 1050 states have call successors, (1050) [2025-01-09 04:35:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3845 transitions. [2025-01-09 04:35:07,233 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3845 transitions. Word has length 1322 [2025-01-09 04:35:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:07,236 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3845 transitions. [2025-01-09 04:35:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 66.5) internal successors, (266), 5 states have internal predecessors, (266), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-01-09 04:35:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3845 transitions. [2025-01-09 04:35:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2025-01-09 04:35:07,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:07,252 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:35:07,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:35:07,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 957401909, now seen corresponding path program 1 times [2025-01-09 04:35:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985959499] [2025-01-09 04:35:07,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:07,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-01-09 04:35:08,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-01-09 04:35:08,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:35:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985959499] [2025-01-09 04:35:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985959499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:11,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:11,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:35:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937520006] [2025-01-09 04:35:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:35:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:35:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:11,537 INFO L87 Difference]: Start difference. First operand 2518 states and 3845 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-01-09 04:35:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:16,976 INFO L93 Difference]: Finished difference Result 4475 states and 6866 transitions. [2025-01-09 04:35:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:35:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) Word has length 1323 [2025-01-09 04:35:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:17,020 INFO L225 Difference]: With dead ends: 4475 [2025-01-09 04:35:17,020 INFO L226 Difference]: Without dead ends: 4473 [2025-01-09 04:35:17,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:35:17,025 INFO L435 NwaCegarLoop]: 2785 mSDtfsCounter, 4586 mSDsluCounter, 6815 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 2313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 9600 SdHoareTripleChecker+Invalid, 3828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2313 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:17,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 9600 Invalid, 3828 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2313 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 04:35:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2025-01-09 04:35:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4445. [2025-01-09 04:35:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4445 states, 2562 states have (on average 1.2240437158469946) internal successors, (3136), 2815 states have internal predecessors, (3136), 1837 states have call successors, (1837), 45 states have call predecessors, (1837), 45 states have return successors, (1864), 1639 states have call predecessors, (1864), 1835 states have call successors, (1864) [2025-01-09 04:35:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 6837 transitions. [2025-01-09 04:35:17,791 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 6837 transitions. Word has length 1323 [2025-01-09 04:35:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:17,795 INFO L471 AbstractCegarLoop]: Abstraction has 4445 states and 6837 transitions. [2025-01-09 04:35:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-01-09 04:35:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 6837 transitions. [2025-01-09 04:35:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2025-01-09 04:35:17,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:17,823 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:35:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:35:17,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1063483883, now seen corresponding path program 1 times [2025-01-09 04:35:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010317769] [2025-01-09 04:35:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:18,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1375 statements into 1 equivalence classes. [2025-01-09 04:35:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1375 of 1375 statements. [2025-01-09 04:35:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:18,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 86957 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86957 trivial. 0 not checked. [2025-01-09 04:35:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010317769] [2025-01-09 04:35:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010317769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327904431] [2025-01-09 04:35:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:20,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:20,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:20,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:20,056 INFO L87 Difference]: Start difference. First operand 4445 states and 6837 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 3 states have call successors, (221), 2 states have call predecessors, (221), 3 states have return successors, (219), 3 states have call predecessors, (219), 3 states have call successors, (219) [2025-01-09 04:35:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:22,605 INFO L93 Difference]: Finished difference Result 9622 states and 14906 transitions. [2025-01-09 04:35:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 3 states have call successors, (221), 2 states have call predecessors, (221), 3 states have return successors, (219), 3 states have call predecessors, (219), 3 states have call successors, (219) Word has length 1375 [2025-01-09 04:35:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:22,667 INFO L225 Difference]: With dead ends: 9622 [2025-01-09 04:35:22,668 INFO L226 Difference]: Without dead ends: 5650 [2025-01-09 04:35:22,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:22,706 INFO L435 NwaCegarLoop]: 3803 mSDtfsCounter, 3928 mSDsluCounter, 5459 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 9262 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1581 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:22,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3928 Valid, 9262 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1581 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:35:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2025-01-09 04:35:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5643. [2025-01-09 04:35:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5643 states, 3294 states have (on average 1.2468123861566485) internal successors, (4107), 3651 states have internal predecessors, (4107), 2285 states have call successors, (2285), 57 states have call predecessors, (2285), 63 states have return successors, (2322), 1991 states have call predecessors, (2322), 2283 states have call successors, (2322) [2025-01-09 04:35:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 8714 transitions. [2025-01-09 04:35:24,070 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 8714 transitions. Word has length 1375 [2025-01-09 04:35:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 5643 states and 8714 transitions. [2025-01-09 04:35:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 3 states have call successors, (221), 2 states have call predecessors, (221), 3 states have return successors, (219), 3 states have call predecessors, (219), 3 states have call successors, (219) [2025-01-09 04:35:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 8714 transitions. [2025-01-09 04:35:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1380 [2025-01-09 04:35:24,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:24,108 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:35:24,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:35:24,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 27459310, now seen corresponding path program 1 times [2025-01-09 04:35:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:24,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650189113] [2025-01-09 04:35:24,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:24,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1379 statements into 1 equivalence classes. [2025-01-09 04:35:24,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1379 of 1379 statements. [2025-01-09 04:35:24,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86957 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86957 trivial. 0 not checked. [2025-01-09 04:35:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650189113] [2025-01-09 04:35:26,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650189113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:26,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:26,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323906416] [2025-01-09 04:35:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:26,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:26,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:26,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:26,079 INFO L87 Difference]: Start difference. First operand 5643 states and 8714 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 3 states have call successors, (222), 2 states have call predecessors, (222), 3 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-01-09 04:35:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:26,573 INFO L93 Difference]: Finished difference Result 11395 states and 17682 transitions. [2025-01-09 04:35:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 3 states have call successors, (222), 2 states have call predecessors, (222), 3 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) Word has length 1379 [2025-01-09 04:35:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:26,640 INFO L225 Difference]: With dead ends: 11395 [2025-01-09 04:35:26,641 INFO L226 Difference]: Without dead ends: 6225 [2025-01-09 04:35:26,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:26,684 INFO L435 NwaCegarLoop]: 3754 mSDtfsCounter, 2744 mSDsluCounter, 6075 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2744 SdHoareTripleChecker+Valid, 9829 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2744 Valid, 9829 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6225 states. [2025-01-09 04:35:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6225 to 6221. [2025-01-09 04:35:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 3649 states have (on average 1.2537681556590847) internal successors, (4575), 4056 states have internal predecessors, (4575), 2500 states have call successors, (2500), 63 states have call predecessors, (2500), 71 states have return successors, (2541), 2158 states have call predecessors, (2541), 2498 states have call successors, (2541) [2025-01-09 04:35:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 9616 transitions. [2025-01-09 04:35:27,852 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 9616 transitions. Word has length 1379 [2025-01-09 04:35:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:27,854 INFO L471 AbstractCegarLoop]: Abstraction has 6221 states and 9616 transitions. [2025-01-09 04:35:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 3 states have call successors, (222), 2 states have call predecessors, (222), 3 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-01-09 04:35:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 9616 transitions. [2025-01-09 04:35:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2025-01-09 04:35:27,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:27,881 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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] [2025-01-09 04:35:27,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:35:27,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:27,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1253362926, now seen corresponding path program 1 times [2025-01-09 04:35:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774756077] [2025-01-09 04:35:27,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:28,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-01-09 04:35:28,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-01-09 04:35:28,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:28,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 86960 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 86956 trivial. 0 not checked. [2025-01-09 04:35:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774756077] [2025-01-09 04:35:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774756077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:35:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61433008] [2025-01-09 04:35:29,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:29,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:35:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:35:29,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:35:29,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:35:30,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-01-09 04:35:31,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-01-09 04:35:31,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:31,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:31,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 4596 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:35:31,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:35:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 86960 backedges. 836 proven. 0 refuted. 0 times theorem prover too weak. 86124 trivial. 0 not checked. [2025-01-09 04:35:31,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:35:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61433008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:35:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:35:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692209359] [2025-01-09 04:35:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:31,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:31,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:35:31,767 INFO L87 Difference]: Start difference. First operand 6221 states and 9616 transitions. Second operand has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 3 states have call successors, (222), 3 states have call predecessors, (222), 3 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220)