./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:37,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:37,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:37,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:37,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:37,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:37,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:37,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:37,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:37,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:37,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:37,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:37,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:37,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:37,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:37,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:37,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:37,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:37,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:37,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:37,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:37,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:37,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:37,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:37,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:37,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:37,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:37,457 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf [2025-03-16 19:42:37,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:37,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:37,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:37,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:37,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:37,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-03-16 19:42:38,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006af98bc/dd19565a043a4a5cadfc69449e24ffd6/FLAG06b50f67c [2025-03-16 19:42:39,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:39,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-03-16 19:42:39,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006af98bc/dd19565a043a4a5cadfc69449e24ffd6/FLAG06b50f67c [2025-03-16 19:42:39,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006af98bc/dd19565a043a4a5cadfc69449e24ffd6 [2025-03-16 19:42:39,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:39,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:39,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:39,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:39,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:39,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:39,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d94e2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39, skipping insertion in model container [2025-03-16 19:42:39,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:39,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:39,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-03-16 19:42:39,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:39,843 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:39,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-03-16 19:42:39,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:39,995 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:39,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39 WrapperNode [2025-03-16 19:42:39,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:39,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:39,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:39,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:40,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,088 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-03-16 19:42:40,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:40,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:40,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:40,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:40,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,153 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [7, 2, 8, 113, 8, 3, 8, 8, 20, 12, 82, 7, 8, 3, 50, 8, 6, 41, 0, 3]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [0, 2, 2, 46, 3, 0, 3, 3, 6, 6, 40, 0, 2, 0, 0, 2, 2, 0, 0, 0]. The 94 writes are split as follows [1, 0, 3, 33, 2, 1, 2, 2, 8, 3, 21, 1, 4, 1, 4, 4, 2, 1, 0, 1]. [2025-03-16 19:42:40,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:40,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:40,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:40,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:40,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (1/1) ... [2025-03-16 19:42:40,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:40,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:40,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:42:40,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-03-16 19:42:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-16 19:42:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:42:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-16 19:42:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-16 19:42:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 19:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:42:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 19:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:40,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:40,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:40,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,118 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-16 19:42:41,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);enqueue_#res#1 := 0; [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,121 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:41,122 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,638 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:45,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:45,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:45,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:45,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:45 BoogieIcfgContainer [2025-03-16 19:42:45,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:45,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:45,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:45,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:45,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:39" (1/3) ... [2025-03-16 19:42:45,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd4cc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:45, skipping insertion in model container [2025-03-16 19:42:45,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:39" (2/3) ... [2025-03-16 19:42:45,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd4cc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:45, skipping insertion in model container [2025-03-16 19:42:45,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:45" (3/3) ... [2025-03-16 19:42:45,662 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-03-16 19:42:45,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:45,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 333 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-16 19:42:45,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:45,737 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;@76a322ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:45,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 192 states have internal predecessors, (280), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-16 19:42:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 19:42:45,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:45,771 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:45,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:45,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1486305210, now seen corresponding path program 1 times [2025-03-16 19:42:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117058972] [2025-03-16 19:42:45,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:46,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 19:42:46,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 19:42:46,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:46,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-16 19:42:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117058972] [2025-03-16 19:42:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117058972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137135939] [2025-03-16 19:42:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:46,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:46,979 INFO L87 Difference]: Start difference. First operand has 333 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 192 states have internal predecessors, (280), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:51,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:51,157 INFO L93 Difference]: Finished difference Result 662 states and 1207 transitions. [2025-03-16 19:42:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 324 [2025-03-16 19:42:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:51,168 INFO L225 Difference]: With dead ends: 662 [2025-03-16 19:42:51,168 INFO L226 Difference]: Without dead ends: 331 [2025-03-16 19:42:51,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:51,176 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 6 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:51,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1059 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:42:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-16 19:42:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2025-03-16 19:42:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 187 states have (on average 1.4598930481283423) internal successors, (273), 189 states have internal predecessors, (273), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-16 19:42:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 534 transitions. [2025-03-16 19:42:51,249 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 534 transitions. Word has length 324 [2025-03-16 19:42:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:51,250 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 534 transitions. [2025-03-16 19:42:51,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 534 transitions. [2025-03-16 19:42:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 19:42:51,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:51,261 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:51,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:51,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:51,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1563691190, now seen corresponding path program 1 times [2025-03-16 19:42:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932110673] [2025-03-16 19:42:51,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:51,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 19:42:51,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 19:42:51,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:51,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-16 19:42:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:51,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932110673] [2025-03-16 19:42:51,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932110673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:51,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:51,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:51,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414558974] [2025-03-16 19:42:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:51,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:51,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:51,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:51,865 INFO L87 Difference]: Start difference. First operand 328 states and 534 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:51,982 INFO L93 Difference]: Finished difference Result 657 states and 1072 transitions. [2025-03-16 19:42:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:51,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 328 [2025-03-16 19:42:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:51,986 INFO L225 Difference]: With dead ends: 657 [2025-03-16 19:42:51,986 INFO L226 Difference]: Without dead ends: 331 [2025-03-16 19:42:51,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:51,988 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:51,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1055 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:42:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-16 19:42:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-03-16 19:42:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 190 states have (on average 1.4526315789473685) internal successors, (276), 192 states have internal predecessors, (276), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-16 19:42:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 537 transitions. [2025-03-16 19:42:52,029 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 537 transitions. Word has length 328 [2025-03-16 19:42:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 537 transitions. [2025-03-16 19:42:52,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 537 transitions. [2025-03-16 19:42:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-16 19:42:52,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:52,036 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:52,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:52,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash -338393842, now seen corresponding path program 1 times [2025-03-16 19:42:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237074233] [2025-03-16 19:42:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 19:42:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 19:42:52,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:52,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-16 19:42:52,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237074233] [2025-03-16 19:42:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237074233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360914696] [2025-03-16 19:42:52,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:52,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:52,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:42:52,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:42:53,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 19:42:53,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 19:42:53,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:53,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:53,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:53,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-16 19:42:53,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-16 19:42:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360914696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:54,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 19:42:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160725071] [2025-03-16 19:42:54,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:54,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:42:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:42:54,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:54,063 INFO L87 Difference]: Start difference. First operand 331 states and 537 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-16 19:42:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:54,215 INFO L93 Difference]: Finished difference Result 667 states and 1086 transitions. [2025-03-16 19:42:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:42:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 331 [2025-03-16 19:42:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:54,219 INFO L225 Difference]: With dead ends: 667 [2025-03-16 19:42:54,220 INFO L226 Difference]: Without dead ends: 338 [2025-03-16 19:42:54,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:54,222 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:54,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1579 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:42:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-16 19:42:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-16 19:42:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 199 states have internal predecessors, (283), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-16 19:42:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 544 transitions. [2025-03-16 19:42:54,246 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 544 transitions. Word has length 331 [2025-03-16 19:42:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:54,246 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 544 transitions. [2025-03-16 19:42:54,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-16 19:42:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 544 transitions. [2025-03-16 19:42:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 19:42:54,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:54,251 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 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] [2025-03-16 19:42:54,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:42:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:54,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:54,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1336752586, now seen corresponding path program 2 times [2025-03-16 19:42:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854749272] [2025-03-16 19:42:54,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:54,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-16 19:42:54,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 338 statements. [2025-03-16 19:42:54,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2025-03-16 19:42:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854749272] [2025-03-16 19:42:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854749272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:42:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599009019] [2025-03-16 19:42:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:42:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:55,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:42:55,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:55,130 INFO L87 Difference]: Start difference. First operand 338 states and 544 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:55,326 INFO L93 Difference]: Finished difference Result 664 states and 1076 transitions. [2025-03-16 19:42:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 338 [2025-03-16 19:42:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:55,332 INFO L225 Difference]: With dead ends: 664 [2025-03-16 19:42:55,332 INFO L226 Difference]: Without dead ends: 662 [2025-03-16 19:42:55,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:55,333 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 415 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:55,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 2139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:42:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-16 19:42:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2025-03-16 19:42:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 378 states have (on average 1.4417989417989419) internal successors, (545), 381 states have internal predecessors, (545), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-16 19:42:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1072 transitions. [2025-03-16 19:42:55,379 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1072 transitions. Word has length 338 [2025-03-16 19:42:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:55,380 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1072 transitions. [2025-03-16 19:42:55,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-16 19:42:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1072 transitions. [2025-03-16 19:42:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-16 19:42:55,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:55,387 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 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] [2025-03-16 19:42:55,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:55,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2026623033, now seen corresponding path program 1 times [2025-03-16 19:42:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046617659] [2025-03-16 19:42:55,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:55,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 19:42:55,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 19:42:55,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:55,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2025-03-16 19:42:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046617659] [2025-03-16 19:42:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046617659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081982162] [2025-03-16 19:42:55,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:55,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:55,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:55,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:42:55,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:42:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 19:42:56,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 19:42:56,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:56,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:56,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:42:56,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2025-03-16 19:42:56,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2025-03-16 19:42:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081982162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:57,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:57,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-16 19:42:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188327265] [2025-03-16 19:42:57,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:57,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:42:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:57,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:42:57,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:42:57,332 INFO L87 Difference]: Start difference. First operand 659 states and 1072 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-16 19:43:02,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:06,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:06,105 INFO L93 Difference]: Finished difference Result 1356 states and 2212 transitions. [2025-03-16 19:43:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 19:43:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 343 [2025-03-16 19:43:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:06,120 INFO L225 Difference]: With dead ends: 1356 [2025-03-16 19:43:06,120 INFO L226 Difference]: Without dead ends: 699 [2025-03-16 19:43:06,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:43:06,125 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 29 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 103 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:06,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2627 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-16 19:43:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-16 19:43:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-16 19:43:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 418 states have (on average 1.4066985645933014) internal successors, (588), 421 states have internal predecessors, (588), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-16 19:43:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1115 transitions. [2025-03-16 19:43:06,175 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1115 transitions. Word has length 343 [2025-03-16 19:43:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:06,175 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1115 transitions. [2025-03-16 19:43:06,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-16 19:43:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1115 transitions. [2025-03-16 19:43:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-16 19:43:06,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:06,182 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 20, 20, 6, 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] [2025-03-16 19:43:06,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:43:06,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:06,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash -311763715, now seen corresponding path program 2 times [2025-03-16 19:43:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432094231] [2025-03-16 19:43:06,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:06,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 383 statements into 2 equivalence classes. [2025-03-16 19:43:06,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 383 statements. [2025-03-16 19:43:06,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5797 trivial. 0 not checked. [2025-03-16 19:43:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432094231] [2025-03-16 19:43:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432094231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:07,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:07,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824605867] [2025-03-16 19:43:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:07,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:07,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:07,127 INFO L87 Difference]: Start difference. First operand 699 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 19:43:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:07,207 INFO L93 Difference]: Finished difference Result 1333 states and 2151 transitions. [2025-03-16 19:43:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 383 [2025-03-16 19:43:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:07,213 INFO L225 Difference]: With dead ends: 1333 [2025-03-16 19:43:07,213 INFO L226 Difference]: Without dead ends: 699 [2025-03-16 19:43:07,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:07,216 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:07,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1060 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:43:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-16 19:43:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-16 19:43:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 418 states have (on average 1.4043062200956937) internal successors, (587), 421 states have internal predecessors, (587), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-16 19:43:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1114 transitions. [2025-03-16 19:43:07,260 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1114 transitions. Word has length 383 [2025-03-16 19:43:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1114 transitions. [2025-03-16 19:43:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 19:43:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1114 transitions. [2025-03-16 19:43:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 19:43:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:07,268 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 20, 20, 6, 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] [2025-03-16 19:43:07,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:07,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -4347039, now seen corresponding path program 1 times [2025-03-16 19:43:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680312881] [2025-03-16 19:43:07,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:07,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 19:43:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 19:43:07,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:07,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-16 19:43:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680312881] [2025-03-16 19:43:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680312881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501150266] [2025-03-16 19:43:08,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:08,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:08,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:43:09,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 19:43:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 19:43:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:09,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:09,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2025-03-16 19:43:09,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-16 19:43:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501150266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:10,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-16 19:43:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323913559] [2025-03-16 19:43:10,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:10,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:43:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:43:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:43:10,523 INFO L87 Difference]: Start difference. First operand 699 states and 1114 transitions. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:10,963 INFO L93 Difference]: Finished difference Result 1425 states and 2294 transitions. [2025-03-16 19:43:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:43:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 403 [2025-03-16 19:43:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:10,970 INFO L225 Difference]: With dead ends: 1425 [2025-03-16 19:43:10,970 INFO L226 Difference]: Without dead ends: 739 [2025-03-16 19:43:10,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 794 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:43:10,974 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:10,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3148 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:43:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-16 19:43:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-03-16 19:43:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 458 states have (on average 1.3689956331877728) internal successors, (627), 461 states have internal predecessors, (627), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-16 19:43:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1154 transitions. [2025-03-16 19:43:11,027 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1154 transitions. Word has length 403 [2025-03-16 19:43:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1154 transitions. [2025-03-16 19:43:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1154 transitions. [2025-03-16 19:43:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-16 19:43:11,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:11,035 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 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] [2025-03-16 19:43:11,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:43:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:11,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1257672502, now seen corresponding path program 1 times [2025-03-16 19:43:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703575537] [2025-03-16 19:43:11,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:11,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 19:43:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 19:43:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-03-16 19:43:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703575537] [2025-03-16 19:43:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703575537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:12,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328468952] [2025-03-16 19:43:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:12,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:12,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:12,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:12,747 INFO L87 Difference]: Start difference. First operand 739 states and 1154 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:16,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:20,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:22,335 INFO L93 Difference]: Finished difference Result 2033 states and 3282 transitions. [2025-03-16 19:43:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 444 [2025-03-16 19:43:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:22,346 INFO L225 Difference]: With dead ends: 2033 [2025-03-16 19:43:22,346 INFO L226 Difference]: Without dead ends: 1392 [2025-03-16 19:43:22,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:22,350 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 683 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:22,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1666 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-03-16 19:43:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-16 19:43:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 745. [2025-03-16 19:43:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 462 states have (on average 1.3658008658008658) internal successors, (631), 467 states have internal predecessors, (631), 261 states have call successors, (261), 19 states have call predecessors, (261), 21 states have return successors, (272), 260 states have call predecessors, (272), 259 states have call successors, (272) [2025-03-16 19:43:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1164 transitions. [2025-03-16 19:43:22,418 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1164 transitions. Word has length 444 [2025-03-16 19:43:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:22,418 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1164 transitions. [2025-03-16 19:43:22,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1164 transitions. [2025-03-16 19:43:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-16 19:43:22,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:22,424 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 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] [2025-03-16 19:43:22,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:43:22,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:22,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash 518444897, now seen corresponding path program 2 times [2025-03-16 19:43:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983909192] [2025-03-16 19:43:22,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:22,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 443 statements into 2 equivalence classes. [2025-03-16 19:43:23,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 443 of 443 statements. [2025-03-16 19:43:23,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:43:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-03-16 19:43:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983909192] [2025-03-16 19:43:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983909192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:24,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:24,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088333067] [2025-03-16 19:43:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:24,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:24,831 INFO L87 Difference]: Start difference. First operand 745 states and 1164 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-16 19:43:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:25,855 INFO L93 Difference]: Finished difference Result 780 states and 1211 transitions. [2025-03-16 19:43:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 443 [2025-03-16 19:43:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:25,860 INFO L225 Difference]: With dead ends: 780 [2025-03-16 19:43:25,861 INFO L226 Difference]: Without dead ends: 778 [2025-03-16 19:43:25,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:25,861 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 595 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:25,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2027 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:43:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-03-16 19:43:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2025-03-16 19:43:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 480 states have (on average 1.3604166666666666) internal successors, (653), 485 states have internal predecessors, (653), 266 states have call successors, (266), 20 states have call predecessors, (266), 25 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-16 19:43:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1203 transitions. [2025-03-16 19:43:25,905 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1203 transitions. Word has length 443 [2025-03-16 19:43:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:25,905 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1203 transitions. [2025-03-16 19:43:25,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-16 19:43:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1203 transitions. [2025-03-16 19:43:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-16 19:43:25,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:25,910 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 3, 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] [2025-03-16 19:43:25,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:43:25,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash 798687554, now seen corresponding path program 1 times [2025-03-16 19:43:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905037906] [2025-03-16 19:43:25,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-16 19:43:26,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-16 19:43:26,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:26,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-03-16 19:43:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905037906] [2025-03-16 19:43:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905037906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926172628] [2025-03-16 19:43:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:27,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:27,356 INFO L87 Difference]: Start difference. First operand 772 states and 1203 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-16 19:43:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:28,327 INFO L93 Difference]: Finished difference Result 781 states and 1210 transitions. [2025-03-16 19:43:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 448 [2025-03-16 19:43:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:28,332 INFO L225 Difference]: With dead ends: 781 [2025-03-16 19:43:28,332 INFO L226 Difference]: Without dead ends: 779 [2025-03-16 19:43:28,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:28,333 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 594 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:28,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2024 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:43:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-16 19:43:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 776. [2025-03-16 19:43:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 483 states have (on average 1.3581780538302277) internal successors, (656), 488 states have internal predecessors, (656), 266 states have call successors, (266), 21 states have call predecessors, (266), 26 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-16 19:43:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1206 transitions. [2025-03-16 19:43:28,373 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1206 transitions. Word has length 448 [2025-03-16 19:43:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:28,373 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1206 transitions. [2025-03-16 19:43:28,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-16 19:43:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1206 transitions. [2025-03-16 19:43:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-16 19:43:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:28,378 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 4, 3, 3, 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] [2025-03-16 19:43:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:43:28,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -437402559, now seen corresponding path program 1 times [2025-03-16 19:43:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43030201] [2025-03-16 19:43:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:28,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-16 19:43:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-16 19:43:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7283 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7277 trivial. 0 not checked. [2025-03-16 19:43:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43030201] [2025-03-16 19:43:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43030201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:30,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:30,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109164429] [2025-03-16 19:43:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:30,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:30,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:30,068 INFO L87 Difference]: Start difference. First operand 776 states and 1206 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-16 19:43:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:31,310 INFO L93 Difference]: Finished difference Result 785 states and 1213 transitions. [2025-03-16 19:43:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:31,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 453 [2025-03-16 19:43:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:31,315 INFO L225 Difference]: With dead ends: 785 [2025-03-16 19:43:31,315 INFO L226 Difference]: Without dead ends: 783 [2025-03-16 19:43:31,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:31,316 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 785 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:31,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1938 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:43:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-16 19:43:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2025-03-16 19:43:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 486 states have (on average 1.3559670781893005) internal successors, (659), 491 states have internal predecessors, (659), 266 states have call successors, (266), 22 states have call predecessors, (266), 27 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-16 19:43:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1209 transitions. [2025-03-16 19:43:31,358 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1209 transitions. Word has length 453 [2025-03-16 19:43:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:31,360 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1209 transitions. [2025-03-16 19:43:31,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-16 19:43:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1209 transitions. [2025-03-16 19:43:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-16 19:43:31,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:31,365 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 5, 4, 4, 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] [2025-03-16 19:43:31,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:43:31,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 302706914, now seen corresponding path program 1 times [2025-03-16 19:43:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671784624] [2025-03-16 19:43:31,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:31,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-16 19:43:32,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-16 19:43:32,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:32,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7297 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7289 trivial. 0 not checked. [2025-03-16 19:43:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671784624] [2025-03-16 19:43:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671784624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:32,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767394954] [2025-03-16 19:43:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:32,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:32,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:32,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:32,895 INFO L87 Difference]: Start difference. First operand 780 states and 1209 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 4 states have call successors, (59) [2025-03-16 19:43:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:34,055 INFO L93 Difference]: Finished difference Result 789 states and 1216 transitions. [2025-03-16 19:43:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 4 states have call successors, (59) Word has length 458 [2025-03-16 19:43:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:34,060 INFO L225 Difference]: With dead ends: 789 [2025-03-16 19:43:34,060 INFO L226 Difference]: Without dead ends: 787 [2025-03-16 19:43:34,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:34,061 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1098 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:34,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1948 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:43:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-16 19:43:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 784. [2025-03-16 19:43:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 489 states have (on average 1.3537832310838447) internal successors, (662), 494 states have internal predecessors, (662), 266 states have call successors, (266), 23 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-16 19:43:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1212 transitions. [2025-03-16 19:43:34,133 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1212 transitions. Word has length 458 [2025-03-16 19:43:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:34,133 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1212 transitions. [2025-03-16 19:43:34,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 4 states have call successors, (59) [2025-03-16 19:43:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1212 transitions. [2025-03-16 19:43:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-16 19:43:34,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:34,140 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 6, 5, 5, 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] [2025-03-16 19:43:34,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:43:34,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 401107233, now seen corresponding path program 1 times [2025-03-16 19:43:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076388393] [2025-03-16 19:43:34,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:34,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-16 19:43:34,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-16 19:43:34,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:34,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7305 trivial. 0 not checked. [2025-03-16 19:43:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076388393] [2025-03-16 19:43:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076388393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445427510] [2025-03-16 19:43:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:35,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:35,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:35,552 INFO L87 Difference]: Start difference. First operand 784 states and 1212 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-16 19:43:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:36,876 INFO L93 Difference]: Finished difference Result 793 states and 1219 transitions. [2025-03-16 19:43:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) Word has length 463 [2025-03-16 19:43:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:36,881 INFO L225 Difference]: With dead ends: 793 [2025-03-16 19:43:36,881 INFO L226 Difference]: Without dead ends: 789 [2025-03-16 19:43:36,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:36,882 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 906 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:36,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2024 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:43:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-16 19:43:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 786. [2025-03-16 19:43:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 491 states have (on average 1.35030549898167) internal successors, (663), 495 states have internal predecessors, (663), 266 states have call successors, (266), 24 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-16 19:43:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1213 transitions. [2025-03-16 19:43:36,926 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1213 transitions. Word has length 463 [2025-03-16 19:43:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1213 transitions. [2025-03-16 19:43:36,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-16 19:43:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1213 transitions. [2025-03-16 19:43:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 19:43:36,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:36,931 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 7, 6, 6, 6, 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] [2025-03-16 19:43:36,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:43:36,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:36,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1696213122, now seen corresponding path program 1 times [2025-03-16 19:43:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686271530] [2025-03-16 19:43:36,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:37,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 19:43:37,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 19:43:37,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:37,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7325 trivial. 0 not checked. [2025-03-16 19:43:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686271530] [2025-03-16 19:43:38,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686271530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:38,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604941209] [2025-03-16 19:43:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:38,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:38,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:38,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:38,217 INFO L87 Difference]: Start difference. First operand 786 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-16 19:43:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:39,333 INFO L93 Difference]: Finished difference Result 789 states and 1215 transitions. [2025-03-16 19:43:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:39,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 468 [2025-03-16 19:43:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:39,340 INFO L225 Difference]: With dead ends: 789 [2025-03-16 19:43:39,341 INFO L226 Difference]: Without dead ends: 647 [2025-03-16 19:43:39,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:39,343 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 777 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:39,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1962 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:43:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-16 19:43:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 646. [2025-03-16 19:43:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 416 states have (on average 1.4086538461538463) internal successors, (586), 421 states have internal predecessors, (586), 207 states have call successors, (207), 17 states have call predecessors, (207), 22 states have return successors, (224), 209 states have call predecessors, (224), 206 states have call successors, (224) [2025-03-16 19:43:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1017 transitions. [2025-03-16 19:43:39,409 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1017 transitions. Word has length 468 [2025-03-16 19:43:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1017 transitions. [2025-03-16 19:43:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-16 19:43:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1017 transitions. [2025-03-16 19:43:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-16 19:43:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:39,415 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 40, 40, 6, 5, 5, 5, 5, 5, 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] [2025-03-16 19:43:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:43:39,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:39,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash -256408832, now seen corresponding path program 1 times [2025-03-16 19:43:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712534967] [2025-03-16 19:43:39,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:39,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 19:43:39,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 19:43:39,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:39,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-03-16 19:43:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712534967] [2025-03-16 19:43:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712534967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032078298] [2025-03-16 19:43:40,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:40,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:40,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:40,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:41,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:43:42,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 19:43:42,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 19:43:42,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:42,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:42,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 4182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:42,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:42,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-16 19:43:42,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:43:42,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-16 19:43:42,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:43:42,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-16 19:43:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 1040 proven. 5 refuted. 0 times theorem prover too weak. 7147 trivial. 0 not checked. [2025-03-16 19:43:42,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-03-16 19:43:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032078298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:44,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-03-16 19:43:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645113217] [2025-03-16 19:43:44,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:44,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:43:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:44,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:43:44,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:43:44,252 INFO L87 Difference]: Start difference. First operand 646 states and 1017 transitions. Second operand has 14 states, 11 states have (on average 14.818181818181818) internal successors, (163), 14 states have internal predecessors, (163), 13 states have call successors, (127), 5 states have call predecessors, (127), 7 states have return successors, (126), 10 states have call predecessors, (126), 13 states have call successors, (126) [2025-03-16 19:43:48,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:52,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:56,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:00,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:04,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []