./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 10:58:42,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 10:58:43,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 10:58:43,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 10:58:43,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 10:58:43,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 10:58:43,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 10:58:43,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 10:58:43,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 10:58:43,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 10:58:43,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 10:58:43,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 10:58:43,074 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 10:58:43,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 10:58:43,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 10:58:43,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 10:58:43,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 10:58:43,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 10:58:43,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 10:58:43,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 10:58:43,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 10:58:43,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 10:58:43,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 10:58:43,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 10:58:43,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 10:58:43,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 10:58:43,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 10:58:43,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 10:58:43,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 10:58:43,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 10:58:43,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 10:58:43,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 10:58:43,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 10:58:43,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 10:58:43,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 10:58:43,089 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 10:58:43,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 10:58:43,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 10:58:43,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 10:58:43,089 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 10:58:43,090 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 10:58:43,090 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 10:58:43,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-14 10:58:43,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 10:58:43,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 10:58:43,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 10:58:43,400 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 10:58:43,401 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 10:58:43,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-08-14 10:58:43,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 10:58:43,489 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 10:58:43,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 10:58:45,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 10:58:45,310 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 10:58:45,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 10:58:45,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f832500a9/a79eb1b1b9c34298b71041cf88ed15c9/FLAGe8738c1a6 [2024-08-14 10:58:45,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f832500a9/a79eb1b1b9c34298b71041cf88ed15c9 [2024-08-14 10:58:45,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 10:58:45,338 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 10:58:45,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 10:58:45,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 10:58:45,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 10:58:45,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:58:43" (1/2) ... [2024-08-14 10:58:45,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1839cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 10:58:45, skipping insertion in model container [2024-08-14 10:58:45,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:58:43" (1/2) ... [2024-08-14 10:58:45,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e65a595 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 10:58:45, skipping insertion in model container [2024-08-14 10:58:45,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 10:58:45" (2/2) ... [2024-08-14 10:58:45,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1839cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45, skipping insertion in model container [2024-08-14 10:58:45,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 10:58:45" (2/2) ... [2024-08-14 10:58:45,351 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-14 10:58:45,378 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 10:58:45,379 INFO L97 edCorrectnessWitness]: Location invariant before [L706-L706] (0 <= top) && (top <= 64) [2024-08-14 10:58:45,380 INFO L97 edCorrectnessWitness]: Location invariant before [L713-L713] (0 <= top) && (top <= 64) [2024-08-14 10:58:45,425 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 10:58:45,774 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 10:58:45,788 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local [2024-08-14 10:58:45,886 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 10:58:45,938 INFO L206 MainTranslator]: Completed translation [2024-08-14 10:58:45,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45 WrapperNode [2024-08-14 10:58:45,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 10:58:45,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 10:58:45,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 10:58:45,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 10:58:45,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:45,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,026 INFO L138 Inliner]: procedures = 165, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 88 [2024-08-14 10:58:46,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 10:58:46,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 10:58:46,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 10:58:46,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 10:58:46,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 10:58:46,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 10:58:46,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 10:58:46,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 10:58:46,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (1/1) ... [2024-08-14 10:58:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 10:58:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:46,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-14 10:58:46,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-14 10:58:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-14 10:58:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-14 10:58:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-14 10:58:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-14 10:58:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-14 10:58:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 10:58:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-14 10:58:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 10:58:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 10:58:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-14 10:58:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 10:58:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 10:58:46,185 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 10:58:46,308 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 10:58:46,310 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 10:58:46,483 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 10:58:46,483 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 10:58:46,626 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 10:58:46,627 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-14 10:58:46,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 10:58:46 BoogieIcfgContainer [2024-08-14 10:58:46,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 10:58:46,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 10:58:46,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 10:58:46,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 10:58:46,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 10:58:43" (1/4) ... [2024-08-14 10:58:46,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc3aa10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 10:58:46, skipping insertion in model container [2024-08-14 10:58:46,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 10:58:45" (2/4) ... [2024-08-14 10:58:46,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc3aa10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 10:58:46, skipping insertion in model container [2024-08-14 10:58:46,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 10:58:45" (3/4) ... [2024-08-14 10:58:46,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc3aa10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 10:58:46, skipping insertion in model container [2024-08-14 10:58:46,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 10:58:46" (4/4) ... [2024-08-14 10:58:46,636 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 10:58:46,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 10:58:46,652 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-08-14 10:58:46,652 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 10:58:46,696 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 10:58:46,740 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 10:58:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:46,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 10:58:46,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-14 10:58:46,784 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 10:58:46,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-14 10:58:46,802 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:46,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-14 10:58:46,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:46,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -668037293, now seen corresponding path program 1 times [2024-08-14 10:58:46,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983024850] [2024-08-14 10:58:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983024850] [2024-08-14 10:58:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983024850] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-14 10:58:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915523099] [2024-08-14 10:58:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:47,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 10:58:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:47,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:47,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:47,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 10:58:47,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:47,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1381350171, now seen corresponding path program 1 times [2024-08-14 10:58:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:47,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140850390] [2024-08-14 10:58:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140850390] [2024-08-14 10:58:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140850390] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-14 10:58:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415439144] [2024-08-14 10:58:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:47,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:58:47,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:47,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:58:47,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:58:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:47,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:47,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:47,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:47,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:47,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 10:58:47,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:47,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 13987830, now seen corresponding path program 1 times [2024-08-14 10:58:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742223802] [2024-08-14 10:58:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742223802] [2024-08-14 10:58:48,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742223802] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:48,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:48,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 10:58:48,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739993546] [2024-08-14 10:58:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:48,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 10:58:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:48,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 10:58:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 10:58:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:48,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:48,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:48,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 10:58:48,300 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-14 10:58:48,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-14 10:58:48,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 10:58:48,311 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-14 10:58:48,314 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2024-08-14 10:58:48,317 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 10:58:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:48,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 10:58:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-08-14 10:58:48,328 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 10:58:48,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 10:58:48,330 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:48,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 10:58:48,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:48,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2033703473, now seen corresponding path program 1 times [2024-08-14 10:58:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129634678] [2024-08-14 10:58:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129634678] [2024-08-14 10:58:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129634678] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 10:58:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083044580] [2024-08-14 10:58:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:48,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 10:58:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:48,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:48,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 10:58:48,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:48,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 332627863, now seen corresponding path program 1 times [2024-08-14 10:58:48,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:48,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110763697] [2024-08-14 10:58:48,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110763697] [2024-08-14 10:58:48,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110763697] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:48,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 10:58:48,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138722857] [2024-08-14 10:58:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:48,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:58:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:58:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:58:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:48,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:48,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 10:58:48,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:48,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1829501561, now seen corresponding path program 1 times [2024-08-14 10:58:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080756105] [2024-08-14 10:58:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080756105] [2024-08-14 10:58:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080756105] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 10:58:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799687782] [2024-08-14 10:58:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:48,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 10:58:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 10:58:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 10:58:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:48,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:48,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:48,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:48,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:48,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 10:58:49,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 10:58:49,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 332628824, now seen corresponding path program 1 times [2024-08-14 10:58:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847311727] [2024-08-14 10:58:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:58:49,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 10:58:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:58:49,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 10:58:49,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 10:58:49,137 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 10:58:49,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 10:58:49,139 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 10:58:49,140 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-14 10:58:49,142 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 10:58:49,142 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-14 10:58:49,168 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 10:58:49,171 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 10:58:49,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:49,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 10:58:49,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-08-14 10:58:49,180 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 10:58:49,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 10:58:49,181 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:49,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 10:58:49,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:49,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash -200472334, now seen corresponding path program 1 times [2024-08-14 10:58:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:49,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884874730] [2024-08-14 10:58:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 10:58:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884874730] [2024-08-14 10:58:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884874730] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:49,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:49,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 10:58:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115636476] [2024-08-14 10:58:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 10:58:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:49,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:49,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:49,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 10:58:49,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:49,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -166562806, now seen corresponding path program 1 times [2024-08-14 10:58:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065180411] [2024-08-14 10:58:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065180411] [2024-08-14 10:58:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065180411] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558305736] [2024-08-14 10:58:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:49,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:49,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 10:58:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:49,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 10:58:49,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:49,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:49,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 10:58:49,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558305736] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:49,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 10:58:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 10:58:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374675370] [2024-08-14 10:58:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:49,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 10:58:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:49,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:49,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:49,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:49,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:49,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-08-14 10:58:50,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:50,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:50,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash 459031119, now seen corresponding path program 1 times [2024-08-14 10:58:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231183050] [2024-08-14 10:58:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 10:58:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231183050] [2024-08-14 10:58:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231183050] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 10:58:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359439826] [2024-08-14 10:58:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:50,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 10:58:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 10:58:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 10:58:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:50,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:50,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:50,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:50,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:50,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 10:58:50,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-14 10:58:50,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 10:58:50,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1337920240, now seen corresponding path program 1 times [2024-08-14 10:58:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:50,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397916931] [2024-08-14 10:58:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:58:50,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 10:58:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 10:58:50,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 10:58:50,416 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 10:58:50,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 10:58:50,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-14 10:58:50,418 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 10:58:50,418 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-14 10:58:50,418 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 10:58:50,418 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-14 10:58:50,452 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 10:58:50,454 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 10:58:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:50,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 10:58:50,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-14 10:58:50,476 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 10:58:50,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-14 10:58:50,477 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 10:58:50,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-14 10:58:50,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:50,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash 664010498, now seen corresponding path program 1 times [2024-08-14 10:58:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937261459] [2024-08-14 10:58:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:58:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937261459] [2024-08-14 10:58:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937261459] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:50,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 10:58:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 10:58:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263091561] [2024-08-14 10:58:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:50,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 10:58:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:50,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:50,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:50,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:50,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 10:58:50,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:50,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash -131979414, now seen corresponding path program 1 times [2024-08-14 10:58:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071628976] [2024-08-14 10:58:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071628976] [2024-08-14 10:58:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071628976] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144275645] [2024-08-14 10:58:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:51,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:51,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-14 10:58:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:51,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 10:58:51,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:51,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 10:58:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144275645] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:58:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 10:58:51,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 10:58:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44374313] [2024-08-14 10:58:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:58:51,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 10:58:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 10:58:51,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 10:58:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:51,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:51,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:51,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:51,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:51,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-14 10:58:52,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-14 10:58:52,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:52,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1283510008, now seen corresponding path program 1 times [2024-08-14 10:58:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:52,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853906955] [2024-08-14 10:58:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853906955] [2024-08-14 10:58:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853906955] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798034002] [2024-08-14 10:58:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:52,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-14 10:58:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:52,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-14 10:58:52,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 10:58:52,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:52,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:58:52,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:52,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 10:58:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798034002] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:58:52,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:58:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-14 10:58:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638002740] [2024-08-14 10:58:52,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:58:52,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 10:58:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 10:58:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-14 10:58:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:52,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:52,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:52,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:52,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:52,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:53,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-14 10:58:53,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-14 10:58:53,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:53,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1853449264, now seen corresponding path program 1 times [2024-08-14 10:58:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363373707] [2024-08-14 10:58:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363373707] [2024-08-14 10:58:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363373707] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499765506] [2024-08-14 10:58:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:53,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:53,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:53,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:53,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-14 10:58:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:54,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 10:58:54,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:54,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 10:58:54,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 10:58:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:54,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:58:54,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 10:58:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499765506] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:58:54,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:58:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 10:58:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388007575] [2024-08-14 10:58:54,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:58:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 10:58:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 10:58:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 10:58:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:54,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:54,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:54,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:54,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:54,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 10:58:55,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-14 10:58:55,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:55,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:55,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1067562403, now seen corresponding path program 1 times [2024-08-14 10:58:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839427857] [2024-08-14 10:58:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:58:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839427857] [2024-08-14 10:58:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839427857] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237302870] [2024-08-14 10:58:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:55,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:55,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-14 10:58:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:55,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 10:58:55,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:55,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:58:55,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:58:55,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:55,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 10:58:55,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:55,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 10:58:55,993 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 37 treesize of output 23 [2024-08-14 10:58:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 10:58:56,005 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 20 treesize of output 12 [2024-08-14 10:58:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:58:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237302870] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:58:56,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:58:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-14 10:58:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347784999] [2024-08-14 10:58:56,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:58:56,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 10:58:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:58:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 10:58:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-14 10:58:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:56,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:58:56,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:58:56,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:56,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:56,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:56,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-14 10:58:56,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:58:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 10:58:57,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-08-14 10:58:57,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-08-14 10:58:57,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:58:57,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:58:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1523311133, now seen corresponding path program 2 times [2024-08-14 10:58:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:58:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271110657] [2024-08-14 10:58:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:58:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:58:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:58:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:58:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271110657] [2024-08-14 10:58:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271110657] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:58:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126056764] [2024-08-14 10:58:58,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 10:58:58,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:58:58,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:58:58,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:58:58,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-14 10:58:58,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 10:58:58,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:58:58,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-14 10:58:58,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:58:58,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:58:58,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:58:58,374 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-14 10:58:58,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-08-14 10:58:58,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 10:58:58,562 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-08-14 10:58:58,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-08-14 10:58:58,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 10:58:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:58:58,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:58:58,682 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_3 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))) is different from false [2024-08-14 10:58:59,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 10:58:59,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:58:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 10:58:59,929 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 365 treesize of output 349 [2024-08-14 10:58:59,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 23 [2024-08-14 10:58:59,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 44 [2024-08-14 10:58:59,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2024-08-14 10:58:59,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 23 [2024-08-14 10:58:59,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 21 [2024-08-14 10:59:00,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-08-14 10:59:00,074 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 418 treesize of output 394 [2024-08-14 10:59:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-08-14 10:59:00,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-08-14 10:59:00,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 22 [2024-08-14 10:59:00,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2024-08-14 10:59:00,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 22 [2024-08-14 10:59:00,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 42 [2024-08-14 10:59:00,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 22 [2024-08-14 10:59:00,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2024-08-14 10:59:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:59:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126056764] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:59:00,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:59:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-08-14 10:59:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790552864] [2024-08-14 10:59:00,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:59:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-14 10:59:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:59:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-14 10:59:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=433, Unknown=3, NotChecked=44, Total=600 [2024-08-14 10:59:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:59:00,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:59:00,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:59:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:59:00,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:59:00,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 10:59:00,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:59:05,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 10:59:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:59:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 10:59:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-14 10:59:11,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-08-14 10:59:11,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-08-14 10:59:11,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 10:59:11,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:59:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 156225977, now seen corresponding path program 3 times [2024-08-14 10:59:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:59:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516019278] [2024-08-14 10:59:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:59:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:59:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:59:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:59:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:59:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516019278] [2024-08-14 10:59:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516019278] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:59:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277102131] [2024-08-14 10:59:11,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 10:59:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:59:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:59:11,795 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:59:11,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-14 10:59:11,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-14 10:59:11,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:59:11,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 10:59:11,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:59:11,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 10:59:11,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 10:59:12,042 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-08-14 10:59:12,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-08-14 10:59:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:59:12,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:59:12,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:59:12,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 10:59:13,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:59:13,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 468 [2024-08-14 10:59:13,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 261 treesize of output 253 [2024-08-14 10:59:13,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-08-14 10:59:13,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-08-14 10:59:13,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 119 [2024-08-14 10:59:13,288 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:59:13,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 212 [2024-08-14 10:59:13,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 176 treesize of output 168 [2024-08-14 10:59:13,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164 treesize of output 156 [2024-08-14 10:59:13,332 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 86 treesize of output 82 [2024-08-14 10:59:13,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:59:13,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2024-08-14 10:59:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:59:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277102131] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:59:13,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:59:13,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-08-14 10:59:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664269646] [2024-08-14 10:59:13,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:59:13,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-14 10:59:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:59:13,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-14 10:59:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=272, Unknown=1, NotChecked=0, Total=342 [2024-08-14 10:59:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:59:13,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:59:13,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-14 10:59:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:59:17,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:19,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:24,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:26,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:28,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:30,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:32,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:34,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:36,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:38,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:40,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:42,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:43,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (< c_~next_alloc_idx~0 65)) (.cse9 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse0 64) (or .cse1 (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_63 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_64 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (not (= (+ (select (select .cse2 v_prenex_63) v_prenex_64) 1) 0)) (< 0 (+ (select (select (store .cse2 v_prenex_63 v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_69 Int) (v_prenex_68 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (< (select (select (store .cse3 v_prenex_68 v_prenex_67) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select (select .cse3 v_prenex_68) v_prenex_69) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_66 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_65 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse4 (select .cse5 v_prenex_65))) (or (not (= (+ (select .cse4 v_prenex_66) 1) 0)) (< 0 (+ (select (select (store .cse5 v_prenex_65 (store .cse4 v_prenex_66 c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse7 (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< (select (select (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))) (<= 0 c_~top~0) (<= 0 .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse8 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (or (and (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))) .cse1) (or .cse1 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= .cse9 64) (<= 0 .cse9) (<= c_~top~0 64) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (select .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse14 (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< 0 (+ (select (select (store .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| (+ c_~next_alloc_idx~0 2))) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)) (not (= (+ (select .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))))) is different from false [2024-08-14 10:59:44,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (< c_~next_alloc_idx~0 65)) (.cse9 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse0 64) (or .cse1 (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_63 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_64 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (not (= (+ (select (select .cse2 v_prenex_63) v_prenex_64) 1) 0)) (< 0 (+ (select (select (store .cse2 v_prenex_63 v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_69 Int) (v_prenex_68 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (< (select (select (store .cse3 v_prenex_68 v_prenex_67) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select (select .cse3 v_prenex_68) v_prenex_69) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_66 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_65 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse4 (select .cse5 v_prenex_65))) (or (not (= (+ (select .cse4 v_prenex_66) 1) 0)) (< 0 (+ (select (select (store .cse5 v_prenex_65 (store .cse4 v_prenex_66 c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse7 (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< (select (select (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))) (<= 0 .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse8 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (or (and (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))) .cse1) (or .cse1 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= .cse9 64) (<= 0 .cse9) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (select .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse14 (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< 0 (+ (select (select (store .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| (+ c_~next_alloc_idx~0 2))) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)) (not (= (+ (select .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))))) is different from false [2024-08-14 10:59:46,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:48,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:50,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:52,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:54,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:56,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:59:58,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:06,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:08,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:12,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:14,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:16,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:18,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:21,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:23,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:25,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:27,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:29,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:31,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:33,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:35,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:42,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:44,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:56,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:00:58,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:00,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:02,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:06,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:09,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:12,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:14,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:28,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:01:30,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:02,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (< c_~next_alloc_idx~0 65)) (.cse8 (+ c_~next_alloc_idx~0 2))) (and (<= .cse0 64) (or .cse1 (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_63 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_64 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (not (= (+ (select (select .cse2 v_prenex_63) v_prenex_64) 1) 0)) (< 0 (+ (select (select (store .cse2 v_prenex_63 v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_69 Int) (v_prenex_68 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_67 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (or (< (select (select (store .cse3 v_prenex_68 v_prenex_67) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select (select .cse3 v_prenex_68) v_prenex_69) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_66 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_65 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse4 (select .cse5 v_prenex_65))) (or (not (= (+ (select .cse4 v_prenex_66) 1) 0)) (< 0 (+ (select (select (store .cse5 v_prenex_65 (store .cse4 v_prenex_66 c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse6 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (let ((.cse7 (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< (select (select (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))) (= 3 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)) (<= 0 .cse8) (= 3 c_~top~0) (<= c_~next_alloc_idx~0 60) (<= 0 .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (exists ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (= 5 (select (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (or (and (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))) .cse1) (or .cse1 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (or (not (= (+ 1 (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ 1 (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|)) 0)) (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (<= 0 (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (select .cse12 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse14 (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (< 0 (+ (select (select (store .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24| .cse8)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)) (not (= (+ (select .cse14 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_24|) 1) 0)))))))))) is different from false [2024-08-14 11:02:08,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 11:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 11:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 11:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-14 11:02:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-14 11:02:11,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-14 11:02:11,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-14 11:02:11,213 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:02:11,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:02:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash -715651170, now seen corresponding path program 2 times [2024-08-14 11:02:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:02:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868507783] [2024-08-14 11:02:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:02:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:02:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:02:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:02:11,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:02:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868507783] [2024-08-14 11:02:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868507783] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:02:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950193402] [2024-08-14 11:02:11,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 11:02:11,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:02:11,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:02:11,614 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:02:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-14 11:02:11,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 11:02:11,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 11:02:11,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-14 11:02:11,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:02:11,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:02:11,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:02:11,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:02:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:02:12,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:02:12,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:02:12,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 11:02:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:02:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950193402] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:02:13,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:02:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 11:02:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466744573] [2024-08-14 11:02:13,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:02:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 11:02:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:02:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 11:02:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 11:02:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:02:13,006 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:02:13,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:02:13,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-14 11:02:13,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:02:21,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:23,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:25,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:34,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:36,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:38,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:40,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:42,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:44,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:45,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:47,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:49,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:51,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:53,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:56,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:02:58,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:03:00,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:03:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 11:03:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 11:03:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 11:03:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-14 11:03:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-08-14 11:03:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 11:03:00,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-14 11:03:00,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-14 11:03:00,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-08-14 11:03:00,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:00,637 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-08-14 11:03:00,637 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE (1/4) [2024-08-14 11:03:00,639 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 11:03:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 11:03:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:00,641 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 11:03:00,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-08-14 11:03:00,645 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 11:03:00,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 11:03:00,646 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 11:03:00,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 11:03:00,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 11:03:00,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1836026810, now seen corresponding path program 1 times [2024-08-14 11:03:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436298148] [2024-08-14 11:03:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-14 11:03:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436298148] [2024-08-14 11:03:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436298148] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 11:03:00,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 11:03:00,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 11:03:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17810701] [2024-08-14 11:03:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 11:03:00,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 11:03:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 11:03:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 11:03:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:00,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:00,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:00,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:01,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-14 11:03:01,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 11:03:01,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2016813742, now seen corresponding path program 1 times [2024-08-14 11:03:01,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:01,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988374957] [2024-08-14 11:03:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 11:03:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988374957] [2024-08-14 11:03:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988374957] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960630719] [2024-08-14 11:03:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:01,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-14 11:03:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:01,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 11:03:01,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:01,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 11:03:01,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 11:03:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960630719] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 11:03:01,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 11:03:01,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 11:03:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676660116] [2024-08-14 11:03:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 11:03:01,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 11:03:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 11:03:01,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 11:03:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:01,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:01,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:01,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:01,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:01,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-08-14 11:03:02,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:02,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 11:03:02,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2066679584, now seen corresponding path program 1 times [2024-08-14 11:03:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804262687] [2024-08-14 11:03:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-14 11:03:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804262687] [2024-08-14 11:03:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804262687] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 11:03:02,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 11:03:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 11:03:02,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543162953] [2024-08-14 11:03:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 11:03:02,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 11:03:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:02,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 11:03:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 11:03:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:02,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:02,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:02,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:02,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:02,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 11:03:02,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-14 11:03:02,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 11:03:02,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1222207713, now seen corresponding path program 1 times [2024-08-14 11:03:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:02,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207625352] [2024-08-14 11:03:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 11:03:02,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 11:03:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 11:03:02,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 11:03:02,558 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 11:03:02,558 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 11:03:02,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-08-14 11:03:02,559 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 11:03:02,559 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-08-14 11:03:02,559 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 11:03:02,560 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-14 11:03:02,593 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 11:03:02,596 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 11:03:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 11:03:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:02,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 11:03:02,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-08-14 11:03:02,601 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 11:03:02,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-08-14 11:03:02,602 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1726aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 11:03:02,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-14 11:03:02,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:02,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash -819652850, now seen corresponding path program 1 times [2024-08-14 11:03:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:02,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631121098] [2024-08-14 11:03:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:03:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631121098] [2024-08-14 11:03:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631121098] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 11:03:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 11:03:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 11:03:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141037392] [2024-08-14 11:03:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 11:03:02,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 11:03:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 11:03:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 11:03:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:02,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:02,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:02,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:03,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-08-14 11:03:03,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:03,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1982552406, now seen corresponding path program 1 times [2024-08-14 11:03:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376009176] [2024-08-14 11:03:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376009176] [2024-08-14 11:03:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376009176] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966423215] [2024-08-14 11:03:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:03,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:03,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:03,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-14 11:03:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:03,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 11:03:03,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:03,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:03,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 11:03:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966423215] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 11:03:03,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 11:03:03,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 11:03:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157222304] [2024-08-14 11:03:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 11:03:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 11:03:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 11:03:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 11:03:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:03,447 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:03,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:03,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:03,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:04,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-14 11:03:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-08-14 11:03:05,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:05,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -284032524, now seen corresponding path program 1 times [2024-08-14 11:03:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525005597] [2024-08-14 11:03:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:05,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525005597] [2024-08-14 11:03:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525005597] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:05,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325468080] [2024-08-14 11:03:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:05,407 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-14 11:03:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:05,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-14 11:03:05,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:05,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:05,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:05,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:03:06,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:06,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 11:03:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:06,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325468080] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:03:06,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:03:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-14 11:03:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613397898] [2024-08-14 11:03:06,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:03:06,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 11:03:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:06,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 11:03:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-14 11:03:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:06,752 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:06,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:06,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:06,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:06,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:09,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-14 11:03:09,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-08-14 11:03:09,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:09,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1512170116, now seen corresponding path program 1 times [2024-08-14 11:03:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240479253] [2024-08-14 11:03:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240479253] [2024-08-14 11:03:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240479253] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187956973] [2024-08-14 11:03:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:10,257 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:10,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-08-14 11:03:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:10,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 11:03:10,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:10,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:10,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:10,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:10,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:03:11,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:11,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 11:03:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187956973] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:03:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:03:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 11:03:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297289081] [2024-08-14 11:03:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:03:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 11:03:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 11:03:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 11:03:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:11,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:11,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:11,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:11,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:11,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:15,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-08-14 11:03:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-14 11:03:15,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:15,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1540083890, now seen corresponding path program 1 times [2024-08-14 11:03:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082465187] [2024-08-14 11:03:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082465187] [2024-08-14 11:03:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082465187] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511980512] [2024-08-14 11:03:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:16,272 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-08-14 11:03:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:16,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-14 11:03:16,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:16,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 11:03:16,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:16,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:03:17,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-08-14 11:03:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511980512] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:03:17,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:03:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-14 11:03:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391659937] [2024-08-14 11:03:17,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:03:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 11:03:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 11:03:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-08-14 11:03:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:17,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:17,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:17,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:17,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:17,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:17,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:17,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 11:03:23,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-08-14 11:03:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-14 11:03:23,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -901772113, now seen corresponding path program 1 times [2024-08-14 11:03:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798708713] [2024-08-14 11:03:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:03:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798708713] [2024-08-14 11:03:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798708713] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675313285] [2024-08-14 11:03:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:23,983 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:23,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-08-14 11:03:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:24,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 11:03:24,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:24,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:03:24,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:03:24,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:24,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 11:03:24,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:24,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 11:03:24,916 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 37 treesize of output 23 [2024-08-14 11:03:24,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 11:03:24,951 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 20 treesize of output 12 [2024-08-14 11:03:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 11:03:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675313285] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:03:25,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:03:25,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-14 11:03:25,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129062606] [2024-08-14 11:03:25,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:03:25,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 11:03:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 11:03:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-14 11:03:25,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:25,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:25,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 11:03:25,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 11:03:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 11:03:35,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-08-14 11:03:35,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-08-14 11:03:35,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:03:35,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:03:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1676550417, now seen corresponding path program 2 times [2024-08-14 11:03:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:03:35,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23084194] [2024-08-14 11:03:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:03:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:03:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:03:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:03:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23084194] [2024-08-14 11:03:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23084194] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:03:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518404038] [2024-08-14 11:03:36,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 11:03:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:03:36,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:03:36,291 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:03:36,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-08-14 11:03:36,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 11:03:36,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 11:03:36,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-14 11:03:36,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:03:36,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 11:03:36,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:03:36,767 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-14 11:03:36,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-08-14 11:03:36,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 11:03:37,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 11:03:37,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 11:03:37,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 11:03:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:37,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:03:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:39,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 11:03:39,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:03:39,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 11:03:39,780 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 299 treesize of output 281 [2024-08-14 11:03:39,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 131 treesize of output 129 [2024-08-14 11:03:39,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 135 treesize of output 129 [2024-08-14 11:03:39,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 125 treesize of output 121 [2024-08-14 11:03:39,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 117 [2024-08-14 11:03:39,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 117 treesize of output 115 [2024-08-14 11:03:40,337 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 327 treesize of output 307 [2024-08-14 11:03:40,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 13 [2024-08-14 11:03:40,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-08-14 11:03:40,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 44 [2024-08-14 11:03:40,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2024-08-14 11:03:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:03:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518404038] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 11:03:41,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 11:03:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 28 [2024-08-14 11:03:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788994155] [2024-08-14 11:03:41,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 11:03:41,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-14 11:03:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 11:03:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-14 11:03:41,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=691, Unknown=6, NotChecked=0, Total=870 [2024-08-14 11:03:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:03:41,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 11:03:41,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 11:03:41,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:41,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:03:41,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:03:41,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:03:41,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 11:03:41,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 11:03:41,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 11:04:00,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 11:04:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 11:04:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 11:04:16,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-08-14 11:04:17,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:04:17,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-14 11:04:17,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 11:04:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1811831340, now seen corresponding path program 1 times [2024-08-14 11:04:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 11:04:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535087955] [2024-08-14 11:04:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:04:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 11:04:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:04:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:04:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 11:04:18,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535087955] [2024-08-14 11:04:18,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535087955] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 11:04:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297780679] [2024-08-14 11:04:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 11:04:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 11:04:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 11:04:18,185 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 11:04:18,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-08-14 11:04:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 11:04:18,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-14 11:04:18,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 11:04:18,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 11:04:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 11:04:18,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 11:04:18,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 11:04:19,210 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-08-14 11:04:19,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 46 [2024-08-14 11:04:19,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 11:04:19,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-14 11:04:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 11:04:19,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 11:04:19,994 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-08-14 11:04:21,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:21,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 11:04:21,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:21,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 11:04:22,474 INFO L349 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2024-08-14 11:04:22,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1359 treesize of output 1398 [2024-08-14 11:04:22,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 363 treesize of output 361 [2024-08-14 11:04:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 361 treesize of output 357 [2024-08-14 11:04:22,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 357 treesize of output 349 [2024-08-14 11:04:22,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 349 treesize of output 347 [2024-08-14 11:04:22,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 347 treesize of output 343 [2024-08-14 11:04:22,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 343 treesize of output 335 [2024-08-14 11:04:26,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 11:04:26,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-08-14 11:04:26,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-08-14 11:04:26,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 11:04:27,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-08-14 11:04:27,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-08-14 11:04:28,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:28,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-08-14 11:04:29,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:29,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-08-14 11:04:29,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 11:04:30,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:30,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-08-14 11:04:30,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-08-14 11:04:30,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 11:04:30,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 Killed by 15