./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 06:34:49,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:49,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:34:49,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:49,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:49,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:49,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:49,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:49,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:49,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:49,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:49,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:49,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:49,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:49,804 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:49,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:49,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:49,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:49,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:49,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:49,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:49,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:49,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:49,806 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-08 06:34:50,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:50,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:50,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:50,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:50,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:50,060 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-08 06:34:51,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6064d525f/33addbc903664fa396fa301052b2bf11/FLAG3eaae4375 [2025-03-08 06:34:51,582 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:51,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-03-08 06:34:51,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6064d525f/33addbc903664fa396fa301052b2bf11/FLAG3eaae4375 [2025-03-08 06:34:51,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6064d525f/33addbc903664fa396fa301052b2bf11 [2025-03-08 06:34:51,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:51,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:51,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:51,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:51,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:51,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:51" (1/1) ... [2025-03-08 06:34:51,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454a70ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:51, skipping insertion in model container [2025-03-08 06:34:51,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:51" (1/1) ... [2025-03-08 06:34:51,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:52,211 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-08 06:34:52,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:52,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:52,397 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-08 06:34:52,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:52,527 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:52,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52 WrapperNode [2025-03-08 06:34:52,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:52,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:52,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:52,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:52,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,641 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-03-08 06:34:52,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:52,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:52,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:52,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:52,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,703 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [6, 2, 41, 8, 0, 50, 8, 113, 8, 20, 12, 82, 8, 8, 3, 8, 7, 3, 7, 3]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [2, 2, 0, 3, 0, 0, 3, 46, 3, 6, 6, 40, 2, 2, 0, 2, 0, 0, 0, 0]. The 94 writes are split as follows [2, 0, 1, 2, 0, 4, 2, 33, 2, 8, 3, 21, 4, 4, 1, 3, 1, 1, 1, 1]. [2025-03-08 06:34:52,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:52,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:52,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:52,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:52,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (1/1) ... [2025-03-08 06:34:52,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:52,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:52,830 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-08 06:34:52,833 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-08 06:34:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-03-08 06:34:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-08 06:34:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-08 06:34:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 06:34:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:34:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:34:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 06:34:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:53,109 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:53,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:53,160 INFO L1307 $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-08 06:34:53,160 INFO L1307 $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-08 06:34:53,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,160 INFO L1307 $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-08 06:34:53,160 INFO L1307 $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-08 06:34:53,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,634 INFO L1307 $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-08 06:34:53,635 INFO L1307 $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-08 06:34:53,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,635 INFO L1307 $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-08 06:34:53,635 INFO L1307 $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-08 06:34:53,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,635 INFO L1307 $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-08 06:34:53,635 INFO L1307 $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-08 06:34:53,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,635 INFO L1307 $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-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $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-08 06:34:53,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,637 INFO L1307 $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-08 06:34:53,637 INFO L1307 $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-08 06:34:53,637 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:53,637 INFO L1307 $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-08 06:34:53,637 INFO L1307 $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-08 06:34:53,637 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:58,195 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-08 06:34:58,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:34:58,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:34:58,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:34:58,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:58 BoogieIcfgContainer [2025-03-08 06:34:58,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:34:58,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:34:58,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:34:58,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:34:58,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:51" (1/3) ... [2025-03-08 06:34:58,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684077ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:58, skipping insertion in model container [2025-03-08 06:34:58,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:52" (2/3) ... [2025-03-08 06:34:58,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684077ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:58, skipping insertion in model container [2025-03-08 06:34:58,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:58" (3/3) ... [2025-03-08 06:34:58,221 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-03-08 06:34:58,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:34:58,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 336 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 06:34:58,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:34:58,292 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;@1100dd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:34:58,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:34:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 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-08 06:34:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 06:34:58,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:58,317 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] [2025-03-08 06:34:58,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1287243078, now seen corresponding path program 1 times [2025-03-08 06:34:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282090392] [2025-03-08 06:34:58,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:58,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 06:34:58,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 06:34:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:59,505 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-08 06:34:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282090392] [2025-03-08 06:34:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282090392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:59,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:59,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137425649] [2025-03-08 06:34:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:59,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:59,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:59,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:59,533 INFO L87 Difference]: Start difference. First operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 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.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 06:35:03,590 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-08 06:35:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:03,738 INFO L93 Difference]: Finished difference Result 667 states and 1212 transitions. [2025-03-08 06:35:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 325 [2025-03-08 06:35:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:03,751 INFO L225 Difference]: With dead ends: 667 [2025-03-08 06:35:03,751 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 06:35:03,760 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-08 06:35:03,765 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 6 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1065 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-08 06:35:03,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1065 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 06:35:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 06:35:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-03-08 06:35:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 189 states have (on average 1.4550264550264551) internal successors, (275), 191 states have internal predecessors, (275), 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-08 06:35:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 536 transitions. [2025-03-08 06:35:03,842 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 536 transitions. Word has length 325 [2025-03-08 06:35:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:03,844 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 536 transitions. [2025-03-08 06:35:03,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 06:35:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 536 transitions. [2025-03-08 06:35:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 06:35:03,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:03,869 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] [2025-03-08 06:35:03,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:35:03,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 839483146, now seen corresponding path program 1 times [2025-03-08 06:35:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287930271] [2025-03-08 06:35:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:04,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 06:35:04,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 06:35:04,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:04,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:04,458 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-08 06:35:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287930271] [2025-03-08 06:35:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287930271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:04,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711213031] [2025-03-08 06:35:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:04,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:04,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:04,463 INFO L87 Difference]: Start difference. First operand 330 states and 536 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-08 06:35:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:04,527 INFO L93 Difference]: Finished difference Result 660 states and 1075 transitions. [2025-03-08 06:35:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:04,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 329 [2025-03-08 06:35:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:04,534 INFO L225 Difference]: With dead ends: 660 [2025-03-08 06:35:04,534 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 06:35:04,539 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-08 06:35:04,539 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:04,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 06:35:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-08 06:35:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 192 states have (on average 1.4479166666666667) internal successors, (278), 194 states have internal predecessors, (278), 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-08 06:35:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 539 transitions. [2025-03-08 06:35:04,578 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 539 transitions. Word has length 329 [2025-03-08 06:35:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:04,578 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 539 transitions. [2025-03-08 06:35:04,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-08 06:35:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 539 transitions. [2025-03-08 06:35:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-08 06:35:04,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:04,583 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, 1] [2025-03-08 06:35:04,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:35:04,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:04,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash -878384287, now seen corresponding path program 1 times [2025-03-08 06:35:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:04,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507290848] [2025-03-08 06:35:04,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:05,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-08 06:35:05,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-08 06:35:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:05,387 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-08 06:35:05,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507290848] [2025-03-08 06:35:05,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507290848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506953819] [2025-03-08 06:35:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:05,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:05,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:05,392 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-08 06:35:05,397 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-08 06:35:06,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-08 06:35:06,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-08 06:35:06,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:06,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:06,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:06,303 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-08 06:35:06,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:06,785 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-08 06:35:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506953819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 06:35:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711390762] [2025-03-08 06:35:06,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:06,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:06,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:06,791 INFO L87 Difference]: Start difference. First operand 333 states and 539 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-08 06:35:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:06,918 INFO L93 Difference]: Finished difference Result 670 states and 1089 transitions. [2025-03-08 06:35:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 332 [2025-03-08 06:35:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:06,922 INFO L225 Difference]: With dead ends: 670 [2025-03-08 06:35:06,922 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 06:35:06,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:06,926 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:35:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 06:35:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-08 06:35:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 201 states have internal predecessors, (285), 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-08 06:35:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 546 transitions. [2025-03-08 06:35:06,949 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 546 transitions. Word has length 332 [2025-03-08 06:35:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 546 transitions. [2025-03-08 06:35:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-08 06:35:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 546 transitions. [2025-03-08 06:35:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-08 06:35:06,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:06,954 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, 1] [2025-03-08 06:35:06,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:07,159 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-08 06:35:07,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:07,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1785173654, now seen corresponding path program 2 times [2025-03-08 06:35:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931874126] [2025-03-08 06:35:07,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:07,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 339 statements into 2 equivalence classes. [2025-03-08 06:35:07,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 339 statements. [2025-03-08 06:35:07,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:07,926 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-08 06:35:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931874126] [2025-03-08 06:35:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931874126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:07,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:07,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121778752] [2025-03-08 06:35:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:07,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:07,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:07,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:07,928 INFO L87 Difference]: Start difference. First operand 340 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 06:35:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:08,148 INFO L93 Difference]: Finished difference Result 667 states and 1079 transitions. [2025-03-08 06:35:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:35:08,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 339 [2025-03-08 06:35:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:08,155 INFO L225 Difference]: With dead ends: 667 [2025-03-08 06:35:08,155 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 06:35:08,156 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-08 06:35:08,156 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 416 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2146 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-08 06:35:08,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:35:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 06:35:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2025-03-08 06:35:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 381 states have (on average 1.4383202099737533) internal successors, (548), 384 states have internal predecessors, (548), 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-08 06:35:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1075 transitions. [2025-03-08 06:35:08,196 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1075 transitions. Word has length 339 [2025-03-08 06:35:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1075 transitions. [2025-03-08 06:35:08,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 06:35:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1075 transitions. [2025-03-08 06:35:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-08 06:35:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:08,203 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, 1] [2025-03-08 06:35:08,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:08,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:08,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682201, now seen corresponding path program 1 times [2025-03-08 06:35:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300681363] [2025-03-08 06:35:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 06:35:08,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 06:35:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:08,840 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-08 06:35:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300681363] [2025-03-08 06:35:08,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300681363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:08,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759670435] [2025-03-08 06:35:08,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:08,843 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-08 06:35:08,844 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-08 06:35:09,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 06:35:09,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 06:35:09,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:09,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:09,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:35:09,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:09,854 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-08 06:35:09,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:10,459 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-08 06:35:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759670435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:10,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 06:35:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113847054] [2025-03-08 06:35:10,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:35:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:35:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:35:10,461 INFO L87 Difference]: Start difference. First operand 662 states and 1075 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-08 06:35:15,172 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-08 06:35:19,184 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-08 06:35:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:19,249 INFO L93 Difference]: Finished difference Result 1361 states and 2217 transitions. [2025-03-08 06:35:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:35:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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 344 [2025-03-08 06:35:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:19,255 INFO L225 Difference]: With dead ends: 1361 [2025-03-08 06:35:19,256 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 06:35:19,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 06:35:19,259 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 29 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:19,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3691 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 46 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-08 06:35:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 06:35:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-08 06:35:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4038004750593824) internal successors, (591), 424 states have internal predecessors, (591), 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-08 06:35:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1118 transitions. [2025-03-08 06:35:19,307 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1118 transitions. Word has length 344 [2025-03-08 06:35:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:19,307 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1118 transitions. [2025-03-08 06:35:19,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-08 06:35:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1118 transitions. [2025-03-08 06:35:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-08 06:35:19,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:19,314 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, 1] [2025-03-08 06:35:19,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:19,514 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-08 06:35:19,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:19,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash 495526237, now seen corresponding path program 2 times [2025-03-08 06:35:19,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:19,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151263100] [2025-03-08 06:35:19,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:19,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:19,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-03-08 06:35:19,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 384 statements. [2025-03-08 06:35:19,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,223 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-08 06:35:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151263100] [2025-03-08 06:35:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151263100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869441577] [2025-03-08 06:35:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:20,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:20,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:20,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:20,226 INFO L87 Difference]: Start difference. First operand 702 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-08 06:35:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:20,264 INFO L93 Difference]: Finished difference Result 1338 states and 2156 transitions. [2025-03-08 06:35:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 384 [2025-03-08 06:35:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:20,271 INFO L225 Difference]: With dead ends: 1338 [2025-03-08 06:35:20,271 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 06:35:20,273 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-08 06:35:20,275 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1064 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:20,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1064 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 06:35:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-08 06:35:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4014251781472684) internal successors, (590), 424 states have internal predecessors, (590), 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-08 06:35:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1117 transitions. [2025-03-08 06:35:20,316 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1117 transitions. Word has length 384 [2025-03-08 06:35:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1117 transitions. [2025-03-08 06:35:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-08 06:35:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1117 transitions. [2025-03-08 06:35:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 06:35:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:20,322 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, 1] [2025-03-08 06:35:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:20,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:20,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 662805287, now seen corresponding path program 1 times [2025-03-08 06:35:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964671164] [2025-03-08 06:35:20,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 06:35:20,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 06:35:20,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:20,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:21,835 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-08 06:35:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964671164] [2025-03-08 06:35:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964671164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348532448] [2025-03-08 06:35:21,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:21,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:21,840 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-08 06:35:21,841 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-08 06:35:22,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 06:35:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 06:35:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:22,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:35:22,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:22,944 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-08 06:35:22,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:23,622 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-08 06:35:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348532448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:23,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-08 06:35:23,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579784026] [2025-03-08 06:35:23,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:23,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:35:23,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:23,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:35:23,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:35:23,624 INFO L87 Difference]: Start difference. First operand 702 states and 1117 transitions. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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-08 06:35:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:23,888 INFO L93 Difference]: Finished difference Result 1430 states and 2299 transitions. [2025-03-08 06:35:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 06:35:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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 404 [2025-03-08 06:35:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:23,896 INFO L225 Difference]: With dead ends: 1430 [2025-03-08 06:35:23,896 INFO L226 Difference]: Without dead ends: 742 [2025-03-08 06:35:23,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 796 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:35:23,900 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:23,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2634 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:35:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-08 06:35:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-08 06:35:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 461 states have (on average 1.3665943600867678) internal successors, (630), 464 states have internal predecessors, (630), 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-08 06:35:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1157 transitions. [2025-03-08 06:35:23,939 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1157 transitions. Word has length 404 [2025-03-08 06:35:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1157 transitions. [2025-03-08 06:35:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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-08 06:35:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1157 transitions. [2025-03-08 06:35:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 06:35:23,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:23,947 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, 1] [2025-03-08 06:35:23,960 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-08 06:35:24,147 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-08 06:35:24,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2058133118, now seen corresponding path program 1 times [2025-03-08 06:35:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63020232] [2025-03-08 06:35:24,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 06:35:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 06:35:24,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:24,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:25,656 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-08 06:35:25,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63020232] [2025-03-08 06:35:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63020232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538672750] [2025-03-08 06:35:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:25,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:25,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:25,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:25,657 INFO L87 Difference]: Start difference. First operand 742 states and 1157 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-08 06:35:29,695 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-08 06:35:33,707 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-08 06:35:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:35,199 INFO L93 Difference]: Finished difference Result 2040 states and 3289 transitions. [2025-03-08 06:35:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 445 [2025-03-08 06:35:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:35,208 INFO L225 Difference]: With dead ends: 2040 [2025-03-08 06:35:35,208 INFO L226 Difference]: Without dead ends: 1397 [2025-03-08 06:35:35,211 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-08 06:35:35,212 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 684 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1674 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-08 06:35:35,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1674 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-03-08 06:35:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-03-08 06:35:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 748. [2025-03-08 06:35:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 465 states have (on average 1.3634408602150538) internal successors, (634), 470 states have internal predecessors, (634), 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-08 06:35:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1167 transitions. [2025-03-08 06:35:35,281 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1167 transitions. Word has length 445 [2025-03-08 06:35:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1167 transitions. [2025-03-08 06:35:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-08 06:35:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1167 transitions. [2025-03-08 06:35:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 06:35:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:35,285 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-08 06:35:35,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:35:35,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:35,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -656570457, now seen corresponding path program 2 times [2025-03-08 06:35:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:35,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874462515] [2025-03-08 06:35:35,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:35,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 444 statements into 2 equivalence classes. [2025-03-08 06:35:36,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 06:35:36,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 06:35:36,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:37,590 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-08 06:35:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:37,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874462515] [2025-03-08 06:35:37,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874462515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:37,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:37,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602596677] [2025-03-08 06:35:37,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:37,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:37,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:37,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:37,593 INFO L87 Difference]: Start difference. First operand 748 states and 1167 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:38,910 INFO L93 Difference]: Finished difference Result 783 states and 1214 transitions. [2025-03-08 06:35:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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 444 [2025-03-08 06:35:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:38,916 INFO L225 Difference]: With dead ends: 783 [2025-03-08 06:35:38,916 INFO L226 Difference]: Without dead ends: 781 [2025-03-08 06:35:38,917 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-08 06:35:38,917 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 597 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:38,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 2034 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:35:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-08 06:35:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 775. [2025-03-08 06:35:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 483 states have (on average 1.3581780538302277) internal successors, (656), 488 states have internal predecessors, (656), 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-08 06:35:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1206 transitions. [2025-03-08 06:35:38,992 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1206 transitions. Word has length 444 [2025-03-08 06:35:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:38,992 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1206 transitions. [2025-03-08 06:35:38,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1206 transitions. [2025-03-08 06:35:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-08 06:35:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:38,997 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, 1] [2025-03-08 06:35:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:35:38,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 201309244, now seen corresponding path program 1 times [2025-03-08 06:35:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47388983] [2025-03-08 06:35:38,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-08 06:35:39,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-08 06:35:39,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:39,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:40,642 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-08 06:35:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47388983] [2025-03-08 06:35:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47388983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:35:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930421100] [2025-03-08 06:35:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:40,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:40,645 INFO L87 Difference]: Start difference. First operand 775 states and 1206 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 06:35:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:42,568 INFO L93 Difference]: Finished difference Result 784 states and 1213 transitions. [2025-03-08 06:35:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) Word has length 449 [2025-03-08 06:35:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:42,575 INFO L225 Difference]: With dead ends: 784 [2025-03-08 06:35:42,575 INFO L226 Difference]: Without dead ends: 782 [2025-03-08 06:35:42,576 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-08 06:35:42,577 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 710 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:42,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2336 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 06:35:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-08 06:35:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 779. [2025-03-08 06:35:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 486 states have (on average 1.3559670781893005) internal successors, (659), 491 states have internal predecessors, (659), 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-08 06:35:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2025-03-08 06:35:42,661 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 449 [2025-03-08 06:35:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:42,663 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2025-03-08 06:35:42,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 06:35:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2025-03-08 06:35:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-08 06:35:42,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:42,669 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, 1] [2025-03-08 06:35:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:35:42,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 943916295, now seen corresponding path program 1 times [2025-03-08 06:35:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:42,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498298394] [2025-03-08 06:35:42,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:42,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 06:35:43,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 06:35:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:43,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:44,267 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-08 06:35:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498298394] [2025-03-08 06:35:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498298394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272299528] [2025-03-08 06:35:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:44,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:44,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:44,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:44,269 INFO L87 Difference]: Start difference. First operand 779 states and 1209 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:45,213 INFO L93 Difference]: Finished difference Result 788 states and 1216 transitions. [2025-03-08 06:35:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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 454 [2025-03-08 06:35:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:45,218 INFO L225 Difference]: With dead ends: 788 [2025-03-08 06:35:45,218 INFO L226 Difference]: Without dead ends: 786 [2025-03-08 06:35:45,218 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-08 06:35:45,219 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 595 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2031 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:45,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2031 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:35:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-08 06:35:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 783. [2025-03-08 06:35:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 489 states have (on average 1.3537832310838447) internal successors, (662), 494 states have internal predecessors, (662), 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-08 06:35:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1212 transitions. [2025-03-08 06:35:45,265 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1212 transitions. Word has length 454 [2025-03-08 06:35:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1212 transitions. [2025-03-08 06:35:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1212 transitions. [2025-03-08 06:35:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 06:35:45,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:45,272 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, 1] [2025-03-08 06:35:45,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:35:45,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:45,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1964469084, now seen corresponding path program 1 times [2025-03-08 06:35:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858158952] [2025-03-08 06:35:45,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:45,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 06:35:46,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 06:35:46,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:46,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:46,899 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-08 06:35:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858158952] [2025-03-08 06:35:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858158952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721423060] [2025-03-08 06:35:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:46,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:46,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:46,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:46,901 INFO L87 Difference]: Start difference. First operand 783 states and 1212 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-08 06:35:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:47,896 INFO L93 Difference]: Finished difference Result 792 states and 1219 transitions. [2025-03-08 06:35:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:47,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 459 [2025-03-08 06:35:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:47,901 INFO L225 Difference]: With dead ends: 792 [2025-03-08 06:35:47,901 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 06:35:47,902 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-08 06:35:47,902 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 594 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:47,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2041 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:35:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 06:35:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 787. [2025-03-08 06:35:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 492 states have (on average 1.3516260162601625) internal successors, (665), 497 states have internal predecessors, (665), 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-08 06:35:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1215 transitions. [2025-03-08 06:35:47,949 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1215 transitions. Word has length 459 [2025-03-08 06:35:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:47,950 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1215 transitions. [2025-03-08 06:35:47,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-08 06:35:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1215 transitions. [2025-03-08 06:35:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 06:35:47,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:47,954 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, 1] [2025-03-08 06:35:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:35:47,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1140745625, now seen corresponding path program 1 times [2025-03-08 06:35:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849108154] [2025-03-08 06:35:47,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:48,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 06:35:48,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 06:35:48,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:48,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:49,519 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-08 06:35:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849108154] [2025-03-08 06:35:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849108154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:49,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:49,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:35:49,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777858508] [2025-03-08 06:35:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:49,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:49,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:49,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:49,520 INFO L87 Difference]: Start difference. First operand 787 states and 1215 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 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-08 06:35:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:51,171 INFO L93 Difference]: Finished difference Result 796 states and 1222 transitions. [2025-03-08 06:35:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:51,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 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 464 [2025-03-08 06:35:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:51,176 INFO L225 Difference]: With dead ends: 796 [2025-03-08 06:35:51,176 INFO L226 Difference]: Without dead ends: 792 [2025-03-08 06:35:51,176 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-08 06:35:51,177 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 903 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:51,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2174 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:35:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-08 06:35:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 789. [2025-03-08 06:35:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 494 states have (on average 1.3481781376518218) internal successors, (666), 498 states have internal predecessors, (666), 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-08 06:35:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1216 transitions. [2025-03-08 06:35:51,250 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1216 transitions. Word has length 464 [2025-03-08 06:35:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:51,251 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1216 transitions. [2025-03-08 06:35:51,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 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-08 06:35:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1216 transitions. [2025-03-08 06:35:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 06:35:51,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:51,254 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, 1] [2025-03-08 06:35:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:35:51,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2110063228, now seen corresponding path program 1 times [2025-03-08 06:35:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113155313] [2025-03-08 06:35:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 06:35:51,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 06:35:51,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:51,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:52,397 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-08 06:35:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113155313] [2025-03-08 06:35:52,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113155313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:52,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:52,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:52,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718908672] [2025-03-08 06:35:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:52,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:52,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:52,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:52,399 INFO L87 Difference]: Start difference. First operand 789 states and 1216 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:53,506 INFO L93 Difference]: Finished difference Result 792 states and 1218 transitions. [2025-03-08 06:35:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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 469 [2025-03-08 06:35:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:53,510 INFO L225 Difference]: With dead ends: 792 [2025-03-08 06:35:53,510 INFO L226 Difference]: Without dead ends: 650 [2025-03-08 06:35:53,511 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-08 06:35:53,511 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 589 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:53,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 2062 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:35:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-08 06:35:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2025-03-08 06:35:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 419 states have (on average 1.405727923627685) internal successors, (589), 424 states have internal predecessors, (589), 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-08 06:35:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1020 transitions. [2025-03-08 06:35:53,553 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1020 transitions. Word has length 469 [2025-03-08 06:35:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:53,553 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1020 transitions. [2025-03-08 06:35:53,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 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-08 06:35:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1020 transitions. [2025-03-08 06:35:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-08 06:35:53,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:53,557 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, 1] [2025-03-08 06:35:53,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:35:53,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 701566841, now seen corresponding path program 1 times [2025-03-08 06:35:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330580610] [2025-03-08 06:35:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-08 06:35:54,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-08 06:35:54,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:54,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:55,037 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-08 06:35:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330580610] [2025-03-08 06:35:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330580610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657539851] [2025-03-08 06:35:55,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:55,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:55,040 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-08 06:35:55,041 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-08 06:35:56,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-08 06:35:56,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-08 06:35:56,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:56,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:56,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 4179 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:35:56,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 691 proven. 0 refuted. 0 times theorem prover too weak. 7501 trivial. 0 not checked. [2025-03-08 06:35:57,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:35:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657539851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:35:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2025-03-08 06:35:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140382291] [2025-03-08 06:35:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:57,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:57,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:35:57,606 INFO L87 Difference]: Start difference. First operand 649 states and 1020 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-08 06:36:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:01,948 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2025-03-08 06:36:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:36:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 506 [2025-03-08 06:36:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:01,953 INFO L225 Difference]: With dead ends: 1430 [2025-03-08 06:36:01,954 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 06:36:01,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:36:01,957 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 692 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:01,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1121 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 06:36:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 06:36:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 860. [2025-03-08 06:36:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 549 states have (on average 1.3205828779599271) internal successors, (725), 549 states have internal predecessors, (725), 273 states have call successors, (273), 26 states have call predecessors, (273), 37 states have return successors, (309), 286 states have call predecessors, (309), 272 states have call successors, (309) [2025-03-08 06:36:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1307 transitions. [2025-03-08 06:36:02,059 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1307 transitions. Word has length 506 [2025-03-08 06:36:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:02,059 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1307 transitions. [2025-03-08 06:36:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-08 06:36:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1307 transitions. [2025-03-08 06:36:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-08 06:36:02,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:02,066 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, 1] [2025-03-08 06:36:02,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:36:02,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 06:36:02,267 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 120443833, now seen corresponding path program 1 times [2025-03-08 06:36:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851759438] [2025-03-08 06:36:02,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:02,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-08 06:36:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-08 06:36:02,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:02,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:03,849 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-08 06:36:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851759438] [2025-03-08 06:36:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851759438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159690425] [2025-03-08 06:36:03,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:03,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:03,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:03,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:36:03,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:36:04,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-08 06:36:05,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-08 06:36:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:05,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 4194 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:36:05,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:05,907 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 25 treesize of output 13 [2025-03-08 06:36:05,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 06:36:06,068 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-08 06:36:06,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:07,037 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-08 06:36:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159690425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:36:07,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:36:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 06:36:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897198040] [2025-03-08 06:36:07,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:36:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:07,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:36:07,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:36:07,039 INFO L87 Difference]: Start difference. First operand 860 states and 1307 transitions. Second operand has 9 states, 7 states have (on average 18.857142857142858) internal successors, (132), 9 states have internal predecessors, (132), 9 states have call successors, (118), 4 states have call predecessors, (118), 5 states have return successors, (117), 7 states have call predecessors, (117), 9 states have call successors, (117) [2025-03-08 06:36:11,085 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 []