./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 --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-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/mutex-meet-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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-13 22:32:18,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-13 22:32:18,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-13 22:32:18,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-13 22:32:18,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-13 22:32:18,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-13 22:32:18,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-13 22:32:18,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-13 22:32:18,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-13 22:32:18,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-13 22:32:18,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-13 22:32:18,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-13 22:32:18,814 INFO L153 SettingsManager]: * Use SBE=true [2024-08-13 22:32:18,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-13 22:32:18,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-13 22:32:18,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-13 22:32:18,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-13 22:32:18,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-13 22:32:18,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-13 22:32:18,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-13 22:32:18,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-13 22:32:18,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-13 22:32:18,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-13 22:32:18,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-13 22:32:18,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-13 22:32:18,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-13 22:32:18,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-13 22:32:18,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-13 22:32:18,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-13 22:32:18,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-13 22:32:18,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 22:32:18,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-13 22:32:18,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-13 22:32:18,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-13 22:32:18,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-13 22:32:18,824 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-13 22:32:18,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-13 22:32:18,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-13 22:32:18,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-13 22:32:18,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-13 22:32:18,825 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-13 22:32:18,827 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-13 22:32:18,827 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 [2024-08-13 22:32:19,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-13 22:32:19,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-13 22:32:19,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-13 22:32:19,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-13 22:32:19,053 INFO L274 PluginConnector]: CDTParser initialized [2024-08-13 22:32:19,054 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-13 22:32:20,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-13 22:32:20,432 INFO L384 CDTParser]: Found 1 translation units. [2024-08-13 22:32:20,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-13 22:32:20,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f5f4be592/a8fd7c36c162405bb401a5b49026b80d/FLAG98740a2ee [2024-08-13 22:32:20,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f5f4be592/a8fd7c36c162405bb401a5b49026b80d [2024-08-13 22:32:20,462 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-13 22:32:20,463 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-13 22:32:20,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-08-13 22:32:20,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-13 22:32:20,542 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-13 22:32:20,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-13 22:32:20,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-13 22:32:20,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-13 22:32:20,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:32:20" (1/2) ... [2024-08-13 22:32:20,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a7448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:32:20, skipping insertion in model container [2024-08-13 22:32:20,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:32:20" (1/2) ... [2024-08-13 22:32:20,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79a67a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:32:20, skipping insertion in model container [2024-08-13 22:32:20,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 10:32:20" (2/2) ... [2024-08-13 22:32:20,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a7448 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20, skipping insertion in model container [2024-08-13 22:32:20,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 10:32:20" (2/2) ... [2024-08-13 22:32:20,554 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-13 22:32:20,577 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-13 22:32:20,578 INFO L97 edCorrectnessWitness]: Location invariant before [L713-L713] ((0 <= top) && (top <= 64)) && (top != 2) [2024-08-13 22:32:20,578 INFO L97 edCorrectnessWitness]: Location invariant before [L706-L706] ((0 <= top) && (top <= 64)) && (top != 2) [2024-08-13 22:32:20,615 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-13 22:32:20,854 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-08-13 22:32:20,860 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 22:32:20,875 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-13 22:32:20,946 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] Start Parsing Local [2024-08-13 22:32:20,949 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 22:32:20,975 INFO L206 MainTranslator]: Completed translation [2024-08-13 22:32:20,975 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20 WrapperNode [2024-08-13 22:32:20,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-13 22:32:20,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-13 22:32:20,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-13 22:32:20,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-13 22:32:20,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:20,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,015 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2024-08-13 22:32:21,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-13 22:32:21,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-13 22:32:21,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-13 22:32:21,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-13 22:32:21,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-13 22:32:21,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-13 22:32:21,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-13 22:32:21,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-13 22:32:21,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (1/1) ... [2024-08-13 22:32:21,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 22:32:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:21,083 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-13 22:32:21,088 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-13 22:32:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-13 22:32:21,115 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-13 22:32:21,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-13 22:32:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-13 22:32:21,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-13 22:32:21,140 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-13 22:32:21,261 INFO L244 CfgBuilder]: Building ICFG [2024-08-13 22:32:21,263 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-13 22:32:21,395 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-13 22:32:21,398 INFO L293 CfgBuilder]: Performing block encoding [2024-08-13 22:32:21,509 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-13 22:32:21,509 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-13 22:32:21,509 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:32:21 BoogieIcfgContainer [2024-08-13 22:32:21,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-13 22:32:21,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-13 22:32:21,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-13 22:32:21,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-13 22:32:21,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 10:32:20" (1/4) ... [2024-08-13 22:32:21,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e1040d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:32:21, skipping insertion in model container [2024-08-13 22:32:21,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 10:32:20" (2/4) ... [2024-08-13 22:32:21,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e1040d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 10:32:21, skipping insertion in model container [2024-08-13 22:32:21,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 10:32:20" (3/4) ... [2024-08-13 22:32:21,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e1040d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 10:32:21, skipping insertion in model container [2024-08-13 22:32:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:32:21" (4/4) ... [2024-08-13 22:32:21,519 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-08-13 22:32:21,536 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-13 22:32:21,536 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-08-13 22:32:21,536 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-13 22:32:21,581 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 22:32:21,620 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:21,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:32:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:21,624 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-13 22:32:21,625 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-13 22:32:21,661 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:32:21,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-13 22:32:21,676 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:21,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-13 22:32:21,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:21,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash 150307150, now seen corresponding path program 1 times [2024-08-13 22:32:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506482396] [2024-08-13 22:32:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:22,077 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-13 22:32:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506482396] [2024-08-13 22:32:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506482396] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:22,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:22,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-13 22:32:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104363880] [2024-08-13 22:32:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:22,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:32:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:22,106 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-13 22:32:22,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-13 22:32:22,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:22,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -528617194, now seen corresponding path program 1 times [2024-08-13 22:32:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:22,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774499429] [2024-08-13 22:32:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:22,374 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-13 22:32:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:22,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774499429] [2024-08-13 22:32:22,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774499429] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:22,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:22,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-13 22:32:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424514210] [2024-08-13 22:32:22,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 22:32:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 22:32:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 22:32:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:22,379 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-13 22:32:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:22,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-13 22:32:22,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:22,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 306972498, now seen corresponding path program 1 times [2024-08-13 22:32:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81792207] [2024-08-13 22:32:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:22,694 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-13 22:32:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81792207] [2024-08-13 22:32:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81792207] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 22:32:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694786083] [2024-08-13 22:32:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 22:32:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 22:32:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 22:32:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,696 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:22,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-13 22:32:22,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:22,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 22:32:22,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-13 22:32:22,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-13 22:32:22,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-13 22:32:22,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-13 22:32:22,795 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-13 22:32:22,798 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE (1/2) [2024-08-13 22:32:22,800 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:22,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:32:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:22,806 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-13 22:32:22,808 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-13 22:32:22,810 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:32:22,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 22:32:22,811 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:22,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 22:32:22,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:22,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1583709203, now seen corresponding path program 1 times [2024-08-13 22:32:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426378652] [2024-08-13 22:32:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:22,884 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-13 22:32:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426378652] [2024-08-13 22:32:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426378652] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-13 22:32:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599332905] [2024-08-13 22:32:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:32:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:22,889 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-13 22:32:22,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-13 22:32:22,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:22,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1194974795, now seen corresponding path program 1 times [2024-08-13 22:32:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960413500] [2024-08-13 22:32:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:23,065 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-13 22:32:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960413500] [2024-08-13 22:32:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960413500] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-13 22:32:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846576915] [2024-08-13 22:32:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 22:32:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 22:32:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 22:32:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:23,068 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-13 22:32:23,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-13 22:32:23,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:23,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1542646995, now seen corresponding path program 1 times [2024-08-13 22:32:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611126230] [2024-08-13 22:32:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:23,241 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-13 22:32:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611126230] [2024-08-13 22:32:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611126230] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 22:32:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741635034] [2024-08-13 22:32:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 22:32:23,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 22:32:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 22:32:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:23,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-13 22:32:23,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:23,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 22:32:23,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-13 22:32:23,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:23,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1610541106, now seen corresponding path program 1 times [2024-08-13 22:32:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931470187] [2024-08-13 22:32:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:32:23,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 22:32:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:32:23,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 22:32:23,330 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 22:32:23,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 22:32:23,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-13 22:32:23,331 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-13 22:32:23,331 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-13 22:32:23,332 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 22:32:23,332 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-13 22:32:23,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 22:32:23,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:23,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:32:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:23,351 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-13 22:32:23,353 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-13 22:32:23,354 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:32:23,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 22:32:23,355 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:23,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 22:32:23,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:23,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1122837360, now seen corresponding path program 1 times [2024-08-13 22:32:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335293250] [2024-08-13 22:32:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:23,469 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-13 22:32:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335293250] [2024-08-13 22:32:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335293250] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-13 22:32:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005780275] [2024-08-13 22:32:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:32:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:23,472 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-13 22:32:23,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-13 22:32:23,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:23,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:23,516 INFO L85 PathProgramCache]: Analyzing trace with hash -889200088, now seen corresponding path program 1 times [2024-08-13 22:32:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824535916] [2024-08-13 22:32:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:23,626 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-13 22:32:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824535916] [2024-08-13 22:32:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824535916] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484765848] [2024-08-13 22:32:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:23,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:23,629 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-13 22:32:23,630 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-13 22:32:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:23,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-13 22:32:23,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:23,752 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-13 22:32:23,783 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-13 22:32:23,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:32:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484765848] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:32:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-13 22:32:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398458051] [2024-08-13 22:32:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:23,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-13 22:32:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:23,785 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-13 22:32:23,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:23,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-13 22:32:24,014 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-13 22:32:24,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:24,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash 642535261, now seen corresponding path program 1 times [2024-08-13 22:32:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729732514] [2024-08-13 22:32:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:24,125 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-13 22:32:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729732514] [2024-08-13 22:32:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729732514] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:24,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:24,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-13 22:32:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332922607] [2024-08-13 22:32:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 22:32:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 22:32:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 22:32:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:24,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:24,126 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-13 22:32:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:32:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-13 22:32:24,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:32:24,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -466935943, now seen corresponding path program 1 times [2024-08-13 22:32:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205276014] [2024-08-13 22:32:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:32:24,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 22:32:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:32:24,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 22:32:24,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 22:32:24,283 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 22:32:24,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-13 22:32:24,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-13 22:32:24,285 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-13 22:32:24,286 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 22:32:24,286 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-13 22:32:24,321 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 22:32:24,324 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:32:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:24,326 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-13 22:32:24,331 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-13 22:32:24,333 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:32:24,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-13 22:32:24,333 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:32:24,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-13 22:32:24,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:24,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1844731757, now seen corresponding path program 1 times [2024-08-13 22:32:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49403586] [2024-08-13 22:32:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:24,593 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-13 22:32:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49403586] [2024-08-13 22:32:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49403586] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:32:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-13 22:32:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253109011] [2024-08-13 22:32:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:24,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:32:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:24,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:24,598 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-13 22:32:24,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-13 22:32:24,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:24,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1608911659, now seen corresponding path program 1 times [2024-08-13 22:32:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378514160] [2024-08-13 22:32:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:24,824 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-13 22:32:24,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378514160] [2024-08-13 22:32:24,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378514160] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658370298] [2024-08-13 22:32:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:24,827 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-13 22:32:24,831 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-13 22:32:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:24,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-13 22:32:24,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:24,940 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-13 22:32:24,962 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-13 22:32:24,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:32:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658370298] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:24,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:32:24,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-13 22:32:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099541066] [2024-08-13 22:32:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:24,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:32:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:24,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:32:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-13 22:32:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:24,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:24,964 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-13 22:32:24,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:24,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:25,467 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-13 22:32:25,651 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-13 22:32:25,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:25,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1157482927, now seen corresponding path program 1 times [2024-08-13 22:32:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594750370] [2024-08-13 22:32:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:25,812 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-13 22:32:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594750370] [2024-08-13 22:32:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594750370] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123320969] [2024-08-13 22:32:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:25,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:25,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:25,816 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-13 22:32:25,821 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-13 22:32:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:25,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-13 22:32:25,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:25,937 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-13 22:32:25,958 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-13 22:32:25,985 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-13 22:32:25,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:26,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:26,232 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-13 22:32:26,285 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-13 22:32:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123320969] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:26,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-13 22:32:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988317735] [2024-08-13 22:32:26,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-13 22:32:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-13 22:32:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-13 22:32:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:26,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:26,288 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-13 22:32:26,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:26,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:26,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:26,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-13 22:32:27,091 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-13 22:32:27,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:27,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1334266025, now seen corresponding path program 1 times [2024-08-13 22:32:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639551622] [2024-08-13 22:32:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:27,257 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-13 22:32:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639551622] [2024-08-13 22:32:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639551622] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307791567] [2024-08-13 22:32:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:27,259 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-13 22:32:27,260 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-13 22:32:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:27,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-13 22:32:27,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:27,375 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-13 22:32:27,390 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-13 22:32:27,407 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-13 22:32:27,426 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-13 22:32:27,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:27,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:27,688 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-13 22:32:27,748 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-13 22:32:27,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307791567] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:27,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-13 22:32:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275840022] [2024-08-13 22:32:27,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 22:32:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 22:32:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-13 22:32:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:27,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:27,750 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-13 22:32:27,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:27,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:27,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:27,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:28,489 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-13 22:32:28,676 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-13 22:32:28,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:28,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -40978486, now seen corresponding path program 1 times [2024-08-13 22:32:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20076082] [2024-08-13 22:32:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:28,781 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-13 22:32:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20076082] [2024-08-13 22:32:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20076082] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257732854] [2024-08-13 22:32:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:28,783 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-13 22:32:28,814 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-13 22:32:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:28,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-13 22:32:28,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:28,930 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-13 22:32:28,963 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-13 22:32:28,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:29,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:29,114 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-13 22:32:29,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:29,125 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-13 22:32:29,158 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 53 treesize of output 37 [2024-08-13 22:32:29,165 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 6 treesize of output 4 [2024-08-13 22:32:29,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-08-13 22:32:29,198 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-13 22:32:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257732854] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:29,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-13 22:32:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664994998] [2024-08-13 22:32:29,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:29,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-13 22:32:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-13 22:32:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-13 22:32:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:29,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:29,200 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-13 22:32:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:29,548 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-13 22:32:29,736 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-13 22:32:29,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:29,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2063358310, now seen corresponding path program 1 times [2024-08-13 22:32:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566983754] [2024-08-13 22:32:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:30,039 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-13 22:32:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566983754] [2024-08-13 22:32:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566983754] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807162851] [2024-08-13 22:32:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:30,043 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-13 22:32:30,045 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-13 22:32:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:30,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-13 22:32:30,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:30,166 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-13 22:32:30,182 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-13 22:32:30,197 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-13 22:32:30,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:32:30,243 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-13 22:32:30,266 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-13 22:32:30,298 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-13 22:32:30,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:30,493 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 10 treesize of output 8 [2024-08-13 22:32:30,503 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 10 treesize of output 8 [2024-08-13 22:32:30,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:30,683 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-13 22:32:30,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:30,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-08-13 22:32:30,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:32:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-08-13 22:32:30,762 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-13 22:32:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807162851] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:30,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-08-13 22:32:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441368655] [2024-08-13 22:32:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:30,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-13 22:32:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-13 22:32:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=413, Unknown=6, NotChecked=0, Total=506 [2024-08-13 22:32:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:30,764 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:30,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 22 states have internal predecessors, (120), 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-13 22:32:30,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:30,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:30,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:30,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:30,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:30,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-08-13 22:32:32,812 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-13 22:32:33,000 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-13 22:32:33,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:33,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1319353030, now seen corresponding path program 2 times [2024-08-13 22:32:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:33,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965727282] [2024-08-13 22:32:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:33,272 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-13 22:32:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965727282] [2024-08-13 22:32:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965727282] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529260367] [2024-08-13 22:32:33,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 22:32:33,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:33,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:33,277 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-13 22:32:33,278 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-13 22:32:33,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-13 22:32:33,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:32:33,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-13 22:32:33,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:33,397 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 16 treesize of output 8 [2024-08-13 22:32:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 22:32:33,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:32:33,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529260367] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:33,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:32:33,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-13 22:32:33,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366875003] [2024-08-13 22:32:33,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:33,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 22:32:33,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:33,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 22:32:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-08-13 22:32:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:33,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:33,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-13 22:32:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:33,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:33,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-08-13 22:32:33,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 22:32:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:34,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-08-13 22:32:34,248 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-13 22:32:34,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:34,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2033089872, now seen corresponding path program 3 times [2024-08-13 22:32:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164418232] [2024-08-13 22:32:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:34,461 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-13 22:32:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164418232] [2024-08-13 22:32:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164418232] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241218142] [2024-08-13 22:32:34,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-13 22:32:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:34,464 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-13 22:32:34,466 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-13 22:32:34,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-13 22:32:34,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:32:34,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-13 22:32:34,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:34,575 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 13 treesize of output 9 [2024-08-13 22:32:34,578 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-13 22:32:34,637 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 22:32:34,637 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 2 case distinctions, treesize of input 60 treesize of output 88 [2024-08-13 22:32:34,660 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-13 22:32:34,695 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 22:32:34,695 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 31 treesize of output 36 [2024-08-13 22:32:34,703 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-13 22:32:34,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:34,716 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 15 treesize of output 19 [2024-08-13 22:32:35,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:35,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 156 [2024-08-13 22:32:35,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:35,408 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 82 treesize of output 87 [2024-08-13 22:32:35,412 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 78 treesize of output 76 [2024-08-13 22:32:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 22:32:35,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:32:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241218142] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:32:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2024-08-13 22:32:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119742607] [2024-08-13 22:32:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 22:32:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 22:32:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-08-13 22:32:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:35,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:35,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:37,117 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-13 22:32:37,297 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-13 22:32:37,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:37,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1747557515, now seen corresponding path program 1 times [2024-08-13 22:32:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:37,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536726788] [2024-08-13 22:32:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:37,547 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-13 22:32:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536726788] [2024-08-13 22:32:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536726788] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25556493] [2024-08-13 22:32:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:37,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:32:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-13 22:32:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:37,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-13 22:32:37,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:37,677 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-13 22:32:37,692 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-13 22:32:37,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:32:37,720 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-13 22:32:37,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 22:32:37,751 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-13 22:32:37,775 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-13 22:32:37,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:37,900 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-08-13 22:32:38,125 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 10 treesize of output 8 [2024-08-13 22:32:38,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-13 22:32:38,138 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 10 treesize of output 8 [2024-08-13 22:32:38,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:38,293 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-13 22:32:38,315 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 86 treesize of output 76 [2024-08-13 22:32:38,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:38,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-08-13 22:32:38,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:32:38,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-08-13 22:32:38,353 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-13 22:32:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25556493] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:38,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-08-13 22:32:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149719473] [2024-08-13 22:32:38,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:38,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-13 22:32:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-13 22:32:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=6, NotChecked=38, Total=462 [2024-08-13 22:32:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:38,355 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:38,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 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-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:38,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:38,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:38,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse4 (< c_~next_alloc_idx~0 63)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse1 (< 64 c_~next_alloc_idx~0))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse1 (let ((.cse3 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse4 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= c_~next_alloc_idx~0 62) (< 0 c_~top~0) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (and (or .cse4 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) .cse1) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:32:39,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= c_~next_alloc_idx~0 62) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:32:39,750 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (<= 3 c_~top~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|)))) is different from false [2024-08-13 22:32:39,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (<= c_~next_alloc_idx~0 62) (= .cse0 3) (<= 3 c_~top~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:32:40,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (<= 3 c_~top~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:32:41,908 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (<= 3 c_~top~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|)))) is different from false [2024-08-13 22:32:41,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (< 0 c_~top~0) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:32:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-08-13 22:32:42,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-13 22:32:42,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:42,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:42,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 254653069, now seen corresponding path program 2 times [2024-08-13 22:32:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848556319] [2024-08-13 22:32:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:42,994 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-13 22:32:42,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848556319] [2024-08-13 22:32:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848556319] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917288545] [2024-08-13 22:32:42,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 22:32:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:42,996 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-13 22:32:42,997 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-13 22:32:43,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-13 22:32:43,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:32:43,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-13 22:32:43,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:43,123 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-13 22:32:43,125 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 13 treesize of output 9 [2024-08-13 22:32:43,180 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-08-13 22:32:43,180 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 2 case distinctions, treesize of input 60 treesize of output 69 [2024-08-13 22:32:43,199 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 16 treesize of output 5 [2024-08-13 22:32:43,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:43,446 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 88 treesize of output 60 [2024-08-13 22:32:43,448 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 35 treesize of output 33 [2024-08-13 22:32:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 22:32:43,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:32:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917288545] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:32:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:32:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2024-08-13 22:32:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107684039] [2024-08-13 22:32:43,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:32:43,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 22:32:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 22:32:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2024-08-13 22:32:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:43,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:43,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-13 22:32:43,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:43,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-08-13 22:32:43,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-08-13 22:32:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:32:44,992 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-13 22:32:45,181 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-13 22:32:45,181 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:45,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 358001874, now seen corresponding path program 4 times [2024-08-13 22:32:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217981064] [2024-08-13 22:32:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:45,500 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-13 22:32:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217981064] [2024-08-13 22:32:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217981064] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753007467] [2024-08-13 22:32:45,501 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-13 22:32:45,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:45,506 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:32:45,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-13 22:32:45,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-13 22:32:45,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:32:45,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-13 22:32:45,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:45,649 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-13 22:32:45,663 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-13 22:32:45,774 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-13 22:32:45,775 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-13 22:32:45,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-13 22:32:45,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:32:45,839 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-13 22:32:45,867 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 19 treesize of output 18 [2024-08-13 22:32:45,913 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-13 22:32:45,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-08-13 22:32:45,959 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-13 22:32:45,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:46,021 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_10 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-08-13 22:32:46,055 WARN L854 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-08-13 22:32:46,144 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_1036 Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_10) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-13 22:32:46,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:46,919 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-13 22:32:46,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:46,930 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-13 22:32:47,040 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 195 treesize of output 183 [2024-08-13 22:32:47,044 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-13 22:32:47,049 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 9 treesize of output 7 [2024-08-13 22:32:47,051 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 10 treesize of output 8 [2024-08-13 22:32:47,133 INFO L349 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2024-08-13 22:32:47,134 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 174 treesize of output 216 [2024-08-13 22:32:47,166 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-08-13 22:32:47,167 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 4 case distinctions, treesize of input 195 treesize of output 198 [2024-08-13 22:32:47,181 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 150 treesize of output 148 [2024-08-13 22:32:47,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:47,196 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 203 treesize of output 203 [2024-08-13 22:32:47,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 157 treesize of output 155 [2024-08-13 22:32:47,218 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 155 treesize of output 153 [2024-08-13 22:32:47,229 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 153 treesize of output 151 [2024-08-13 22:32:47,295 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-13 22:32:47,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 6 treesize of output 4 [2024-08-13 22:32:47,640 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-08-13 22:32:47,640 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 143 treesize of output 140 [2024-08-13 22:32:47,712 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 86 treesize of output 82 [2024-08-13 22:32:47,733 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-13 22:32:47,742 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 113 treesize of output 109 [2024-08-13 22:32:47,778 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 137 treesize of output 133 [2024-08-13 22:32:47,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:32:47,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 578 treesize of output 680 [2024-08-13 22:32:49,470 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-13 22:32:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753007467] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:32:49,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:32:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-08-13 22:32:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480372729] [2024-08-13 22:32:49,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:32:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-08-13 22:32:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:32:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-08-13 22:32:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=627, Unknown=16, NotChecked=162, Total=930 [2024-08-13 22:32:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:49,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:32:49,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 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-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:32:49,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:49,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:49,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-08-13 22:32:49,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:32:49,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:32:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:32:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-13 22:32:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:32:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-13 22:32:57,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-08-13 22:32:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:57,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:32:57,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:32:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -953895350, now seen corresponding path program 2 times [2024-08-13 22:32:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:32:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593233529] [2024-08-13 22:32:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:32:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:32:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:32:58,072 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-13 22:32:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:32:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593233529] [2024-08-13 22:32:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593233529] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:32:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548409224] [2024-08-13 22:32:58,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 22:32:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:32:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:32:58,075 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-13 22:32:58,075 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-13 22:32:58,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-13 22:32:58,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:32:58,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-13 22:32:58,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:32:58,196 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-13 22:32:58,201 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-13 22:32:58,269 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-13 22:32:58,270 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-13 22:32:58,302 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-13 22:32:58,391 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-08-13 22:32:58,391 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-13 22:32:58,410 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-13 22:32:58,420 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-13 22:32:58,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:32:58,497 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (and (forall ((v_DerPreprocessor_13 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (forall ((v_DerPreprocessor_13 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_13 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2))) (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) is different from false [2024-08-13 22:33:00,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:33:00,088 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-13 22:33:00,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:33:00,097 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-13 22:33:00,214 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 657 treesize of output 637 [2024-08-13 22:33:00,226 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-13 22:33:00,229 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-13 22:33:00,232 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-13 22:33:00,245 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 54 treesize of output 50 [2024-08-13 22:33:00,248 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 50 treesize of output 48 [2024-08-13 22:33:00,251 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 46 [2024-08-13 22:33:00,263 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-13 22:33:00,266 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-13 22:33:00,269 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-13 22:33:00,351 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 866 treesize of output 818 [2024-08-13 22:33:00,391 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 42 treesize of output 38 [2024-08-13 22:33:00,394 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 36 [2024-08-13 22:33:00,413 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 40 treesize of output 36 [2024-08-13 22:33:00,416 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-13 22:33:00,436 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 42 treesize of output 38 [2024-08-13 22:33:00,438 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-13 22:33:00,466 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-13 22:33:00,469 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-13 22:33:00,498 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 52 treesize of output 50 [2024-08-13 22:33:00,501 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 50 treesize of output 46 [2024-08-13 22:33:00,531 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-13 22:33:00,533 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-13 22:33:00,556 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-13 22:33:00,558 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-13 22:33:00,576 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 42 treesize of output 40 [2024-08-13 22:33:00,579 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 40 treesize of output 36 [2024-08-13 22:33:00,598 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 40 treesize of output 36 [2024-08-13 22:33:00,601 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-13 22:33:00,970 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-13 22:33:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548409224] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:33:00,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:33:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2024-08-13 22:33:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062872193] [2024-08-13 22:33:00,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:33:00,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-13 22:33:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:33:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-13 22:33:00,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=475, Unknown=3, NotChecked=46, Total=650 [2024-08-13 22:33:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:33:00,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:33:00,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 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-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:33:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-08-13 22:33:00,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:33:31,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:33:51,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (<= c_~next_alloc_idx~0 62) (= .cse0 3) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:33:59,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-13 22:33:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-13 22:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:33:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-08-13 22:33:59,490 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,SelfDestructingSolverStorable22 [2024-08-13 22:33:59,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:33:59,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:33:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -180467686, now seen corresponding path program 5 times [2024-08-13 22:33:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:33:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766541654] [2024-08-13 22:33:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:33:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:33:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:33:59,723 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-13 22:33:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:33:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766541654] [2024-08-13 22:33:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766541654] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:33:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641362251] [2024-08-13 22:33:59,724 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-13 22:33:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:33:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:33:59,726 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-13 22:33:59,730 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-13 22:33:59,852 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-08-13 22:33:59,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:33:59,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-13 22:33:59,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:33:59,863 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-13 22:33:59,874 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-13 22:33:59,922 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-13 22:33:59,922 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-13 22:33:59,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 22:34:00,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-13 22:34:00,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:34:00,022 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-13 22:34:00,039 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-13 22:34:00,074 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-13 22:34:00,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:34:00,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_17 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2024-08-13 22:34:00,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) is different from false [2024-08-13 22:34:00,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:34:00,597 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-13 22:34:00,647 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2024-08-13 22:34:00,648 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 156 [2024-08-13 22:34:00,653 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 119 treesize of output 117 [2024-08-13 22:34:00,665 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 166 treesize of output 164 [2024-08-13 22:34:00,671 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 136 treesize of output 134 [2024-08-13 22:34:00,676 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 134 treesize of output 132 [2024-08-13 22:34:00,682 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 132 treesize of output 130 [2024-08-13 22:34:00,687 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 130 treesize of output 128 [2024-08-13 22:34:00,849 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-13 22:34:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641362251] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:34:00,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:34:00,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-08-13 22:34:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132094667] [2024-08-13 22:34:00,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:34:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-13 22:34:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:34:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-13 22:34:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=498, Unknown=9, NotChecked=94, Total=702 [2024-08-13 22:34:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:34:00,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:34:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 26 states have internal predecessors, (131), 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-13 22:34:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:34:00,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:34:02,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) .cse0) (forall ((v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0))))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2024-08-13 22:34:09,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:34:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:34:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:34:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-13 22:34:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:34:30,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-08-13 22:34:30,418 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,SelfDestructingSolverStorable23 [2024-08-13 22:34:30,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:34:30,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:34:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1662094232, now seen corresponding path program 3 times [2024-08-13 22:34:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:34:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683033605] [2024-08-13 22:34:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:34:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:34:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:34:30,608 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-13 22:34:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:34:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683033605] [2024-08-13 22:34:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683033605] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:34:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091009698] [2024-08-13 22:34:30,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-13 22:34:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:34:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:34:30,611 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-13 22:34:30,612 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-13 22:34:30,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-13 22:34:30,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:34:30,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-13 22:34:30,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:34:30,749 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-13 22:34:30,759 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-13 22:34:30,829 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-08-13 22:34:30,830 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-13 22:34:30,865 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-13 22:34:30,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:34:33,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:34:33,637 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-13 22:34:33,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:34:33,738 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 972 treesize of output 948 [2024-08-13 22:34:33,753 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-13 22:34:33,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 8 treesize of output 6 [2024-08-13 22:34:33,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 8 treesize of output 6 [2024-08-13 22:34:33,848 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-13 22:34:33,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:34:33,886 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 461 treesize of output 453 [2024-08-13 22:34:33,894 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 335 treesize of output 327 [2024-08-13 22:34:34,002 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 45 treesize of output 43 [2024-08-13 22:34:34,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:34:34,013 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 300 treesize of output 294 [2024-08-13 22:34:34,022 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-13 22:34:34,028 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-13 22:34:34,104 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-13 22:34:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091009698] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:34:34,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:34:34,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-08-13 22:34:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953624026] [2024-08-13 22:34:34,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:34:34,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-13 22:34:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:34:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-13 22:34:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=270, Unknown=3, NotChecked=0, Total=342 [2024-08-13 22:34:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:34:34,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:34:34,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 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-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:34:34,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:34:39,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:34:43,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:34:45,486 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-13 22:34:47,515 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-13 22:34:49,677 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-13 22:34:51,754 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-13 22:34:53,844 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-13 22:34:55,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-13 22:34:57,990 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-13 22:35:00,031 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-13 22:35:02,161 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-13 22:35:04,338 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-13 22:35:06,426 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-13 22:35:08,687 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-13 22:35:12,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 2)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse12 (< c_~next_alloc_idx~0 65)) (.cse17 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 0 .cse0) (or .cse1 (and (or (< c_~next_alloc_idx~0 63) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse2 (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 (not (= (+ (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse3 (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_21 (Array Int Int))) (not (= (select (select (store .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2))) (not (= (+ (select (select .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse4 (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 (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse5 (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 ((.cse6 (select .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= 2 (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| .cse0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse8 (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 ((.cse7 (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| .cse0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))))) (<= c_~next_alloc_idx~0 60) (or .cse1 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (not (= 2 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse11 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))))) (or .cse12 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))))) (not (= c_~next_alloc_idx~0 0)) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_22 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (< 0 (+ (select (select (store .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)) (not (= (+ (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))) (forall ((v_prenex_325 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_324 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_323 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (+ (select (select .cse14 v_prenex_324) v_prenex_325) 1) 0)) (< (select (select (store .cse14 v_prenex_324 v_prenex_323) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_321 Int) (v_prenex_322 Int) (v_prenex_320 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (select (select (store .cse15 v_prenex_321 v_prenex_320) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2)) (not (= (+ (select (select .cse15 v_prenex_321) v_prenex_322) 1) 0)))))) .cse12) (or .cse1 (let ((.cse16 (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|))) (and (<= .cse16 64) (<= 0 .cse16) (not (= 2 .cse16))))) (<= .cse17 64) (<= 0 .cse17) (or (and (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2)))) .cse12) (not (= 2 .cse17)))) is different from false [2024-08-13 22:35:18,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-13 22:35:20,836 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-13 22:35:22,866 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-13 22:35:24,894 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-13 22:35:31,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-13 22:35:36,246 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-13 22:35:39,178 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-13 22:35:41,196 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-13 22:35:47,872 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-13 22:35:50,123 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-13 22:35:53,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:36:13,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-13 22:36:26,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-13 22:36:28,212 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-13 22:36:30,305 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-13 22:36:32,365 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-13 22:36:54,074 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-13 22:36:56,162 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-13 22:36:58,622 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-13 22:37:00,636 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-13 22:37:02,701 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-13 22:37:04,903 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-13 22:37:07,375 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-13 22:37:09,470 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-13 22:37:11,552 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-13 22:37:13,792 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-13 22:37:15,984 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-13 22:37:18,082 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-13 22:37:20,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-13 22:37:22,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-13 22:37:24,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-13 22:37:28,836 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-13 22:37:33,720 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-13 22:37:36,285 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-13 22:37:38,768 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-13 22:37:40,861 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-13 22:37:42,942 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-13 22:37:44,962 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-13 22:37:49,402 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-13 22:37:51,471 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-13 22:37:53,509 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-13 22:37:55,582 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-13 22:38:02,349 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-13 22:38:10,617 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-13 22:38:12,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:38:15,871 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-13 22:38:17,908 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-13 22:38:19,977 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-13 22:38:33,047 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-13 22:38:36,007 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-13 22:38:38,056 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-13 22:38:40,951 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-13 22:38:49,823 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-13 22:38:51,874 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-13 22:38:53,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-13 22:38:56,974 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-13 22:38:58,999 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-13 22:39:06,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 2)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse12 (< c_~next_alloc_idx~0 65))) (and (= 3 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)) (<= 0 .cse0) (or .cse1 (and (or (< c_~next_alloc_idx~0 63) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse2 (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 (not (= (+ (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse3 (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_21 (Array Int Int))) (not (= (select (select (store .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2))) (not (= (+ (select (select .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse4 (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 (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse5 (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 ((.cse6 (select .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= 2 (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| .cse0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse8 (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 ((.cse7 (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| .cse0)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))))) (<= c_~next_alloc_idx~0 60) (or .cse1 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (not (= 2 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse11 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))))) (or .cse12 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))))) (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|))) (not (= c_~next_alloc_idx~0 0)) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_22 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse13 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (< 0 (+ (select (select (store .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_21) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)) (not (= (+ (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))) (forall ((v_prenex_325 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_324 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_323 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (+ (select (select .cse14 v_prenex_324) v_prenex_325) 1) 0)) (< (select (select (store .cse14 v_prenex_324 v_prenex_323) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_321 Int) (v_prenex_322 Int) (v_prenex_320 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (select (select (store .cse15 v_prenex_321 v_prenex_320) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2)) (not (= (+ (select (select .cse15 v_prenex_321) v_prenex_322) 1) 0)))))) .cse12) (or .cse1 (let ((.cse16 (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|))) (and (<= .cse16 64) (<= 0 .cse16) (not (= 2 .cse16))))) (or (and (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2)))) .cse12))) is different from false [2024-08-13 22:39:30,429 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-13 22:39:32,451 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-13 22:39:34,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:39:36,441 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-13 22:39:39,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-13 22:39:41,369 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-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:39:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-13 22:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-13 22:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:39:42,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-13 22:39:42,766 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,SelfDestructingSolverStorable24 [2024-08-13 22:39:42,766 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:39:42,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:39:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -621330739, now seen corresponding path program 2 times [2024-08-13 22:39:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:39:42,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011173645] [2024-08-13 22:39:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:39:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:39:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:39:43,324 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-13 22:39:43,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:39:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011173645] [2024-08-13 22:39:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011173645] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:39:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146698962] [2024-08-13 22:39:43,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 22:39:43,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:39:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:39:43,327 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-13 22:39:43,328 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-13 22:39:43,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-13 22:39:43,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:39:43,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-13 22:39:43,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:39:43,491 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-13 22:39:43,651 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-08-13 22:39:43,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2024-08-13 22:39:43,735 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-13 22:39:43,821 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-13 22:39:44,369 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-08-13 22:39:44,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-08-13 22:39:44,397 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-13 22:39:44,483 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-13 22:39:44,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:39:44,943 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_24 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 2)))) is different from false [2024-08-13 22:39:45,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:39:45,858 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-13 22:39:46,078 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 50 treesize of output 46 [2024-08-13 22:39:46,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:39:46,239 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-13 22:39:46,253 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 33 treesize of output 25 [2024-08-13 22:39:46,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:39:46,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-13 22:39:46,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,288 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 16 treesize of output 8 [2024-08-13 22:39:46,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:46,340 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-13 22:39:46,340 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2024-08-13 22:39:46,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:39:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 22:39:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146698962] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:39:51,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:39:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-08-13 22:39:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917781770] [2024-08-13 22:39:51,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:39:51,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-13 22:39:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:39:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-13 22:39:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=309, Unknown=3, NotChecked=36, Total=420 [2024-08-13 22:39:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:39:51,713 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:39:51,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-08-13 22:39:51,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:40:19,214 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-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:40:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:40:33,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-08-13 22:40:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:40:33,765 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:40:33,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:40:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2103920734, now seen corresponding path program 6 times [2024-08-13 22:40:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:40:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155701404] [2024-08-13 22:40:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:40:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:40:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:40:34,437 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-13 22:40:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:40:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155701404] [2024-08-13 22:40:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155701404] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:40:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493283298] [2024-08-13 22:40:34,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-13 22:40:34,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:40:34,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:40:34,440 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-13 22:40:34,442 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-13 22:40:34,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-13 22:40:34,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:40:34,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-13 22:40:34,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:40:34,571 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-13 22:40:34,588 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 13 treesize of output 9 [2024-08-13 22:40:34,905 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 22:40:34,905 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 2 case distinctions, treesize of input 53 treesize of output 85 [2024-08-13 22:40:35,035 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-13 22:40:35,301 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 22:40:35,301 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 49 treesize of output 54 [2024-08-13 22:40:35,319 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-13 22:40:35,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:40:35,394 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 33 treesize of output 37 [2024-08-13 22:40:36,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:40:36,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 98 [2024-08-13 22:40:36,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:40:36,948 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 54 treesize of output 59 [2024-08-13 22:40:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 22:40:37,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:40:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493283298] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:40:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:40:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2024-08-13 22:40:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505902948] [2024-08-13 22:40:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:40:37,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 22:40:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:40:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 22:40:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-08-13 22:40:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:40:37,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:40:37,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:40:37,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:40:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:40:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:40:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:40:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:40:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:40:45,771 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-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:40:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:40:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:40:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:40:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:40:45,865 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-13 22:40:46,041 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,SelfDestructingSolverStorable26 [2024-08-13 22:40:46,042 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:40:46,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:40:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -18328603, now seen corresponding path program 3 times [2024-08-13 22:40:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:40:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476779549] [2024-08-13 22:40:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:40:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:40:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:40:46,343 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-13 22:40:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:40:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476779549] [2024-08-13 22:40:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476779549] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:40:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845011220] [2024-08-13 22:40:46,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-13 22:40:46,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:40:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:40:46,345 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-13 22:40:46,347 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-13 22:40:46,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-13 22:40:46,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:40:46,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-13 22:40:46,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:40:46,567 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-13 22:40:46,657 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-13 22:40:46,670 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-13 22:40:46,767 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-13 22:40:46,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:40:47,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:40:47,544 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-13 22:40:47,868 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-13 22:40:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845011220] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:40:47,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:40:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-13 22:40:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550833634] [2024-08-13 22:40:47,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:40:47,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 22:40:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:40:47,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 22:40:47,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-13 22:40:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:40:47,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:40:47,870 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-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:40:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:40:47,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:41:15,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:41:29,925 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-13 22:41:30,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) .cse0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (forall ((v_DerPreprocessor_17 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0))))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2024-08-13 22:41:34,417 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-13 22:41:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:41:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-08-13 22:41:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:41:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:41:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:41:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:41,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-08-13 22:41:42,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-13 22:41:42,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:41:42,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:41:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2141202282, now seen corresponding path program 7 times [2024-08-13 22:41:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:41:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337063553] [2024-08-13 22:41:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:41:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:41:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:41:42,544 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-13 22:41:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:41:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337063553] [2024-08-13 22:41:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337063553] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:41:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321877904] [2024-08-13 22:41:42,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-13 22:41:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:41:42,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:41:42,546 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-13 22:41:42,548 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-13 22:41:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:41:42,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-13 22:41:42,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:41:42,725 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-13 22:41:42,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:41:42,835 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-13 22:41:42,919 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-13 22:41:42,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-13 22:41:43,068 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-13 22:41:43,214 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 15 treesize of output 7 [2024-08-13 22:41:43,329 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-13 22:41:43,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:41:43,638 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_29 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-13 22:41:43,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:41:43,972 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-13 22:41:44,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:41:44,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-13 22:41:44,087 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 31 treesize of output 23 [2024-08-13 22:41:44,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:41:44,141 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-13 22:41:44,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:41:44,697 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-13 22:41:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321877904] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:41:44,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:41:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-08-13 22:41:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406827912] [2024-08-13 22:41:44,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:41:44,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-13 22:41:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:41:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-13 22:41:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2024-08-13 22:41:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:41:44,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:41:44,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 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-13 22:41:44,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:41:44,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:41:44,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:41:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:41:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:41:54,995 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-13 22:41:57,115 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-13 22:41:59,120 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-13 22:42:01,127 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-13 22:42:04,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-13 22:42:14,824 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-13 22:42:20,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:42:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-13 22:42:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:42:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:42:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:42:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-08-13 22:42:27,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-08-13 22:42:27,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-08-13 22:42:27,461 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:42:27,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:42:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1742262774, now seen corresponding path program 8 times [2024-08-13 22:42:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:42:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124195500] [2024-08-13 22:42:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:42:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:42:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:42:28,468 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-13 22:42:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:42:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124195500] [2024-08-13 22:42:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124195500] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:42:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:42:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-13 22:42:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717103090] [2024-08-13 22:42:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:42:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 22:42:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:42:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 22:42:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-08-13 22:42:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:42:28,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:42:28,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 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-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:42:28,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-08-13 22:42:28,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:42:41,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) .cse0) (not (= c_~top~0 0)) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0))))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:42:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-08-13 22:42:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:42:45,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-08-13 22:42:45,848 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:42:45,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:42:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1067977297, now seen corresponding path program 3 times [2024-08-13 22:42:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:42:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236685070] [2024-08-13 22:42:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:42:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:42:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:42:46,548 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-13 22:42:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:42:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236685070] [2024-08-13 22:42:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236685070] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:42:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:42:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-13 22:42:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088835573] [2024-08-13 22:42:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:42:46,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-13 22:42:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:42:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-13 22:42:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-08-13 22:42:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:42:46,550 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:42:46,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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-13 22:42:46,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:42:46,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-08-13 22:42:46,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:42:46,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:42:46,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-08-13 22:42:46,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:42:46,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:42:56,408 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-13 22:43:02,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) .cse0) (forall ((v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (not (= c_~top~0 0)) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0))))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_17 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2024-08-13 22:43:08,430 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-13 22:43:10,523 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-13 22:43:12,649 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-13 22:43:14,655 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-13 22:43:16,704 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-13 22:43:18,765 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-13 22:43:20,789 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-13 22:43:22,959 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-13 22:43:24,984 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-13 22:43:27,016 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-13 22:43:29,101 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-13 22:43:31,177 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-13 22:43:33,247 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-13 22:43:35,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:43:37,112 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-13 22:43:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:43:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:43:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-13 22:43:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:43:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:43:55,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-08-13 22:43:55,679 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:43:55,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:43:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1974101056, now seen corresponding path program 9 times [2024-08-13 22:43:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:43:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057886371] [2024-08-13 22:43:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:43:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:43:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:43:56,545 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-13 22:43:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:43:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057886371] [2024-08-13 22:43:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057886371] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:43:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:43:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-13 22:43:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628237571] [2024-08-13 22:43:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:43:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 22:43:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:43:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 22:43:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-08-13 22:43:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:43:56,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:43:56,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:43:56,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:43:56,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-08-13 22:43:56,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:56,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:43:56,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:13,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 22:44:22,709 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-13 22:44:24,717 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-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:44:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-08-13 22:44:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:44:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-13 22:44:28,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-08-13 22:44:28,236 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:44:28,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:44:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 45737397, now seen corresponding path program 4 times [2024-08-13 22:44:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:44:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013647546] [2024-08-13 22:44:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:44:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:44:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 22:44:28,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:44:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013647546] [2024-08-13 22:44:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013647546] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:44:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:44:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-13 22:44:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189733586] [2024-08-13 22:44:28,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:44:28,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 22:44:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:44:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 22:44:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-08-13 22:44:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:28,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:44:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-13 22:44:28,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:42,510 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-13 22:44:44,550 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-13 22:44:46,572 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-13 22:44:48,577 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-13 22:44:50,581 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-13 22:44:52,585 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-13 22:44:54,596 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-13 22:44:56,613 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-13 22:44:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-08-13 22:44:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-13 22:44:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:44:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 22:44:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-13 22:44:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 22:44:58,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-13 22:44:58,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-13 22:44:58,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-13 22:44:58,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-08-13 22:44:58,167 INFO L445 BasicCegarLoop]: Path program histogram: [9, 4, 3, 3, 1, 1, 1] [2024-08-13 22:44:58,168 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE (1/4) [2024-08-13 22:44:58,169 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:44:58,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:44:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:44:58,171 INFO L229 MonitoredProcess]: Starting monitored process 24 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-13 22:44:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-08-13 22:44:58,175 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:44:58,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 22:44:58,176 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:44:58,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 22:44:58,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:44:58,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:44:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1034262692, now seen corresponding path program 1 times [2024-08-13 22:44:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:44:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721487513] [2024-08-13 22:44:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:44:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:44:58,347 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-13 22:44:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:44:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721487513] [2024-08-13 22:44:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721487513] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:44:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:44:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-13 22:44:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774357460] [2024-08-13 22:44:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:44:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:44:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:44:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:44:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:44:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:58,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:44:58,349 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-13 22:44:58,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:58,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-08-13 22:44:58,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:44:58,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:44:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 24134340, now seen corresponding path program 1 times [2024-08-13 22:44:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:44:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225662947] [2024-08-13 22:44:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:44:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:44:58,730 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-13 22:44:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:44:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225662947] [2024-08-13 22:44:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225662947] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:44:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231768291] [2024-08-13 22:44:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:44:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:44:58,735 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:44:58,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-08-13 22:44:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:44:58,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-13 22:44:58,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:44:58,888 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-13 22:44:59,021 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-13 22:44:59,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:44:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231768291] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:44:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:44:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-13 22:44:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983499292] [2024-08-13 22:44:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:44:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:44:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:44:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:44:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-13 22:44:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:59,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:44:59,024 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-13 22:44:59,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-08-13 22:44:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:44:59,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:44:59,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:44:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 665710870, now seen corresponding path program 1 times [2024-08-13 22:44:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:44:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625468375] [2024-08-13 22:44:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:44:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:44:59,512 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-13 22:44:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:44:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625468375] [2024-08-13 22:44:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625468375] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:44:59,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:44:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-13 22:44:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079538899] [2024-08-13 22:44:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:44:59,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 22:44:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:44:59,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 22:44:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 22:44:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:59,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:44:59,514 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-13 22:44:59,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:44:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:44:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 22:44:59,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-08-13 22:44:59,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 22:44:59,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:44:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash 117609650, now seen corresponding path program 1 times [2024-08-13 22:44:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:44:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482823156] [2024-08-13 22:44:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:44:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:44:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:44:59,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 22:44:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 22:44:59,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 22:44:59,930 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 22:44:59,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 22:44:59,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-08-13 22:44:59,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-13 22:44:59,931 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-08-13 22:44:59,931 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 22:44:59,931 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-13 22:44:59,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 22:44:59,956 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:44:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 22:44:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:44:59,960 INFO L229 MonitoredProcess]: Starting monitored process 26 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-13 22:44:59,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-08-13 22:44:59,964 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 22:44:59,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-08-13 22:44:59,964 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;@a141376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 22:44:59,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-13 22:45:00,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:00,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1499481995, now seen corresponding path program 1 times [2024-08-13 22:45:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559873767] [2024-08-13 22:45:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:00,136 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-13 22:45:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559873767] [2024-08-13 22:45:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559873767] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:45:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 22:45:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-13 22:45:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100909791] [2024-08-13 22:45:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:45:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:45:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:45:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 22:45:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:00,137 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:00,137 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-13 22:45:00,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:00,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-08-13 22:45:00,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:00,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash 271572029, now seen corresponding path program 1 times [2024-08-13 22:45:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639160617] [2024-08-13 22:45:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:00,528 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-13 22:45:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639160617] [2024-08-13 22:45:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639160617] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545798056] [2024-08-13 22:45:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:00,530 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:00,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-08-13 22:45:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:00,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-13 22:45:00,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:00,689 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-13 22:45:00,772 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-13 22:45:00,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:45:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545798056] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:45:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:45:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-13 22:45:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119089011] [2024-08-13 22:45:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:45:00,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 22:45:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 22:45:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-13 22:45:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:00,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:00,774 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-13 22:45:00,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:00,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:02,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-08-13 22:45:02,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-08-13 22:45:02,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:02,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1736072425, now seen corresponding path program 1 times [2024-08-13 22:45:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431167976] [2024-08-13 22:45:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:02,978 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-13 22:45:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431167976] [2024-08-13 22:45:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431167976] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718389919] [2024-08-13 22:45:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:02,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:02,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:02,980 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:02,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-08-13 22:45:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:03,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-13 22:45:03,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:03,191 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-13 22:45:03,306 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-13 22:45:03,449 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-13 22:45:03,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:45:04,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:04,343 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-13 22:45:04,546 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-13 22:45:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718389919] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:45:04,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:45:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-13 22:45:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502523011] [2024-08-13 22:45:04,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:45:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-13 22:45:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-13 22:45:04,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-13 22:45:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:04,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:04,548 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-13 22:45:04,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:04,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:04,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:09,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-08-13 22:45:09,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-08-13 22:45:09,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:09,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1638380063, now seen corresponding path program 1 times [2024-08-13 22:45:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830717556] [2024-08-13 22:45:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:09,556 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-13 22:45:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830717556] [2024-08-13 22:45:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830717556] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569476083] [2024-08-13 22:45:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:09,558 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:09,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-08-13 22:45:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:09,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-13 22:45:09,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:09,796 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-13 22:45:09,905 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-13 22:45:10,005 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-13 22:45:10,082 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-13 22:45:10,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:45:11,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:11,282 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-13 22:45:11,536 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-13 22:45:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569476083] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:45:11,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:45:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-13 22:45:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995671782] [2024-08-13 22:45:11,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:45:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 22:45:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:11,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 22:45:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-13 22:45:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:11,539 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:11,539 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-13 22:45:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:18,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-08-13 22:45:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:18,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:18,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1484172777, now seen corresponding path program 1 times [2024-08-13 22:45:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692317219] [2024-08-13 22:45:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:18,968 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-13 22:45:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692317219] [2024-08-13 22:45:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692317219] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764011092] [2024-08-13 22:45:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:18,974 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:18,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-08-13 22:45:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:19,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-13 22:45:19,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:19,217 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-13 22:45:19,323 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-13 22:45:19,430 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-13 22:45:19,529 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-13 22:45:19,595 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-13 22:45:19,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:45:21,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:21,114 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-13 22:45:21,367 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-13 22:45:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764011092] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:45:21,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:45:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-13 22:45:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344878584] [2024-08-13 22:45:21,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:45:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-13 22:45:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-13 22:45:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-08-13 22:45:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:21,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:21,368 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-13 22:45:21,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:21,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:21,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:21,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:21,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:45:27,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-08-13 22:45:27,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:27,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:27,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash -451042575, now seen corresponding path program 1 times [2024-08-13 22:45:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087996141] [2024-08-13 22:45:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:28,407 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-13 22:45:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087996141] [2024-08-13 22:45:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087996141] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888805383] [2024-08-13 22:45:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:28,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:28,409 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-08-13 22:45:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:28,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-13 22:45:28,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:28,650 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-13 22:45:28,734 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-13 22:45:28,816 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-13 22:45:28,912 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-13 22:45:29,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:45:29,193 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-13 22:45:29,292 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-13 22:45:29,489 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-13 22:45:29,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:45:29,705 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_34 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-13 22:45:30,139 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 10 treesize of output 8 [2024-08-13 22:45:30,175 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 10 treesize of output 8 [2024-08-13 22:45:32,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:32,154 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-13 22:45:32,261 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 149 treesize of output 139 [2024-08-13 22:45:32,455 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-13 22:45:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888805383] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:45:32,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:45:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-08-13 22:45:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394823576] [2024-08-13 22:45:32,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:45:32,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-13 22:45:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-13 22:45:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=409, Unknown=3, NotChecked=42, Total=552 [2024-08-13 22:45:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:32,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 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-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 22:45:32,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:45:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-08-13 22:45:49,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-08-13 22:45:50,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-08-13 22:45:50,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:50,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1788344206, now seen corresponding path program 1 times [2024-08-13 22:45:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146596892] [2024-08-13 22:45:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:50,922 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-13 22:45:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146596892] [2024-08-13 22:45:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146596892] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307528495] [2024-08-13 22:45:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:50,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:50,924 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:50,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-08-13 22:45:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:51,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-13 22:45:51,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:51,298 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 16 treesize of output 8 [2024-08-13 22:45:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 22:45:51,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:45:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307528495] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:45:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:45:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-13 22:45:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028781470] [2024-08-13 22:45:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:45:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 22:45:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:45:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 22:45:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-08-13 22:45:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:51,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:45:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-08-13 22:45:51,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:45:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:45:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:45:55,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-08-13 22:45:55,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-08-13 22:45:55,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:45:55,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:45:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash 423370484, now seen corresponding path program 2 times [2024-08-13 22:45:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:45:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772967680] [2024-08-13 22:45:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:45:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:45:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:45:55,824 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-13 22:45:55,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:45:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772967680] [2024-08-13 22:45:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772967680] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:45:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092682439] [2024-08-13 22:45:55,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 22:45:55,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:45:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:45:55,825 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:45:55,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-08-13 22:45:55,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-13 22:45:55,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 22:45:55,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-13 22:45:56,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:45:56,019 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 13 treesize of output 9 [2024-08-13 22:45:56,033 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-13 22:45:56,250 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 22:45:56,250 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 2 case distinctions, treesize of input 53 treesize of output 85 [2024-08-13 22:45:56,553 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 22:45:56,553 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 67 treesize of output 66 [2024-08-13 22:45:56,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:56,628 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 20 treesize of output 24 [2024-08-13 22:45:56,713 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-13 22:45:57,706 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 13 [2024-08-13 22:45:59,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:59,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 154 [2024-08-13 22:45:59,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:45:59,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 72 treesize of output 77 [2024-08-13 22:46:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 22:46:00,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 22:46:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092682439] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 22:46:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 22:46:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-08-13 22:46:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083030797] [2024-08-13 22:46:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 22:46:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 22:46:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:46:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 22:46:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-08-13 22:46:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:00,061 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:46:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-13 22:46:00,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:00,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:00,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:46:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:46:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:46:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-08-13 22:46:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:46:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:46:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:46:18,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-08-13 22:46:18,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-08-13 22:46:18,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:46:18,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:46:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1391017262, now seen corresponding path program 1 times [2024-08-13 22:46:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:46:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565981896] [2024-08-13 22:46:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:46:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:46:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:46:18,823 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-13 22:46:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:46:18,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565981896] [2024-08-13 22:46:18,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565981896] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:46:18,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214765025] [2024-08-13 22:46:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:46:18,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:46:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:46:18,826 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:46:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-08-13 22:46:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:46:19,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-13 22:46:19,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:46:19,093 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-13 22:46:19,316 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-13 22:46:19,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:46:20,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:46:20,017 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-13 22:46:20,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:46:20,049 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-13 22:46:20,127 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 53 treesize of output 37 [2024-08-13 22:46:20,149 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-13 22:46:20,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-08-13 22:46:20,326 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-13 22:46:20,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214765025] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:46:20,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:46:20,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-13 22:46:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776423206] [2024-08-13 22:46:20,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:46:20,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-13 22:46:20,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:46:20,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-13 22:46:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-13 22:46:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:20,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:46:20,328 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-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:46:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:46:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:46:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:46:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:46:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:46:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:46:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:46:23,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-08-13 22:46:23,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:46:23,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 22:46:23,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 22:46:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash -230568318, now seen corresponding path program 1 times [2024-08-13 22:46:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 22:46:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633762145] [2024-08-13 22:46:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:46:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 22:46:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:46:24,682 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-13 22:46:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 22:46:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633762145] [2024-08-13 22:46:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633762145] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 22:46:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15512656] [2024-08-13 22:46:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 22:46:24,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 22:46:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 22:46:24,685 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 22:46:24,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-08-13 22:46:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 22:46:24,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-13 22:46:24,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 22:46:24,937 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-13 22:46:25,034 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-13 22:46:25,136 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 15 treesize of output 1 [2024-08-13 22:46:25,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 22:46:25,420 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-13 22:46:25,536 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-13 22:46:25,679 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 15 treesize of output 7 [2024-08-13 22:46:25,754 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-13 22:46:25,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 22:46:28,927 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 10 treesize of output 8 [2024-08-13 22:46:28,974 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 10 treesize of output 8 [2024-08-13 22:46:29,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 22:46:29,832 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-13 22:46:29,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 22:46:30,166 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-13 22:46:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15512656] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 22:46:30,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 22:46:30,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-08-13 22:46:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509371040] [2024-08-13 22:46:30,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 22:46:30,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-13 22:46:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 22:46:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-13 22:46:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=413, Unknown=3, NotChecked=0, Total=506 [2024-08-13 22:46:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:30,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 22:46:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 22 states have internal predecessors, (120), 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-13 22:46:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 22:46:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 22:46:31,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_39 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int)) (v_ArrVal_2743 Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2743)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2743 c_~next_alloc_idx~0) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (not (= |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_40) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|)))) (< 0 c_~top~0) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (forall ((v_ArrVal_2743 Int)) (or (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_39 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2743)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (< v_ArrVal_2743 c_~next_alloc_idx~0))))) (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-13 22:46:33,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_39 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int)) (v_ArrVal_2743 Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2743)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2743 c_~next_alloc_idx~0) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_40) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|)))) (< 0 c_~top~0) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (forall ((v_ArrVal_2743 Int)) (or (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_39 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2743)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (< v_ArrVal_2743 c_~next_alloc_idx~0))))) (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_39 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_39) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-13 22:46:35,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-13 22:46:37,957 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] Killed by 15