./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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/26_stack_cas.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-23 16:05:39,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-23 16:05:39,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-23 16:05:39,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-23 16:05:39,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-23 16:05:39,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-23 16:05:39,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-23 16:05:39,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-23 16:05:39,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-23 16:05:39,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-23 16:05:39,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-23 16:05:39,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-23 16:05:39,254 INFO L153 SettingsManager]: * Use SBE=true [2024-09-23 16:05:39,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-23 16:05:39,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-23 16:05:39,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-23 16:05:39,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-23 16:05:39,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-23 16:05:39,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-23 16:05:39,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-23 16:05:39,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-23 16:05:39,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-23 16:05:39,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-23 16:05:39,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-23 16:05:39,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-23 16:05:39,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-23 16:05:39,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-23 16:05:39,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-23 16:05:39,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-23 16:05:39,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-23 16:05:39,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 16:05:39,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-23 16:05:39,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-23 16:05:39,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-23 16:05:39,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-23 16:05:39,259 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-23 16:05:39,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-23 16:05:39,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-23 16:05:39,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-23 16:05:39,263 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-23 16:05:39,263 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-23 16:05:39,264 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-23 16:05:39,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-23 16:05:39,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-23 16:05:39,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-23 16:05:39,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-23 16:05:39,507 INFO L274 PluginConnector]: CDTParser initialized [2024-09-23 16:05:39,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas.i [2024-09-23 16:05:40,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-23 16:05:40,907 INFO L384 CDTParser]: Found 1 translation units. [2024-09-23 16:05:40,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i [2024-09-23 16:05:40,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12b4347c0/aef8573527fa444fabc9372b93172da6/FLAGe3f4dbb70 [2024-09-23 16:05:41,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12b4347c0/aef8573527fa444fabc9372b93172da6 [2024-09-23 16:05:41,226 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-23 16:05:41,226 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-23 16:05:41,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas.yml/witness.yml [2024-09-23 16:05:41,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-23 16:05:41,267 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-23 16:05:41,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-23 16:05:41,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-23 16:05:41,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-23 16:05:41,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 04:05:41" (1/2) ... [2024-09-23 16:05:41,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a6b452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 04:05:41, skipping insertion in model container [2024-09-23 16:05:41,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 04:05:41" (1/2) ... [2024-09-23 16:05:41,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9af297d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 04:05:41, skipping insertion in model container [2024-09-23 16:05:41,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 04:05:41" (2/2) ... [2024-09-23 16:05:41,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a6b452 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41, skipping insertion in model container [2024-09-23 16:05:41,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 04:05:41" (2/2) ... [2024-09-23 16:05:41,288 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-23 16:05:41,290 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-23 16:05:41,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-23 16:05:41,528 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i[31294,31307] [2024-09-23 16:05:41,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 16:05:41,545 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-23 16:05:41,607 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i[31294,31307] [2024-09-23 16:05:41,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 16:05:41,637 INFO L204 MainTranslator]: Completed translation [2024-09-23 16:05:41,637 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41 WrapperNode [2024-09-23 16:05:41,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-23 16:05:41,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-23 16:05:41,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-23 16:05:41,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-23 16:05:41,642 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 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,651 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 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,669 INFO L138 Inliner]: procedures = 179, calls = 50, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 198 [2024-09-23 16:05:41,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-23 16:05:41,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-23 16:05:41,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-23 16:05:41,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-23 16:05:41,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-23 16:05:41,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-23 16:05:41,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-23 16:05:41,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-23 16:05:41,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (1/1) ... [2024-09-23 16:05:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 16:05:41,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:41,714 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-09-23 16:05:41,715 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-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-23 16:05:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-23 16:05:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-23 16:05:41,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-23 16:05:41,746 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-23 16:05:41,845 INFO L242 CfgBuilder]: Building ICFG [2024-09-23 16:05:41,846 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-23 16:05:42,053 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-23 16:05:42,053 INFO L291 CfgBuilder]: Performing block encoding [2024-09-23 16:05:42,229 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-23 16:05:42,232 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-23 16:05:42,232 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 04:05:42 BoogieIcfgContainer [2024-09-23 16:05:42,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-23 16:05:42,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-23 16:05:42,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-23 16:05:42,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-23 16:05:42,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.09 04:05:41" (1/4) ... [2024-09-23 16:05:42,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed90ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 04:05:42, skipping insertion in model container [2024-09-23 16:05:42,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 04:05:41" (2/4) ... [2024-09-23 16:05:42,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed90ac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 04:05:42, skipping insertion in model container [2024-09-23 16:05:42,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 04:05:41" (3/4) ... [2024-09-23 16:05:42,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed90ac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 04:05:42, skipping insertion in model container [2024-09-23 16:05:42,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 04:05:42" (4/4) ... [2024-09-23 16:05:42,241 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas.i [2024-09-23 16:05:42,254 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-23 16:05:42,255 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-23 16:05:42,255 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-23 16:05:42,296 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 16:05:42,329 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 16:05:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:42,331 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-09-23 16:05:42,332 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-09-23 16:05:42,360 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 16:05:42,370 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-23 16:05:42,375 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6ccfa855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:42,375 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-23 16:05:42,496 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:42,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1040542185, now seen corresponding path program 1 times [2024-09-23 16:05:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41876681] [2024-09-23 16:05:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41876681] [2024-09-23 16:05:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41876681] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 16:05:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763809251] [2024-09-23 16:05:42,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:42,760 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 16:05:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 16:05:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 16:05:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:42,779 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:42,781 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-09-23 16:05:42,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:42,821 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-23 16:05:42,822 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:42,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2018172712, now seen corresponding path program 1 times [2024-09-23 16:05:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855195842] [2024-09-23 16:05:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:43,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855195842] [2024-09-23 16:05:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855195842] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:43,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959464418] [2024-09-23 16:05:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:43,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:43,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:43,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 16:05:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-23 16:05:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:43,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-23 16:05:43,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:43,322 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-09-23 16:05:43,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:43,369 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-09-23 16:05:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:43,391 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 19 treesize of output 18 [2024-09-23 16:05:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:43,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-23 16:05:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959464418] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-23 16:05:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-09-23 16:05:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228797125] [2024-09-23 16:05:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:43,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:05:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:43,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:05:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-23 16:05:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:43,451 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:43,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-09-23 16:05:43,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:43,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:43,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-23 16:05:43,705 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-09-23 16:05:43,706 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:43,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -30205570, now seen corresponding path program 1 times [2024-09-23 16:05:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:43,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058427119] [2024-09-23 16:05:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:43,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058427119] [2024-09-23 16:05:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058427119] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 16:05:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809519812] [2024-09-23 16:05:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:43,814 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:05:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:43,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:05:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 16:05:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:43,817 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:43,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09-23 16:05:43,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:43,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:43,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:43,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-23 16:05:43,896 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:43,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -30204545, now seen corresponding path program 1 times [2024-09-23 16:05:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309058098] [2024-09-23 16:05:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309058098] [2024-09-23 16:05:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309058098] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515961767] [2024-09-23 16:05:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:44,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:44,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:44,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 16:05:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-23 16:05:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:44,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-23 16:05:44,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:44,350 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:05:44,350 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-09-23 16:05:44,477 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-23 16:05:44,480 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-09-23 16:05:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:44,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:44,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:44,636 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-09-23 16:05:44,639 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-09-23 16:05:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515961767] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:44,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:44,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 21 [2024-09-23 16:05:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846751195] [2024-09-23 16:05:44,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:44,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-23 16:05:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-23 16:05:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=435, Unknown=1, NotChecked=0, Total=506 [2024-09-23 16:05:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:44,780 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:44,780 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 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-09-23 16:05:44,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:44,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:44,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:44,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-23 16:05:45,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-23 16:05:45,440 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:45,440 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:45,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1201889769, now seen corresponding path program 1 times [2024-09-23 16:05:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714883717] [2024-09-23 16:05:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714883717] [2024-09-23 16:05:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714883717] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640003695] [2024-09-23 16:05:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:45,491 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-09-23 16:05:45,492 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-09-23 16:05:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:45,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-23 16:05:45,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:45,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640003695] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:45,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-23 16:05:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963614757] [2024-09-23 16:05:45,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:45,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 16:05:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 16:05:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-23 16:05:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:45,629 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:45,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-09-23 16:05:45,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:45,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-23 16:05:45,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-23 16:05:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:45,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-23 16:05:45,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:45,922 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:45,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash 267907496, now seen corresponding path program 1 times [2024-09-23 16:05:45,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:45,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128003940] [2024-09-23 16:05:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128003940] [2024-09-23 16:05:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128003940] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645065228] [2024-09-23 16:05:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:46,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:46,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 16:05:46,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-23 16:05:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:46,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-23 16:05:46,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:46,504 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-09-23 16:05:46,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:05:46,558 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-09-23 16:05:46,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,587 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-09-23 16:05:46,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,610 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-09-23 16:05:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-09-23 16:05:46,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,688 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-09-23 16:05:46,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,731 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-09-23 16:05:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:46,743 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 19 treesize of output 18 [2024-09-23 16:05:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:46,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:46,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (|~#m~0.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store |c_#memory_int| |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))) is different from false [2024-09-23 16:05:46,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|))) (and (or (not .cse1) (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_4))) (or (= (select (select (store .cse2 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= 0 (select (select (store .cse2 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|)))))) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_5) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_6))) (or (= (select (select (store .cse3 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse3 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))) .cse1)))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_229 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_3))) (or (= (select (select (store .cse4 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse4 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))) .cse0))) is different from false [2024-09-23 16:05:47,123 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_4))) (or (= (select (select (store .cse1 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= 0 (select (select (store .cse1 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|)))))) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_5) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_6))) (or (= (select (select (store .cse2 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse2 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))) .cse0))) (and (forall ((v_ArrVal_225 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_225) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) (forall ((v_ArrVal_225 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_225) |c_~#m2~0.base|) |c_~#m2~0.offset|)))))) is different from false [2024-09-23 16:05:47,187 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_225 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_225) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) (forall ((v_ArrVal_225 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_225) |c_~#m2~0.base|) |c_~#m2~0.offset|))))) (and (forall ((|v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_26| Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_26| |c_~#top~0.base|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_26|) 0)) (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_5) |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_26| v_DerPreprocessor_6))) (or (= (select (select (store .cse0 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0) (= (select (select (store .cse0 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1)))))) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4))) (or (= (select (select (store .cse1 |c_~#m~0.base| v_ArrVal_229) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse1 |c_~#m~0.base| (store v_ArrVal_229 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))) (not (= (select |c_#valid| |c_~#top~0.base|) 0))))) is different from false [2024-09-23 16:05:47,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:47,245 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 154 treesize of output 114 [2024-09-23 16:05:47,249 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 880 treesize of output 836 [2024-09-23 16:05:47,261 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 332 treesize of output 316 [2024-09-23 16:05:47,268 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 296 treesize of output 288 [2024-09-23 16:05:47,273 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 288 treesize of output 284 [2024-09-23 16:05:47,293 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 295 treesize of output 287 [2024-09-23 16:05:47,299 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 277 treesize of output 273 [2024-09-23 16:05:47,307 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 16 treesize of output 14 [2024-09-23 16:05:47,316 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 14 treesize of output 12 [2024-09-23 16:05:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-09-23 16:05:47,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645065228] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:47,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:47,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 22 [2024-09-23 16:05:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224859364] [2024-09-23 16:05:47,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:47,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-23 16:05:47,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-23 16:05:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=294, Unknown=4, NotChecked=156, Total=552 [2024-09-23 16:05:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:47,543 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:47,544 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 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-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:47,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-23 16:05:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:48,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-23 16:05:48,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-23 16:05:48,199 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 791436063, now seen corresponding path program 1 times [2024-09-23 16:05:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50410224] [2024-09-23 16:05:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-23 16:05:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50410224] [2024-09-23 16:05:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50410224] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754813107] [2024-09-23 16:05:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:48,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:48,744 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-09-23 16:05:48,746 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-09-23 16:05:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:48,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-23 16:05:48,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:49,061 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:05:49,062 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-23 16:05:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:49,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754813107] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:49,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:49,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 27 [2024-09-23 16:05:49,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936474301] [2024-09-23 16:05:49,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:49,354 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-23 16:05:49,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:49,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-23 16:05:49,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=686, Unknown=6, NotChecked=0, Total=812 [2024-09-23 16:05:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:49,355 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:49,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 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-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:49,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-23 16:05:50,410 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-09-23 16:05:50,598 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:50,598 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:50,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash -712014424, now seen corresponding path program 1 times [2024-09-23 16:05:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:50,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256630112] [2024-09-23 16:05:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-23 16:05:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256630112] [2024-09-23 16:05:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256630112] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 16:05:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959087787] [2024-09-23 16:05:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:50,749 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:05:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:05:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:05:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:50,750 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:50,750 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-09-23 16:05:50,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-23 16:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-23 16:05:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-09-23 16:05:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:51,526 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-23 16:05:51,526 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-09-23 16:05:51,527 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-23 16:05:51,531 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-23 16:05:51,532 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2024-09-23 16:05:51,534 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 16:05:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:51,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-23 16:05:51,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-09-23 16:05:51,539 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 16:05:51,539 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-23 16:05:51,540 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6ccfa855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:51,540 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-23 16:05:51,623 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:51,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1951987706, now seen corresponding path program 1 times [2024-09-23 16:05:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083400916] [2024-09-23 16:05:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083400916] [2024-09-23 16:05:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083400916] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 16:05:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576558561] [2024-09-23 16:05:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:51,661 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 16:05:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 16:05:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 16:05:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:51,662 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:51,662 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-09-23 16:05:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:51,686 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-23 16:05:51,686 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:51,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1973047627, now seen corresponding path program 1 times [2024-09-23 16:05:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276688960] [2024-09-23 16:05:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 16:05:51,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-23 16:05:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 16:05:51,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-23 16:05:51,727 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-23 16:05:51,727 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-23 16:05:51,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-23 16:05:51,728 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-23 16:05:51,728 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-23 16:05:51,729 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-23 16:05:51,729 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-23 16:05:51,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 16:05:51,761 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 16:05:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:51,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-23 16:05:51,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-09-23 16:05:51,766 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 16:05:51,766 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-23 16:05:51,766 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6ccfa855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:51,766 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-23 16:05:51,928 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:51,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -609343590, now seen corresponding path program 1 times [2024-09-23 16:05:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:51,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651191839] [2024-09-23 16:05:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651191839] [2024-09-23 16:05:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651191839] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 16:05:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552519419] [2024-09-23 16:05:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:51,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 16:05:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 16:05:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 16:05:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:51,976 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:51,977 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 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-09-23 16:05:51,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:52,013 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-23 16:05:52,013 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:52,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1909179271, now seen corresponding path program 1 times [2024-09-23 16:05:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528147034] [2024-09-23 16:05:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528147034] [2024-09-23 16:05:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528147034] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312777083] [2024-09-23 16:05:52,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:52,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:52,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:52,057 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-09-23 16:05:52,058 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-09-23 16:05:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:52,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-23 16:05:52,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:52,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312777083] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:52,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-23 16:05:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807311540] [2024-09-23 16:05:52,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:52,223 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 16:05:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 16:05:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-23 16:05:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:52,224 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:52,224 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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-09-23 16:05:52,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:52,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:52,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-23 16:05:52,466 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:52,466 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:52,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1017209833, now seen corresponding path program 1 times [2024-09-23 16:05:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971148407] [2024-09-23 16:05:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971148407] [2024-09-23 16:05:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971148407] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:52,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:52,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:05:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094865107] [2024-09-23 16:05:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:52,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:05:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:05:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:05:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:52,541 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:52,541 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-09-23 16:05:52,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:52,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:52,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:52,588 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-23 16:05:52,588 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:52,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1144215043, now seen corresponding path program 1 times [2024-09-23 16:05:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:52,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374132700] [2024-09-23 16:05:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374132700] [2024-09-23 16:05:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374132700] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948656547] [2024-09-23 16:05:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:52,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:52,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:52,825 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-09-23 16:05:52,828 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-09-23 16:05:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:52,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-23 16:05:52,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:53,050 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-09-23 16:05:53,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:53,132 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-09-23 16:05:53,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:53,153 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 19 treesize of output 18 [2024-09-23 16:05:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:53,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:53,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:53,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-09-23 16:05:53,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_4 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_4) |c_~#m~0.base|) |c_~#m~0.offset|) 0)))) (or (forall ((|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_585) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not .cse0)))) is different from false [2024-09-23 16:05:53,319 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0))) (and (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_4 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_4) |c_~#m~0.base|) |c_~#m~0.offset|) 0)))) (or (forall ((|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_585) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not .cse0)))) (= |c_thr1Thread1of2ForFork0_push_~newTop~0#1| 0)) is different from false [2024-09-23 16:05:53,353 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0))) (and (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_4 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_4) |c_~#m~0.base|) |c_~#m~0.offset|) 0)))) (or (forall ((|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_585) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not .cse0)))) (= |c_thr1Thread1of2ForFork0_index_malloc_~curr_alloc_idx~0#1| 0)) is different from false [2024-09-23 16:05:53,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:53,361 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-09-23 16:05:53,364 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 30 treesize of output 22 [2024-09-23 16:05:53,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:53,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-09-23 16:05:53,373 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 206 treesize of output 194 [2024-09-23 16:05:53,377 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 94 treesize of output 88 [2024-09-23 16:05:53,380 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 76 treesize of output 72 [2024-09-23 16:05:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-23 16:05:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948656547] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:53,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 22 [2024-09-23 16:05:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077373189] [2024-09-23 16:05:53,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:53,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-23 16:05:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-23 16:05:53,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=278, Unknown=8, NotChecked=114, Total=506 [2024-09-23 16:05:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:53,502 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:53,502 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 22 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-09-23 16:05:53,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:53,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:53,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:53,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:53,785 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-09-23 16:05:53,972 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-23 16:05:53,973 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:53,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash -862726886, now seen corresponding path program 1 times [2024-09-23 16:05:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059861602] [2024-09-23 16:05:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-23 16:05:54,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:54,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059861602] [2024-09-23 16:05:54,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059861602] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:54,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:54,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 16:05:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603830147] [2024-09-23 16:05:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:54,045 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:05:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:54,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:05:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 16:05:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:54,046 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:54,046 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09-23 16:05:54,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:54,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:54,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:54,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:54,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:54,162 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-23 16:05:54,162 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:54,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 510816190, now seen corresponding path program 1 times [2024-09-23 16:05:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123031881] [2024-09-23 16:05:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123031881] [2024-09-23 16:05:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123031881] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832826548] [2024-09-23 16:05:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:54,503 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-09-23 16:05:54,505 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-09-23 16:05:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:54,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-23 16:05:54,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:54,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:05:54,677 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-09-23 16:05:54,786 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-23 16:05:54,788 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-09-23 16:05:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:54,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:54,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:54,961 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-09-23 16:05:54,962 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-09-23 16:05:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:55,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832826548] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:55,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:55,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-09-23 16:05:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505229227] [2024-09-23 16:05:55,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:55,108 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-23 16:05:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-23 16:05:55,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=628, Unknown=5, NotChecked=0, Total=756 [2024-09-23 16:05:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:55,109 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:55,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 27 states have internal predecessors, (97), 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-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-23 16:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-23 16:05:55,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-23 16:05:55,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:55,765 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-23 16:05:55,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1296638273, now seen corresponding path program 1 times [2024-09-23 16:05:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496109578] [2024-09-23 16:05:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 16:05:55,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-23 16:05:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 16:05:55,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-23 16:05:55,810 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-23 16:05:55,810 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-23 16:05:55,810 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-23 16:05:55,811 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-23 16:05:55,811 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-23 16:05:55,812 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-23 16:05:55,812 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-23 16:05:55,855 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 16:05:55,857 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:55,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 16:05:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:55,858 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-23 16:05:55,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-09-23 16:05:55,861 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 16:05:55,861 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-23 16:05:55,862 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6ccfa855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 16:05:55,862 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-23 16:05:56,117 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:56,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -213410961, now seen corresponding path program 1 times [2024-09-23 16:05:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540023914] [2024-09-23 16:05:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-23 16:05:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540023914] [2024-09-23 16:05:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540023914] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 16:05:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842087662] [2024-09-23 16:05:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:56,169 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 16:05:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 16:05:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 16:05:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:56,170 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:56,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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-09-23 16:05:56,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:56,260 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-23 16:05:56,260 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:56,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -203721767, now seen corresponding path program 1 times [2024-09-23 16:05:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:56,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793546204] [2024-09-23 16:05:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793546204] [2024-09-23 16:05:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793546204] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798518980] [2024-09-23 16:05:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:56,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:56,312 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-09-23 16:05:56,313 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-09-23 16:05:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:56,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-23 16:05:56,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:56,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:05:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798518980] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:05:56,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:05:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-23 16:05:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126298963] [2024-09-23 16:05:56,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:05:56,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 16:05:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 16:05:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-23 16:05:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:56,526 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:56,526 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 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-09-23 16:05:56,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:56,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:56,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-23 16:05:56,805 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:56,806 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:56,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -78370665, now seen corresponding path program 1 times [2024-09-23 16:05:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724487544] [2024-09-23 16:05:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-23 16:05:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724487544] [2024-09-23 16:05:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724487544] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:05:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901760216] [2024-09-23 16:05:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:56,896 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:05:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:05:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:05:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:56,897 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:56,897 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-09-23 16:05:56,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:56,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:56,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:57,047 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-23 16:05:57,047 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:57,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 241504629, now seen corresponding path program 1 times [2024-09-23 16:05:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335409968] [2024-09-23 16:05:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-23 16:05:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335409968] [2024-09-23 16:05:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335409968] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:05:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:05:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 16:05:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757424296] [2024-09-23 16:05:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:05:57,136 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:05:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:05:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:05:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 16:05:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:57,137 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:05:57,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-09-23 16:05:57,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:57,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:57,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:57,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:05:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:05:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:05:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:05:57,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-23 16:05:57,264 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:05:57,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:05:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1192403510, now seen corresponding path program 1 times [2024-09-23 16:05:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:05:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079140540] [2024-09-23 16:05:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:05:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-23 16:05:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:05:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079140540] [2024-09-23 16:05:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079140540] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:05:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548737690] [2024-09-23 16:05:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:05:57,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:05:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:05:57,777 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-09-23 16:05:57,778 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-09-23 16:05:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:05:57,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-09-23 16:05:57,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:05:57,984 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-09-23 16:05:58,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,021 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-09-23 16:05:58,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,063 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-09-23 16:05:58,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,107 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-09-23 16:05:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,204 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-09-23 16:05:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,260 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-09-23 16:05:58,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,372 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:05:58,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-09-23 16:05:58,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,447 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:05:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-23 16:05:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,541 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:05:58,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 32 treesize of output 34 [2024-09-23 16:05:58,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:05:58,638 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:05:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 32 treesize of output 34 [2024-09-23 16:05:58,747 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-09-23 16:05:58,750 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-09-23 16:05:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:05:58,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:05:58,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1035))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-23 16:05:58,973 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1035))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-23 16:05:59,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:59,810 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 1 case distinctions, treesize of input 12 treesize of output 8 [2024-09-23 16:05:59,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:05:59,831 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 594 treesize of output 604 [2024-09-23 16:05:59,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 335 [2024-09-23 16:05:59,847 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 333 [2024-09-23 16:05:59,853 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 333 treesize of output 329 [2024-09-23 16:05:59,859 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 329 treesize of output 327 [2024-09-23 16:05:59,865 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 327 treesize of output 319 [2024-09-23 16:05:59,871 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 319 treesize of output 317 [2024-09-23 16:05:59,877 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 317 treesize of output 313 [2024-09-23 16:06:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548737690] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:00,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 19] total 48 [2024-09-23 16:06:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91803791] [2024-09-23 16:06:00,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:00,092 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-23 16:06:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-23 16:06:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1896, Unknown=20, NotChecked=182, Total=2352 [2024-09-23 16:06:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:00,093 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:00,094 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.2448979591836733) internal successors, (159), 48 states have internal predecessors, (159), 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-09-23 16:06:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:00,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:00,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-23 16:06:01,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-09-23 16:06:01,678 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:01,678 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:01,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2003898999, now seen corresponding path program 2 times [2024-09-23 16:06:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976608777] [2024-09-23 16:06:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-23 16:06:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976608777] [2024-09-23 16:06:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976608777] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55622757] [2024-09-23 16:06:01,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-23 16:06:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:01,866 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-09-23 16:06:01,867 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-09-23 16:06:02,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-23 16:06:02,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 16:06:02,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-23 16:06:02,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:02,084 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-09-23 16:06:02,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:02,102 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-09-23 16:06:02,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:02,108 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-09-23 16:06:02,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:02,114 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-09-23 16:06:02,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:02,124 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 19 treesize of output 18 [2024-09-23 16:06:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-23 16:06:02,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-23 16:06:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55622757] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-23 16:06:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-23 16:06:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572743601] [2024-09-23 16:06:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:02,169 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:06:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:06:02,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-23 16:06:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:02,170 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:02,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-23 16:06:02,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-23 16:06:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:02,527 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-09-23 16:06:02,715 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:02,715 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:02,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1651322655, now seen corresponding path program 1 times [2024-09-23 16:06:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037513205] [2024-09-23 16:06:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:06:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:02,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037513205] [2024-09-23 16:06:02,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037513205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:02,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614460913] [2024-09-23 16:06:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:02,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:02,944 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-09-23 16:06:02,945 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-09-23 16:06:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:03,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-09-23 16:06:03,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:03,252 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-23 16:06:03,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-23 16:06:03,301 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-09-23 16:06:03,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,417 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-09-23 16:06:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,462 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-09-23 16:06:03,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:06:03,510 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-09-23 16:06:03,520 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:06:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-09-23 16:06:03,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-23 16:06:03,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:06:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:06:03,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:06:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,761 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-09-23 16:06:03,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-09-23 16:06:03,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:03,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-09-23 16:06:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:03,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:04,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (and (forall ((v_DerPreprocessor_16 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_16 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse0 1) (= .cse0 0)))) (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (and (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse1 0) (= .cse1 1))))))) (not .cse2)) (or .cse2 (and (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse3 0) (= .cse3 1)))))))) is different from false [2024-09-23 16:06:04,104 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_16 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_16 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse0 1) (= .cse0 0)))) (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (and (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse1 0) (= .cse1 1))))))) is different from false [2024-09-23 16:06:04,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| (store (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset| 0)))) (and (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (and (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store .cse0 |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse1 1) (= .cse1 0)))))) (forall ((v_DerPreprocessor_16 (Array Int Int))) (= (select (select (store .cse0 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (forall ((v_DerPreprocessor_16 (Array Int Int))) (let ((.cse2 (select (select (store .cse0 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse2 1) (= .cse2 0)))))) is different from false [2024-09-23 16:06:04,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,218 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-09-23 16:06:04,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,225 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2024-09-23 16:06:04,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-09-23 16:06:04,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,240 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2024-09-23 16:06:04,247 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (and (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_10) |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0) (not (= (select v_arrayElimArr_10 |c_~#m~0.offset|) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_11) |c_~#top~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse0 0) (= .cse0 1) (not (= (select v_arrayElimArr_11 |c_~#m~0.offset|) 0))))))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (not (= (select v_arrayElimArr_13 |c_~#m~0.offset|) 0)) (= .cse1 1) (= .cse1 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_12) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0) (not (= (select v_arrayElimArr_12 |c_~#m~0.offset|) 0))))) is different from false [2024-09-23 16:06:04,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,383 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 21 treesize of output 22 [2024-09-23 16:06:04,384 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 122 treesize of output 110 [2024-09-23 16:06:04,387 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-09-23 16:06:04,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,392 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 22 treesize of output 26 [2024-09-23 16:06:04,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2024-09-23 16:06:04,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 227 treesize of output 223 [2024-09-23 16:06:04,404 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 29 treesize of output 25 [2024-09-23 16:06:04,408 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 49 treesize of output 41 [2024-09-23 16:06:04,414 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-09-23 16:06:04,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-09-23 16:06:04,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:04,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:04,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-09-23 16:06:04,423 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-09-23 16:06:04,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:04,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2024-09-23 16:06:04,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 43 [2024-09-23 16:06:04,432 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-09-23 16:06:04,433 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 11 treesize of output 7 [2024-09-23 16:06:05,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,249 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 21 treesize of output 22 [2024-09-23 16:06:05,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,255 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-09-23 16:06:05,255 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 19 treesize of output 14 [2024-09-23 16:06:05,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,262 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 21 treesize of output 22 [2024-09-23 16:06:05,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,269 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2024-09-23 16:06:05,269 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 19 treesize of output 14 [2024-09-23 16:06:05,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,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 21 treesize of output 22 [2024-09-23 16:06:05,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,287 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2024-09-23 16:06:05,287 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 19 treesize of output 14 [2024-09-23 16:06:05,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,296 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 21 treesize of output 22 [2024-09-23 16:06:05,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 [2024-09-23 16:06:05,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-09-23 16:06:05,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,314 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2024-09-23 16:06:05,314 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 19 treesize of output 14 [2024-09-23 16:06:05,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,324 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 24 treesize of output 25 [2024-09-23 16:06:05,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:05,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-09-23 16:06:05,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,335 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 24 treesize of output 25 [2024-09-23 16:06:05,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 [2024-09-23 16:06:05,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:05,348 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 24 treesize of output 25 [2024-09-23 16:06:05,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:05,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 37 treesize of output 29 [2024-09-23 16:06:05,355 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-09-23 16:06:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-09-23 16:06:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614460913] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:06,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:06,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 14] total 31 [2024-09-23 16:06:06,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871768089] [2024-09-23 16:06:06,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:06,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-23 16:06:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:06,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-23 16:06:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=619, Unknown=6, NotChecked=220, Total=992 [2024-09-23 16:06:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:06,008 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:06,008 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.59375) internal successors, (179), 31 states have internal predecessors, (179), 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-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:06,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~state~0 1))) (let ((.cse2 (not (= c_~state~0 0))) (.cse4 (not .cse8))) (let ((.cse0 (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (let ((.cse12 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse12 |c_~#top~0.base| (store (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))) .cse4)) (.cse9 (or .cse2 (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15))) (or (not (= 0 (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base| (store (select (store (store .cse11 |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (+ (select (select (store .cse11 |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0))))))) (.cse5 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and .cse0 (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (or (not (= (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))) (= |c_~#top~0.offset| 0) (or (and (or .cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= 0 (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1027) |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0))))) (or (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1027) |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))) .cse4)) .cse5) (or (let ((.cse6 (+ c_~next_alloc_idx~0 2))) (and (or .cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base|) |c_~#top~0.offset| .cse6)) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1027) |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0))))) (or (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse7 |c_~#top~0.base| (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| .cse6))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1027) |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))) .cse4))) (= c_~next_alloc_idx~0 0)) .cse8 .cse9 (or (and .cse0 .cse9) .cse5) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)) (not (= (select (select (store (let ((.cse10 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) is different from false [2024-09-23 16:06:06,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~state~0 1))) (and (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))) (not .cse1)) (= |c_~#top~0.offset| 0) .cse1 (or (not (= c_~state~0 0)) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1030 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15))) (or (not (= 0 (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base| (store (select (store (store .cse2 |c_~#m~0.base| v_ArrVal_1034) |c_~#m2~0.base| v_ArrVal_1035) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20| v_DerPreprocessor_12) |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (+ (select (select (store .cse2 |c_~#m2~0.base| v_ArrVal_1030) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_20|) 0) 1) 0)))))))) is different from false [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:08,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-09-23 16:06:08,235 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-23 16:06:08,236 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:08,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1152718525, now seen corresponding path program 1 times [2024-09-23 16:06:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720510557] [2024-09-23 16:06:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-23 16:06:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:08,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720510557] [2024-09-23 16:06:08,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720510557] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:08,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:08,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 16:06:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057033875] [2024-09-23 16:06:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:08,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:06:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:08,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:06:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 16:06:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:08,312 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:08,313 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:08,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:08,891 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-23 16:06:08,891 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:08,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 712078743, now seen corresponding path program 1 times [2024-09-23 16:06:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:08,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598826003] [2024-09-23 16:06:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:06:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598826003] [2024-09-23 16:06:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598826003] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529564879] [2024-09-23 16:06:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:09,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:09,197 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-09-23 16:06:09,198 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-09-23 16:06:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:09,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-09-23 16:06:09,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:09,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:09,766 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:06:09,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-09-23 16:06:09,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:09,851 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:06:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-23 16:06:10,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:10,012 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:06:10,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-23 16:06:10,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:10,124 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:06:10,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 32 treesize of output 34 [2024-09-23 16:06:10,205 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-09-23 16:06:10,206 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-09-23 16:06:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:10,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:10,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-23 16:06:10,406 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= c_~state~0 0))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) is different from false [2024-09-23 16:06:10,433 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= c_~state~0 0)))) is different from false [2024-09-23 16:06:10,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:10,593 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 166 treesize of output 184 [2024-09-23 16:06:10,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 149 treesize of output 141 [2024-09-23 16:06:10,600 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 141 treesize of output 139 [2024-09-23 16:06:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-09-23 16:06:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529564879] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:10,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 15] total 44 [2024-09-23 16:06:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132433754] [2024-09-23 16:06:10,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:10,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-09-23 16:06:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-09-23 16:06:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1541, Unknown=6, NotChecked=246, Total=1980 [2024-09-23 16:06:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:10,840 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:10,841 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.933333333333333) internal successors, (177), 44 states have internal predecessors, (177), 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-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:10,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:12,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (select .cse11 |c_~#top~0.offset|))) (let ((.cse6 (= c_~state~0 1)) (.cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse10)) (.cse0 (not (= c_~state~0 0)))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread1of3ForFork0_push_#res#1| 1) (or .cse0 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| Int) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse1 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse1 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26|) 0) 1) 0))))) (= |c_~#top~0.offset| 0) (forall ((|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26|) 0) 1) 0)))) (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 1) (or .cse3 (not .cse4)) (<= |c_~#m~0.base| 3) (or .cse0 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (let ((.cse5 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse5 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse5 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse6 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse7 |c_~#top~0.base| (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (and .cse6 |c_thr1Thread2of3ForFork0_#t~switch18#1|) (and (not .cse6) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|))) (= 4 |c_~#top~0.base|) (<= 5 |c_~#m2~0.base|) .cse3 (or .cse4 (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (<= 1 |c_thr1Thread1of3ForFork0_push_#res#1|) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse9 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse9 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= .cse10 1))))) is different from false [2024-09-23 16:06:12,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (select .cse11 |c_~#top~0.offset|))) (let ((.cse6 (= c_~state~0 1)) (.cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse10)) (.cse0 (not (= c_~state~0 0)))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread1of3ForFork0_push_#res#1| 1) (or .cse0 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| Int) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse1 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse1 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26|) 0) 1) 0))))) (= |c_~#top~0.offset| 0) (forall ((|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| Int)) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_26|) 0) 1) 0)))) (or .cse3 (not .cse4)) (<= |c_~#m~0.base| 3) (or .cse0 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (let ((.cse5 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse5 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse5 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 1) (<= 1 |c_thr1Thread1of3ForFork0_push_loop_~r~0#1|) .cse6 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse7 |c_~#top~0.base| (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (and .cse6 |c_thr1Thread2of3ForFork0_#t~switch18#1|) (and (not .cse6) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|))) (= 4 |c_~#top~0.base|) (<= 5 |c_~#m2~0.base|) .cse3 (or .cse4 (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (<= 1 |c_thr1Thread1of3ForFork0_push_#res#1|) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse9 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse9 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= .cse10 1))))) is different from false [2024-09-23 16:06:12,362 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= c_~state~0 0)))) (and (or .cse0 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398))) (store (store .cse1 |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store .cse1 |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_23) |c_~#m2~0.base| v_ArrVal_1401) |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 (Array Int Int))) (not (= (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1398) |c_~#m2~0.base| v_ArrVal_1401))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) is different from false [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:12,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-09-23 16:06:13,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-23 16:06:13,081 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:13,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1537135070, now seen corresponding path program 1 times [2024-09-23 16:06:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:13,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288018496] [2024-09-23 16:06:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288018496] [2024-09-23 16:06:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288018496] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824935287] [2024-09-23 16:06:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:13,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:13,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:13,707 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-09-23 16:06:13,707 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-09-23 16:06:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:13,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-23 16:06:13,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:14,027 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-09-23 16:06:14,118 INFO L349 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2024-09-23 16:06:14,118 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 2 case distinctions, treesize of input 35 treesize of output 44 [2024-09-23 16:06:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:14,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824935287] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:14,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:14,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 37 [2024-09-23 16:06:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287189379] [2024-09-23 16:06:14,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:14,456 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-23 16:06:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-23 16:06:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1260, Unknown=3, NotChecked=0, Total=1406 [2024-09-23 16:06:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:14,457 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:14,457 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.473684210526316) internal successors, (208), 37 states have internal predecessors, (208), 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-09-23 16:06:14,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:14,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:14,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:14,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:14,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-23 16:06:14,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:14,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:14,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:14,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:14,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-23 16:06:17,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-09-23 16:06:17,222 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-23 16:06:17,222 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:17,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1586162267, now seen corresponding path program 1 times [2024-09-23 16:06:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076481732] [2024-09-23 16:06:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-23 16:06:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076481732] [2024-09-23 16:06:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076481732] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:17,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:06:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377950575] [2024-09-23 16:06:17,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:17,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:06:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:17,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:06:17,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:06:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:17,291 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:17,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-09-23 16:06:17,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-23 16:06:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:17,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-23 16:06:17,734 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:17,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 394668832, now seen corresponding path program 1 times [2024-09-23 16:06:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066747851] [2024-09-23 16:06:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-23 16:06:17,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066747851] [2024-09-23 16:06:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066747851] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:17,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:17,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 16:06:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700952882] [2024-09-23 16:06:17,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:17,873 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 16:06:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 16:06:17,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 16:06:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:17,874 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:17,874 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:17,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-23 16:06:18,112 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:18,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1418598680, now seen corresponding path program 1 times [2024-09-23 16:06:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123229776] [2024-09-23 16:06:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123229776] [2024-09-23 16:06:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123229776] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352370238] [2024-09-23 16:06:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:18,222 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-09-23 16:06:18,224 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-09-23 16:06:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:18,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-23 16:06:18,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:18,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352370238] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:18,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-23 16:06:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173507510] [2024-09-23 16:06:18,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:18,554 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-23 16:06:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-23 16:06:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-23 16:06:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:18,554 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:18,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 12 states have internal predecessors, (189), 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-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-09-23 16:06:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 16:06:18,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-09-23 16:06:18,991 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:18,991 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:18,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash 974748498, now seen corresponding path program 1 times [2024-09-23 16:06:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435496346] [2024-09-23 16:06:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:18,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-23 16:06:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435496346] [2024-09-23 16:06:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435496346] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062756818] [2024-09-23 16:06:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:19,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:19,330 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-09-23 16:06:19,331 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-09-23 16:06:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:19,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-23 16:06:19,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:19,801 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:06:19,801 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-23 16:06:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:19,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-23 16:06:19,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062756818] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:19,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-23 16:06:19,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 13] total 26 [2024-09-23 16:06:19,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136020602] [2024-09-23 16:06:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:19,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 16:06:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 16:06:19,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=559, Unknown=4, NotChecked=0, Total=650 [2024-09-23 16:06:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:19,980 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:19,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 7 states have internal predecessors, (82), 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-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 16:06:19,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:06:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:20,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-09-23 16:06:20,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-09-23 16:06:20,472 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:20,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash -728117730, now seen corresponding path program 1 times [2024-09-23 16:06:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:20,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715009971] [2024-09-23 16:06:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-23 16:06:20,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:20,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715009971] [2024-09-23 16:06:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715009971] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:20,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396573865] [2024-09-23 16:06:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:20,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:20,823 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-09-23 16:06:20,824 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-09-23 16:06:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:21,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-23 16:06:21,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:21,419 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:06:21,420 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-23 16:06:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:06:21,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-23 16:06:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396573865] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:21,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 25 [2024-09-23 16:06:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122650623] [2024-09-23 16:06:21,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:21,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-23 16:06:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-23 16:06:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=574, Unknown=1, NotChecked=0, Total=650 [2024-09-23 16:06:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:21,696 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:21,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.192307692307692) internal successors, (265), 25 states have internal predecessors, (265), 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-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:21,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:06:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-09-23 16:06:24,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-23 16:06:25,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:25,152 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:25,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1067348918, now seen corresponding path program 1 times [2024-09-23 16:06:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660276300] [2024-09-23 16:06:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-09-23 16:06:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660276300] [2024-09-23 16:06:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660276300] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:06:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715998426] [2024-09-23 16:06:25,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:25,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:06:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:06:25,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:06:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:25,332 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:25,332 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-09-23 16:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-23 16:06:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:25,966 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-09-23 16:06:25,966 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:25,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1504664207, now seen corresponding path program 1 times [2024-09-23 16:06:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867716014] [2024-09-23 16:06:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:06:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867716014] [2024-09-23 16:06:29,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867716014] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589711319] [2024-09-23 16:06:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:29,735 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-09-23 16:06:29,736 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-09-23 16:06:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:29,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-23 16:06:29,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:06:30,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:30,436 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 27 treesize of output 22 [2024-09-23 16:06:30,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:30,444 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 34 treesize of output 22 [2024-09-23 16:06:30,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:30,456 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-09-23 16:06:30,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2024-09-23 16:06:30,462 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 8 treesize of output 1 [2024-09-23 16:06:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:30,804 INFO L349 Elim1Store]: treesize reduction 60, result has 46.4 percent of original size [2024-09-23 16:06:30,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 270 treesize of output 298 [2024-09-23 16:06:30,812 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 158 [2024-09-23 16:06:30,816 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 152 treesize of output 148 [2024-09-23 16:06:30,820 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 149 [2024-09-23 16:06:30,826 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 143 treesize of output 139 [2024-09-23 16:06:31,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:06:31,150 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 27 treesize of output 22 [2024-09-23 16:06:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-23 16:06:31,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:06:31,405 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 (Array Int Int)) (|~#m~0.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_~#m~0.base| (store v_ArrVal_2582 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0) (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2582) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1))) is different from false [2024-09-23 16:06:31,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (and (forall ((v_DerPreprocessor_31 Int) (v_ArrVal_2582 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse0 (store (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| .cse0))) (or (not (= v_DerPreprocessor_31 (select .cse0 |c_~#top~0.offset|))) (= (select (select (store .cse1 |c_~#m~0.base| v_ArrVal_2582) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse1 |c_~#m~0.base| (store v_ArrVal_2582 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2582 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~newTop~0#1| Int) (|~#m~0.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_30) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~newTop~0#1|)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= (select (select (store .cse3 |c_~#m~0.base| (store v_ArrVal_2582 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0) (= (select (select (store .cse3 |c_~#m~0.base| v_ArrVal_2582) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= |thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))))) (not .cse4)) (or .cse4 (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_2582 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29))) (or (= (select (select (store .cse5 |c_~#m~0.base| v_ArrVal_2582) |c_~#m2~0.base|) |c_~#m2~0.offset|) 1) (= (select (select (store .cse5 |c_~#m~0.base| (store v_ArrVal_2582 |~#m~0.offset| 0)) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))))))) is different from false [2024-09-23 16:06:31,518 INFO L349 Elim1Store]: treesize reduction 40, result has 50.6 percent of original size [2024-09-23 16:06:31,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 529 treesize of output 496 [2024-09-23 16:06:31,548 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-23 16:06:31,548 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 322 treesize of output 320 [2024-09-23 16:06:31,554 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 291 treesize of output 287 [2024-09-23 16:06:31,561 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 311 treesize of output 295 [2024-09-23 16:06:31,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:06:31,583 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 336 treesize of output 344 [2024-09-23 16:06:31,591 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 295 treesize of output 291 [2024-09-23 16:06:31,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:06:31,757 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-09-23 16:06:31,768 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-09-23 16:06:31,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 108 treesize of output 1 [2024-09-23 16:06:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 8 not checked. [2024-09-23 16:06:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589711319] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:06:31,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:06:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 6, 5] total 46 [2024-09-23 16:06:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906256949] [2024-09-23 16:06:31,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:06:31,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-23 16:06:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:31,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-23 16:06:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1767, Unknown=2, NotChecked=174, Total=2162 [2024-09-23 16:06:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:31,950 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:31,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.382978723404255) internal successors, (300), 46 states have internal predecessors, (300), 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-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:31,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:34,034 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 [0] [2024-09-23 16:06:36,091 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 [0] [2024-09-23 16:06:38,621 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 [0] [2024-09-23 16:06:51,127 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 [0] [2024-09-23 16:06:56,274 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 [0] [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:06:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-09-23 16:06:56,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-23 16:06:56,485 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-09-23 16:06:56,485 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:56,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash -416326788, now seen corresponding path program 1 times [2024-09-23 16:06:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216320358] [2024-09-23 16:06:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-09-23 16:06:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216320358] [2024-09-23 16:06:56,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216320358] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:56,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:06:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491135830] [2024-09-23 16:06:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:56,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:06:56,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:56,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:06:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:06:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:56,658 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:56,658 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-09-23 16:06:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:06:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:57,819 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-09-23 16:06:57,820 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:57,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1209724561, now seen corresponding path program 1 times [2024-09-23 16:06:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:57,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697934063] [2024-09-23 16:06:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-09-23 16:06:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697934063] [2024-09-23 16:06:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697934063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 16:06:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904212218] [2024-09-23 16:06:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:57,929 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 16:06:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 16:06:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 16:06:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:57,929 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:57,929 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:57,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:58,275 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-09-23 16:06:58,275 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:58,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 687580201, now seen corresponding path program 2 times [2024-09-23 16:06:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120278504] [2024-09-23 16:06:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-09-23 16:06:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120278504] [2024-09-23 16:06:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120278504] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:06:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:06:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 16:06:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126313086] [2024-09-23 16:06:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:06:58,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:06:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:06:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:06:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:06:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:58,513 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:06:58,513 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:58,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:06:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-09-23 16:06:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:06:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:06:59,277 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-09-23 16:06:59,277 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:06:59,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:06:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1202202399, now seen corresponding path program 1 times [2024-09-23 16:06:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:06:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339694323] [2024-09-23 16:06:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:06:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:06:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 372 proven. 176 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-09-23 16:06:59,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:06:59,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339694323] [2024-09-23 16:06:59,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339694323] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:06:59,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829258549] [2024-09-23 16:06:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:06:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:06:59,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:06:59,769 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 16:06:59,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-23 16:07:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:00,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-23 16:07:00,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:07:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 372 proven. 176 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-09-23 16:07:00,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:07:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 372 proven. 176 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-09-23 16:07:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829258549] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:07:00,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:07:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-09-23 16:07:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643150670] [2024-09-23 16:07:00,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:07:00,576 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-23 16:07:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:07:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-23 16:07:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-23 16:07:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:00,577 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:07:00,577 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.08) internal successors, (377), 24 states have internal predecessors, (377), 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-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:00,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:01,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-09-23 16:07:01,262 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-09-23 16:07:01,262 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:07:01,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:07:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1152240929, now seen corresponding path program 2 times [2024-09-23 16:07:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:07:01,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840302468] [2024-09-23 16:07:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:07:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 860 proven. 968 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-09-23 16:07:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:07:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840302468] [2024-09-23 16:07:02,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840302468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:07:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349032839] [2024-09-23 16:07:02,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-23 16:07:02,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:07:02,437 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-09-23 16:07:02,438 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-09-23 16:07:03,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-23 16:07:03,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 16:07:03,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 2898 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-23 16:07:03,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:07:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 20 proven. 1783 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-09-23 16:07:03,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:07:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 20 proven. 1783 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-09-23 16:07:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349032839] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:07:04,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:07:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-09-23 16:07:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917095289] [2024-09-23 16:07:04,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:07:04,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-23 16:07:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:07:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-23 16:07:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-09-23 16:07:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:04,204 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:07:04,204 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 15.653061224489797) internal successors, (767), 48 states have internal predecessors, (767), 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-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:04,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-09-23 16:07:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:06,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-09-23 16:07:06,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:06,432 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:07:06,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:07:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 449816667, now seen corresponding path program 1 times [2024-09-23 16:07:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:07:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680796358] [2024-09-23 16:07:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:07:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 540 proven. 878 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-09-23 16:07:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:07:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680796358] [2024-09-23 16:07:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680796358] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:07:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696374675] [2024-09-23 16:07:20,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:20,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:07:20,099 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 16:07:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-23 16:07:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:20,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 3483 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-23 16:07:20,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:07:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 3054 trivial. 0 not checked. [2024-09-23 16:07:20,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-23 16:07:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696374675] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:07:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-23 16:07:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 19 [2024-09-23 16:07:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293442318] [2024-09-23 16:07:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:07:20,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:07:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:07:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:07:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-09-23 16:07:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:20,873 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:07:20,873 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 97 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:20,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:21,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-09-23 16:07:21,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-09-23 16:07:21,764 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:07:21,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:07:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -659683901, now seen corresponding path program 1 times [2024-09-23 16:07:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:07:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046569387] [2024-09-23 16:07:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:07:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3563 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2024-09-23 16:07:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:07:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046569387] [2024-09-23 16:07:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046569387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:07:22,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 16:07:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 16:07:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024226382] [2024-09-23 16:07:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:07:22,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 16:07:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:07:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 16:07:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 16:07:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:22,483 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:07:22,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:22,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:22,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:42,122 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 [0] [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:46,034 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-09-23 16:07:46,034 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:07:46,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:07:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1574106584, now seen corresponding path program 1 times [2024-09-23 16:07:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:07:46,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307951594] [2024-09-23 16:07:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:07:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 2674 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-23 16:07:48,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:07:48,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307951594] [2024-09-23 16:07:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307951594] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:07:48,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965611083] [2024-09-23 16:07:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:07:48,210 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-09-23 16:07:48,210 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-09-23 16:07:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:48,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 3176 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-23 16:07:48,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:07:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 2709 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-23 16:07:49,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-23 16:07:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965611083] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 16:07:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-23 16:07:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [35] total 36 [2024-09-23 16:07:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118766556] [2024-09-23 16:07:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 16:07:49,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-23 16:07:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:07:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-23 16:07:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2024-09-23 16:07:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:49,364 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:07:49,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 14.82857142857143) internal successors, (519), 34 states have internal predecessors, (519), 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-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:49,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:49,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:07:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:07:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:07:54,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-09-23 16:07:54,481 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:54,482 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:07:54,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:07:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1117550315, now seen corresponding path program 1 times [2024-09-23 16:07:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:07:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311484154] [2024-09-23 16:07:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:07:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2266 backedges. 43 proven. 30 refuted. 0 times theorem prover too weak. 2193 trivial. 0 not checked. [2024-09-23 16:07:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:07:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311484154] [2024-09-23 16:07:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311484154] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:07:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100025820] [2024-09-23 16:07:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:07:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:07:55,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:07:55,553 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-09-23 16:07:55,554 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-09-23 16:07:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:07:56,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-09-23 16:07:56,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:07:59,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:07:59,053 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-09-23 16:07:59,097 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:07:59,098 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-23 16:07:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2266 backedges. 2 proven. 2264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:07:59,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:07:59,298 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8711 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_8711))) (or (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_34 (Array Int Int))) (not (= (select (select (store .cse0 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_34) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_ArrVal_8711 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_8711))) (let ((.cse3 (select .cse2 |c_~#top~0.base|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse1 (store .cse2 |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))))))) is different from false [2024-09-23 16:07:59,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:07:59,321 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 438 treesize of output 430 [2024-09-23 16:07:59,326 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 135 [2024-09-23 16:07:59,339 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 140 treesize of output 128 [2024-09-23 16:07:59,342 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-09-23 16:08:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2266 backedges. 160 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 34 not checked. [2024-09-23 16:08:00,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100025820] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:08:00,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:08:00,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 40, 38] total 84 [2024-09-23 16:08:00,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017706219] [2024-09-23 16:08:00,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:08:00,892 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-09-23 16:08:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:08:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-09-23 16:08:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1619, Invalid=5354, Unknown=3, NotChecked=164, Total=7140 [2024-09-23 16:08:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:08:00,895 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:08:00,895 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 12.388235294117647) internal successors, (1053), 84 states have internal predecessors, (1053), 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-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:08:00,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:08:00,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:08:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:08:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:08:20,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-09-23 16:08:20,938 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:08:20,938 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:08:20,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:08:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 971294542, now seen corresponding path program 1 times [2024-09-23 16:08:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:08:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074228176] [2024-09-23 16:08:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:08:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:08:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:08:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 18 proven. 376 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2024-09-23 16:08:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:08:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074228176] [2024-09-23 16:08:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074228176] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:08:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365626370] [2024-09-23 16:08:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:08:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:08:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:08:26,783 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-09-23 16:08:26,783 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-09-23 16:08:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:08:27,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-09-23 16:08:27,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:08:30,345 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:08:30,345 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-23 16:08:30,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:08:30,432 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-23 16:08:30,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 32 treesize of output 32 [2024-09-23 16:08:30,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:08:30,489 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 24 treesize of output 17 [2024-09-23 16:08:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 0 proven. 2224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:08:30,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:08:30,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= (select .cse2 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or .cse0 (forall ((v_ArrVal_9722 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_35 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_35) |c_~#m~0.base| v_ArrVal_9722) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_9722 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)))) (store .cse1 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) |c_~#m~0.base| v_ArrVal_9722) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) is different from false [2024-09-23 16:08:30,742 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-23 16:08:30,742 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 2 case distinctions, treesize of input 35 treesize of output 38 [2024-09-23 16:08:30,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:08:30,749 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 51 treesize of output 50 [2024-09-23 16:08:30,751 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 20 treesize of output 18 [2024-09-23 16:08:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 200 proven. 2006 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-09-23 16:08:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365626370] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:08:32,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:08:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 40, 37] total 88 [2024-09-23 16:08:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707035085] [2024-09-23 16:08:32,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:08:32,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-09-23 16:08:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:08:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-09-23 16:08:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1799, Invalid=6033, Unknown=4, NotChecked=174, Total=8010 [2024-09-23 16:08:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:08:32,397 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:08:32,397 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 12.101123595505618) internal successors, (1077), 89 states have internal predecessors, (1077), 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-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:08:32,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:08:32,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:09:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2024-09-23 16:09:01,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-09-23 16:09:01,980 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:01,981 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:09:01,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:09:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1177872655, now seen corresponding path program 1 times [2024-09-23 16:09:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:09:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586550817] [2024-09-23 16:09:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:09:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 144 proven. 272 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2024-09-23 16:09:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:09:03,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586550817] [2024-09-23 16:09:03,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586550817] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:09:03,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663351892] [2024-09-23 16:09:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:09:03,213 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-09-23 16:09:03,214 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-09-23 16:09:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:04,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-23 16:09:04,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:09:04,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:09:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-09-23 16:09:04,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-23 16:09:04,634 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 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-23 16:09:04,635 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 8 treesize of output 7 [2024-09-23 16:09:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:04,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-09-23 16:09:04,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:04,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-23 16:09:04,657 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-09-23 16:09:04,666 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-09-23 16:09:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 153 proven. 263 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2024-09-23 16:09:04,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:09:05,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= (select .cse2 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or (forall ((v_ArrVal_10736 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#m~0.base| v_ArrVal_10736) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) .cse0) (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (and (or (not .cse1) (forall ((v_ArrVal_10736 (Array Int Int)) (v_ArrVal_10734 Int)) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_ArrVal_10734)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1)) |c_~#m~0.base| v_ArrVal_10736) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) (or .cse1 (forall ((v_ArrVal_10736 (Array Int Int)) (v_ArrVal_10734 Int) (v_DerPreprocessor_36 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_36) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_ArrVal_10734)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1)) |c_~#m~0.base| v_ArrVal_10736) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))))))) is different from false [2024-09-23 16:09:05,543 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-09-23 16:09:05,543 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 2 case distinctions, treesize of input 21 treesize of output 32 [2024-09-23 16:09:05,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:09:05,549 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 43 treesize of output 39 [2024-09-23 16:09:05,553 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-09-23 16:09:05,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:05,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:06,338 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-09-23 16:09:06,338 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 19 treesize of output 14 [2024-09-23 16:09:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 144 proven. 221 refuted. 33 times theorem prover too weak. 1848 trivial. 18 not checked. [2024-09-23 16:09:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663351892] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:09:06,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:09:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-09-23 16:09:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412445583] [2024-09-23 16:09:06,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:09:06,677 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-23 16:09:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:09:06,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-23 16:09:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=206, Unknown=10, NotChecked=30, Total=306 [2024-09-23 16:09:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:06,678 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:09:06,678 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 17 states have internal predecessors, (169), 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-09-23 16:09:06,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:06,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:06,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:06,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 271 states. [2024-09-23 16:09:06,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:09:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:09:15,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-09-23 16:09:15,214 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:15,215 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:09:15,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:09:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1059632152, now seen corresponding path program 1 times [2024-09-23 16:09:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:09:15,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435289606] [2024-09-23 16:09:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:09:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 412 proven. 30 refuted. 0 times theorem prover too weak. 2439 trivial. 0 not checked. [2024-09-23 16:09:16,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:09:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435289606] [2024-09-23 16:09:16,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435289606] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:09:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348444375] [2024-09-23 16:09:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:16,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:09:16,305 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-09-23 16:09:16,306 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-09-23 16:09:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:17,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 3246 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-23 16:09:17,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:09:18,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:18,084 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-09-23 16:09:18,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-23 16:09:18,099 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 8 treesize of output 1 [2024-09-23 16:09:18,106 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 18 treesize of output 7 [2024-09-23 16:09:18,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:18,109 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 1 [2024-09-23 16:09:18,127 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 50 treesize of output 42 [2024-09-23 16:09:18,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2024-09-23 16:09:18,131 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2024-09-23 16:09:18,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 5 treesize of output 3 [2024-09-23 16:09:18,140 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 11 treesize of output 7 [2024-09-23 16:09:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 412 proven. 30 refuted. 0 times theorem prover too weak. 2439 trivial. 0 not checked. [2024-09-23 16:09:18,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:09:18,940 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 18 treesize of output 14 [2024-09-23 16:09:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 376 proven. 30 refuted. 36 times theorem prover too weak. 2439 trivial. 0 not checked. [2024-09-23 16:09:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348444375] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:09:19,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:09:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-23 16:09:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044482655] [2024-09-23 16:09:19,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:09:19,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-23 16:09:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:09:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-23 16:09:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=5, NotChecked=0, Total=132 [2024-09-23 16:09:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:19,335 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:09:19,335 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.166666666666668) internal successors, (194), 11 states have internal predecessors, (194), 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-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:19,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:09:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:09:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:09:28,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-09-23 16:09:28,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-09-23 16:09:28,196 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:09:28,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:09:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -345249972, now seen corresponding path program 2 times [2024-09-23 16:09:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:09:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543280102] [2024-09-23 16:09:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:09:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 1356 proven. 1137 refuted. 0 times theorem prover too weak. 2056 trivial. 0 not checked. [2024-09-23 16:09:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:09:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543280102] [2024-09-23 16:09:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543280102] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:09:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993473587] [2024-09-23 16:09:31,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-23 16:09:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:09:31,895 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-09-23 16:09:31,896 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-09-23 16:09:32,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-23 16:09:32,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 16:09:32,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 3984 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-23 16:09:32,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:09:34,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:09:34,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-09-23 16:09:34,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-23 16:09:34,920 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-09-23 16:09:34,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-23 16:09:34,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-23 16:09:34,937 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 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-23 16:09:34,940 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 8 treesize of output 7 [2024-09-23 16:09:34,958 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-09-23 16:09:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 1343 proven. 1119 refuted. 0 times theorem prover too weak. 2087 trivial. 0 not checked. [2024-09-23 16:09:34,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:09:35,014 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13169 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_13169) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) is different from false [2024-09-23 16:09:35,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (and (or (forall ((v_ArrVal_13164 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_13164) |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_13169 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#m~0.base| v_ArrVal_13169) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_13169 (Array Int Int)) (v_ArrVal_13167 Int) (v_ArrVal_13164 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_13164))) (let ((.cse2 (select .cse1 |c_~#top~0.base|))) (or (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_41) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select (store .cse1 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_ArrVal_13167)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1)) |c_~#m~0.base| v_ArrVal_13169) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select .cse2 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))))))) (or (not .cse0) (forall ((v_ArrVal_13169 (Array Int Int)) (v_ArrVal_13167 Int) (v_ArrVal_13164 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_13164))) (let ((.cse4 (select .cse3 |c_~#top~0.base|))) (or (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select (store .cse3 |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_13167)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1)) |c_~#m~0.base| v_ArrVal_13169) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select .cse4 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))))))))) is different from false [2024-09-23 16:09:36,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:36,189 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 33 treesize of output 29 [2024-09-23 16:09:36,192 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-09-23 16:09:36,196 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 37 treesize of output 33 [2024-09-23 16:09:36,199 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-09-23 16:09:36,202 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-09-23 16:09:36,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:36,362 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-09-23 16:09:36,363 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 19 treesize of output 18 [2024-09-23 16:09:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 1218 proven. 629 refuted. 19 times theorem prover too weak. 2084 trivial. 599 not checked. [2024-09-23 16:09:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993473587] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:09:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:09:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 24 [2024-09-23 16:09:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322843275] [2024-09-23 16:09:37,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:09:37,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-23 16:09:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:09:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-23 16:09:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=412, Unknown=9, NotChecked=86, Total=600 [2024-09-23 16:09:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:37,322 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:09:37,322 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.64) internal successors, (366), 24 states have internal predecessors, (366), 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-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 164 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:09:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:09:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:09:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:09:46,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-09-23 16:09:47,173 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-09-23 16:09:47,174 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:09:47,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:09:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1274778538, now seen corresponding path program 1 times [2024-09-23 16:09:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:09:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010827147] [2024-09-23 16:09:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:09:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1983 trivial. 0 not checked. [2024-09-23 16:09:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:09:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010827147] [2024-09-23 16:09:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010827147] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:09:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638792262] [2024-09-23 16:09:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:09:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:09:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:09:49,927 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-09-23 16:09:49,927 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-09-23 16:09:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:09:50,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-09-23 16:09:50,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:09:53,906 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 0 case distinctions, treesize of input 27 treesize of output 34 [2024-09-23 16:09:53,924 INFO L349 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2024-09-23 16:09:53,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2024-09-23 16:09:53,928 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 0 case distinctions, treesize of input 21 treesize of output 16 [2024-09-23 16:09:53,944 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 8 treesize of output 7 [2024-09-23 16:09:53,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-09-23 16:09:54,055 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-09-23 16:09:54,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:54,169 INFO L349 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2024-09-23 16:09:54,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 61 [2024-09-23 16:09:54,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:54,295 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-09-23 16:09:54,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 48 [2024-09-23 16:09:54,566 INFO L349 Elim1Store]: treesize reduction 169, result has 31.0 percent of original size [2024-09-23 16:09:54,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 73 treesize of output 149 [2024-09-23 16:09:54,583 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 8 treesize of output 7 [2024-09-23 16:09:54,756 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 0 case distinctions, treesize of input 31 treesize of output 14 [2024-09-23 16:09:54,761 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 0 case distinctions, treesize of input 90 treesize of output 83 [2024-09-23 16:09:54,934 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-23 16:09:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-09-23 16:09:55,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-23 16:09:55,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 84 treesize of output 82 [2024-09-23 16:09:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:55,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:09:55,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 112 [2024-09-23 16:09:55,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-23 16:09:55,453 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 8 treesize of output 1 [2024-09-23 16:09:55,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:55,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-09-23 16:09:55,523 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 8 treesize of output 7 [2024-09-23 16:09:55,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-09-23 16:09:55,729 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-09-23 16:09:55,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-09-23 16:09:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 1755 proven. 628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 16:09:55,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 16:09:57,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,402 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-09-23 16:09:57,404 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-09-23 16:09:57,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,420 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-09-23 16:09:57,422 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-09-23 16:09:57,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:57,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:57,434 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-09-23 16:09:57,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (let ((.cse2 (not .cse1))) (let ((.cse0 (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)) (not (= (+ (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_14208))) (store .cse4 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0))))))) (and (or (and .cse0 (or (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_ArrVal_14211 Int) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (+ 1 (select (select (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_58) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)) 0)) (not (= (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)))) .cse1)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (or (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_56 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (+ (select (select (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))))) .cse1) (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (+ (select (select (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_14208))) (store .cse3 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)))))) (or (and .cse0 (or (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)) (not (= (+ (select (select (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0)))) .cse1)) (not (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))))))) is different from false [2024-09-23 16:09:57,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)) (not (= (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_14208))) (store .cse2 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0)))))) (and (or (not (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) .cse0) (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_14208))) (store .cse1 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))))) (or (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) .cse0))) is different from false [2024-09-23 16:09:57,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_ArrVal_14207 (Array Int Int)) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0)) (not (= (+ (select (select (let ((.cse2 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_14207) |c_~#top~0.base| v_ArrVal_14208))) (store .cse2 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0)))))) (and (forall ((|thr1Thread1of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_14207 (Array Int Int)) (v_ArrVal_14208 (Array Int Int)) (v_ArrVal_14211 Int)) (or (not (= (+ (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_14207) |c_~#top~0.base| v_ArrVal_14208))) (store .cse0 |thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_14211) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))))) (or .cse1 (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (or (not (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) .cse1))) is different from false [2024-09-23 16:09:58,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:09:58,054 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 186 treesize of output 191 [2024-09-23 16:09:58,153 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 12 treesize of output 10 [2024-09-23 16:09:58,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (= |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 0)) (.cse12 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse15 |c_~#top~0.offset|)))) (and (or (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= (select (select .cse0 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (forall ((v_ArrVal_14207 (Array Int Int)) (v_ArrVal_14208 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177| Int)) (or (not (= (+ (select (select .cse0 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177|) 0) 1) 0)) (not (= (+ (select (store (select (store (store .cse0 |c_~#m~0.base| v_ArrVal_14207) |c_~#top~0.base| v_ArrVal_14208) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1) 0))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (or (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int) (v_prenex_92 Int)) (or (= |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| |c_~#top~0.base|) (not (= (+ (select (select (let ((.cse1 (store (store .cse2 |c_~#m~0.base| v_prenex_93) |c_~#top~0.base| v_prenex_94))) (store .cse1 v_prenex_92 (store (select .cse1 v_prenex_92) 0 1))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0)))) (not (= (select (select .cse2 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not (= (+ (select (select .cse2 |c_~#top~0.base|) 0) 1) 0))))) (or .cse3 (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= (select (select .cse4 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not (= (+ (select (select .cse4 |c_~#top~0.base|) 0) 1) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (let ((.cse6 (select .cse5 |c_~#m~0.base|))) (or (forall ((v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (not (= 0 (+ (select (store (select (store (store .cse5 |c_~#m~0.base| v_prenex_120) |c_~#top~0.base| v_prenex_121) |c_~#m~0.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1)))) (not (= (+ (select .cse6 0) 1) 0)) (not (= (select .cse6 |c_~#m~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (let ((.cse9 (select .cse8 |c_~#m~0.base|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_96 Int) (v_prenex_99 (Array Int Int)) (v_prenex_97 Int)) (or (not (= (+ 1 (select (select (let ((.cse7 (store (store .cse8 |c_~#m~0.base| v_prenex_98) |c_~#top~0.base| v_prenex_99))) (store .cse7 v_prenex_96 (store (select .cse7 v_prenex_96) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) v_prenex_97) 0)) 0)) (= |c_~#m~0.base| v_prenex_97))) (not (= (+ (select .cse9 0) 1) 0)) (not (= (select .cse9 |c_~#m~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_59))) (let ((.cse11 (select .cse10 |c_~#m~0.base|))) (or (forall ((v_prenex_118 (Array Int Int)) (v_prenex_117 (Array Int Int)) (v_prenex_119 Int)) (or (= |c_~#m~0.base| v_prenex_119) (not (= (+ (select (store (select (store (store .cse10 |c_~#m~0.base| v_prenex_117) |c_~#top~0.base| v_prenex_118) v_prenex_119) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1) 0)))) (not (= (+ (select .cse11 0) 1) 0)) (not (= (select .cse11 |c_~#m~0.offset|) 0))))))) .cse12) (or (let ((.cse16 (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((v_ArrVal_14200 Int)) (or (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse13 (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_99 (Array Int Int))) (not (= (+ (select (store (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_prenex_98) |c_~#top~0.base| v_prenex_99) |c_~#m~0.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1) 0))) (not (= 0 (+ (select .cse14 0) 1))) (not (= (select .cse14 |c_~#m~0.offset|) 0)))))))) (forall ((v_ArrVal_14200 Int)) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse17 (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse18 (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse17) |c_~#m~0.base|))) (or (forall ((v_prenex_97 Int)) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_99 (Array Int Int))) (not (= (+ (select (store (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse17) |c_~#m~0.base| v_prenex_98) |c_~#top~0.base| v_prenex_99) v_prenex_97) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1) 0))) (= |c_~#m~0.base| v_prenex_97))) (not (= 0 (+ (select .cse18 0) 1))) (not (= (select .cse18 |c_~#m~0.offset|) 0)))))) (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (forall ((v_ArrVal_14200 Int)) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse21 (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21) |c_~#m~0.base|))) (or (not (= 0 (+ (select .cse19 0) 1))) (not (= (select .cse19 |c_~#m~0.offset|) 0)) (forall ((v_prenex_97 Int)) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_96 Int) (v_prenex_99 (Array Int Int))) (not (= (+ (select (select (let ((.cse20 (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21) |c_~#m~0.base| v_prenex_98) |c_~#top~0.base| v_prenex_99))) (store .cse20 v_prenex_96 (store (select .cse20 v_prenex_96) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1))) v_prenex_97) 0) 1) 0))) (= |c_~#m~0.base| v_prenex_97))))))) (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (forall ((v_ArrVal_14200 Int)) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse23 (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse22 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse23))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177| Int)) (or (forall ((v_ArrVal_14207 (Array Int Int)) (v_ArrVal_14208 (Array Int Int))) (not (= (+ (select (store (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse23) |c_~#m~0.base| v_ArrVal_14207) |c_~#top~0.base| v_ArrVal_14208) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| 1) 0) 1) 0))) (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_177|) 0) 1) 0)))))))) (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (forall ((v_ArrVal_14200 Int)) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse25 (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse26 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse25))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| Int)) (or (= |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239| |c_~#top~0.base|) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_prenex_92 Int)) (not (= (+ (select (select (let ((.cse24 (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse25) |c_~#m~0.base| v_prenex_93) |c_~#top~0.base| v_prenex_94))) (store .cse24 v_prenex_92 (store (select .cse24 v_prenex_92) 0 1))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_239|) 0) 1) 0))))) (not (= (select (select .cse26 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (not (= (+ (select (select .cse26 |c_~#top~0.base|) 0) 1) 0)))))) (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_14200 Int)) (let ((.cse27 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_14200)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (not (= (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|) 0)) (< v_ArrVal_14200 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (not (= (+ (select (select .cse27 |c_~#top~0.base|) 0) 1) 0))))) .cse3))) (not .cse12))))) is different from false [2024-09-23 16:09:58,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:58,928 INFO L349 Elim1Store]: treesize reduction 37, result has 50.7 percent of original size [2024-09-23 16:09:58,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 255 treesize of output 249 [2024-09-23 16:09:58,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:09:58,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 262 treesize of output 284 [2024-09-23 16:09:58,973 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 104 treesize of output 100 [2024-09-23 16:09:59,104 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 12 treesize of output 10 [2024-09-23 16:09:59,163 INFO L349 Elim1Store]: treesize reduction 78, result has 33.3 percent of original size [2024-09-23 16:09:59,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 196 treesize of output 227 [2024-09-23 16:09:59,246 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 0 case distinctions, treesize of input 18 treesize of output 6 [2024-09-23 16:09:59,265 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 0 case distinctions, treesize of input 18 treesize of output 6 [2024-09-23 16:09:59,356 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-09-23 16:09:59,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 69 [2024-09-23 16:09:59,406 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-23 16:09:59,406 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 28 treesize of output 33 [2024-09-23 16:09:59,448 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-23 16:09:59,449 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 28 treesize of output 29 [2024-09-23 16:09:59,473 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-23 16:09:59,473 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 58 treesize of output 59 [2024-09-23 16:09:59,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-09-23 16:09:59,504 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-09-23 16:09:59,504 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 101 treesize of output 98 [2024-09-23 16:09:59,540 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-09-23 16:09:59,541 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 29 treesize of output 30 [2024-09-23 16:09:59,546 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-09-23 16:09:59,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 33 treesize of output 29 [2024-09-23 16:09:59,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:09:59,616 INFO L349 Elim1Store]: treesize reduction 82, result has 41.0 percent of original size [2024-09-23 16:09:59,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 18801 treesize of output 17154 [2024-09-23 16:09:59,816 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-09-23 16:09:59,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1781 treesize of output 1803 [2024-09-23 16:09:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:09:59,972 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 1118 treesize of output 1086 [2024-09-23 16:10:00,589 INFO L349 Elim1Store]: treesize reduction 78, result has 33.3 percent of original size [2024-09-23 16:10:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 212 treesize of output 241 [2024-09-23 16:10:00,709 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-23 16:10:00,710 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 100 treesize of output 106 [2024-09-23 16:10:00,802 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-09-23 16:10:00,898 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-09-23 16:10:00,904 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-09-23 16:10:00,904 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 14 [2024-09-23 16:10:00,911 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 55 treesize of output 47 [2024-09-23 16:10:00,964 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-09-23 16:10:00,964 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 71 treesize of output 80 [2024-09-23 16:10:01,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-23 16:10:01,038 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-09-23 16:10:01,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22929 treesize of output 19922 [2024-09-23 16:10:01,101 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-23 16:10:01,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 704 treesize of output 692 [2024-09-23 16:10:01,145 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2024-09-23 16:10:01,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 713 treesize of output 724 [2024-09-23 16:10:01,166 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 620 treesize of output 588 [2024-09-23 16:10:01,349 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-09-23 16:10:01,377 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-09-23 16:10:01,395 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-09-23 16:10:01,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:10:01,417 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 35 treesize of output 39 [2024-09-23 16:10:01,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:10:01,461 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 14 treesize of output 18 [2024-09-23 16:10:01,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:10:01,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-09-23 16:10:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:10:01,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:10:01,569 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 78 [2024-09-23 16:10:01,601 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-23 16:10:01,601 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 67 treesize of output 1 [2024-09-23 16:10:01,608 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-23 16:10:01,608 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 99 treesize of output 1 [2024-09-23 16:10:01,640 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-09-23 16:10:01,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1521 treesize of output 1442 [2024-09-23 16:10:01,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:10:01,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 237 treesize of output 231 [2024-09-23 16:10:01,708 INFO L349 Elim1Store]: treesize reduction 10, result has 79.6 percent of original size [2024-09-23 16:10:01,709 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 333 treesize of output 353 [2024-09-23 16:10:01,756 INFO L349 Elim1Store]: treesize reduction 35, result has 50.7 percent of original size [2024-09-23 16:10:01,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 169 treesize of output 187 [2024-09-23 16:10:02,111 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 12 treesize of output 10 [2024-09-23 16:10:02,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:10:02,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2024-09-23 16:10:02,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-23 16:10:02,359 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 12 treesize of output 16 [2024-09-23 16:10:02,370 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-09-23 16:10:02,380 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-09-23 16:10:02,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-23 16:10:02,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-09-23 16:10:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 1755 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 96 not checked. [2024-09-23 16:10:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638792262] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 16:10:11,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 16:10:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 49, 48] total 103 [2024-09-23 16:10:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422246262] [2024-09-23 16:10:11,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 16:10:11,310 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-09-23 16:10:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 16:10:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-09-23 16:10:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1989, Invalid=7870, Unknown=57, NotChecked=796, Total=10712 [2024-09-23 16:10:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:10:11,313 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 16:10:11,313 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 10.509615384615385) internal successors, (1093), 103 states have internal predecessors, (1093), 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-09-23 16:10:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:10:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 164 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 278 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:10:11,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 16:10:17,227 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-09-23 16:10:27,491 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-09-23 16:10:29,614 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-09-23 16:10:31,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-09-23 16:10:33,763 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-09-23 16:10:36,084 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-09-23 16:10:38,140 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-09-23 16:10:41,198 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-09-23 16:10:43,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:10:46,314 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 [0, 1] [2024-09-23 16:10:48,323 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-09-23 16:11:03,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-09-23 16:11:06,599 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-09-23 16:11:08,940 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-09-23 16:11:11,250 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-09-23 16:11:13,860 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 [0, 1] [2024-09-23 16:11:15,862 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 [0, 1] [2024-09-23 16:11:17,993 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 [0, 1] [2024-09-23 16:11:20,171 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-09-23 16:11:22,189 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-09-23 16:11:24,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 [0, 1] [2024-09-23 16:11:43,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:11:46,610 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-09-23 16:11:48,630 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-09-23 16:11:50,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-23 16:11:52,497 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 [0, 1] [2024-09-23 16:12:09,506 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-09-23 16:12:11,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-09-23 16:12:13,612 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-09-23 16:12:16,806 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-09-23 16:12:20,496 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-09-23 16:12:22,545 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 [0, 1] [2024-09-23 16:12:24,629 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 [0, 1] [2024-09-23 16:12:26,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-09-23 16:12:28,856 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-09-23 16:12:30,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 [0, 1] [2024-09-23 16:12:33,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 [0, 1] [2024-09-23 16:12:56,527 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-09-23 16:13:01,548 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-09-23 16:13:03,617 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-09-23 16:13:06,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-09-23 16:13:09,566 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-09-23 16:13:35,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-09-23 16:13:37,636 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-09-23 16:13:40,788 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-09-23 16:13:42,853 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-09-23 16:13:46,295 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-09-23 16:13:51,280 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-09-23 16:13:53,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-23 16:13:58,994 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-09-23 16:14:03,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:14:05,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:14:23,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:14:26,623 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 [0, 1] [2024-09-23 16:14:28,626 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 [0, 1] [2024-09-23 16:14:30,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-23 16:14:33,036 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-09-23 16:14:35,316 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 [0, 1] [2024-09-23 16:14:37,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-23 16:14:44,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:14:46,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:15:01,271 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-09-23 16:15:03,310 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-09-23 16:15:14,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-23 16:15:54,060 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-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-09-23 16:18:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 279 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-23 16:18:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 751 states. [2024-09-23 16:18:49,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-09-23 16:18:50,049 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-09-23 16:18:50,050 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-23 16:18:50,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 16:18:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1473505362, now seen corresponding path program 2 times [2024-09-23 16:18:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 16:18:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628333161] [2024-09-23 16:18:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 16:18:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 16:18:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 16:18:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2287 backedges. 0 proven. 439 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2024-09-23 16:18:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 16:18:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628333161] [2024-09-23 16:18:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628333161] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 16:18:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412730967] [2024-09-23 16:18:56,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-23 16:18:56,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 16:18:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 16:18:56,084 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-09-23 16:18:56,084 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-09-23 16:18:56,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-23 16:18:56,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 16:18:56,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-23 16:18:56,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 16:18:59,993 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-09-23 16:18:59,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 64 [2024-09-23 16:19:00,001 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 8 treesize of output 1 [2024-09-23 16:19:00,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2024-09-23 16:19:00,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2024-09-23 16:19:00,990 INFO L349 Elim1Store]: treesize reduction 593, result has 14.9 percent of original size [2024-09-23 16:19:00,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 429 treesize of output 524 [2024-09-23 16:19:01,026 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-23 16:19:01,027 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 301 [2024-09-23 16:19:01,050 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-23 16:19:01,050 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 294 [2024-09-23 16:19:01,088 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-23 16:19:01,089 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 335 [2024-09-23 16:19:01,125 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-23 16:19:01,126 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 328 [2024-09-23 16:19:06,007 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-09-23 16:19:06,007 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 28 [2024-09-23 16:19:08,896 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:19:08,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 22 treesize of output 37 [2024-09-23 16:19:08,936 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2024-09-23 16:19:08,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 46 [2024-09-23 16:19:08,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:08,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:09,171 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2024-09-23 16:19:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 46 [2024-09-23 16:19:09,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 23 [2024-09-23 16:19:10,164 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-23 16:19:10,164 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 14 treesize of output 22 [2024-09-23 16:19:11,919 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 8 treesize of output 1 [2024-09-23 16:19:12,790 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,790 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,810 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,810 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,834 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,834 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,845 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,845 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,862 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,862 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,868 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-23 16:19:12,869 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 2 case distinctions, treesize of input 19 treesize of output 3 [2024-09-23 16:19:12,911 INFO L349 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2024-09-23 16:19:12,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 66 [2024-09-23 16:19:12,939 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-09-23 16:19:12,939 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 3 case distinctions, treesize of input 28 treesize of output 11 [2024-09-23 16:19:12,944 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-23 16:19:13,506 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 8 treesize of output 7 [2024-09-23 16:19:13,520 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 8 treesize of output 7 [2024-09-23 16:19:13,552 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 8 treesize of output 7 [2024-09-23 16:19:13,560 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 8 treesize of output 7 [2024-09-23 16:19:13,569 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 8 treesize of output 7 [2024-09-23 16:19:13,579 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 8 treesize of output 7 [2024-09-23 16:19:14,047 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-23 16:19:14,047 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 14 treesize of output 18 [2024-09-23 16:19:16,514 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#m~0.offset| 0) (= |c_~#m2~0.offset| 0) (let ((.cse36 (select |c_#memory_int| 5)) (.cse35 (select |c_#memory_int| 3))) (let ((.cse30 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| 4)) (.cse355 (select .cse35 0)) (.cse12 (select |c_#memory_int| 4)) (.cse356 (select .cse36 0))) (let ((.cse67 (exists ((v_prenex_123 Int) (v_prenex_122 Int)) (and (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_prenex_122)) (= (select (select |c_#memory_int| v_prenex_122) v_prenex_123) 1) (not (= v_prenex_122 4))))) (.cse33 (= .cse356 0)) (.cse127 (exists ((v_prenex_134 Int)) (= (select .cse12 v_prenex_134) 1))) (.cse40 (select .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (.cse34 (= .cse355 0)) (.cse143 (select .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (.cse144 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| 5)) (.cse37 (= .cse356 1)) (.cse32 (= .cse355 1)) (.cse118 (not .cse30)) (.cse5 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (or (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1250 Int)) (= v_DerPreprocessor_69 (store .cse0 v_prenex_1250 (select v_DerPreprocessor_69 v_prenex_1250)))) (= v_DerPreprocessor_68 .cse0) (exists ((v_prenex_1249 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse2 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse1 (select .cse2 5)) (.cse3 (select (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse0 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select .cse1 v_prenex_1249) 1) (= (select (select .cse2 3) 0) 0) (= 0 (select .cse1 0)) (= .cse3 .cse0) (= .cse3 v_DerPreprocessor_100)))))) (= (store .cse0 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1246 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse6 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse7 (select (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse6 3) 0) 0) (= (select (select .cse6 5) 0) 1) (= .cse7 .cse8) (= .cse7 v_DerPreprocessor_100))))) (= (select .cse8 v_prenex_1246) 1) (= v_DerPreprocessor_69 (store .cse8 v_prenex_1246 (select v_DerPreprocessor_69 v_prenex_1246))) (= v_DerPreprocessor_68 .cse8) (= (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse10 3) 0) 1) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse11 (select (store .cse10 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_122 Int)) (and (= .cse11 (select |c_#memory_int| v_prenex_122)) (not (= v_prenex_122 4)))) (exists ((v_prenex_123 Int)) (= (select .cse11 v_prenex_123) 1)) (= (store .cse11 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse11) (= (store .cse11 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse11 .cse12)))) (= (select (select .cse10 5) 0) 0)))) (exists ((v_prenex_1262 Int) (v_prenex_1260 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1261 Int)) (let ((.cse17 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse16 (store .cse17 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse13 (store .cse17 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse14 (select .cse16 4))) (and (= 0 (select (select .cse13 5) 0)) (= (select (select .cse13 3) 0) 1) (= .cse14 .cse15) (= .cse14 v_DerPreprocessor_100) (= (select .cse16 v_prenex_1261) .cse15)))))) (= (store .cse15 v_prenex_1262 (select v_DerPreprocessor_69 v_prenex_1262)) v_DerPreprocessor_69) (= (select .cse15 v_prenex_1260) 1) (= v_DerPreprocessor_68 .cse15) (= (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse18 (select (store .cse19 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse18 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (exists ((v_prenex_130 Int)) (= (select |c_#memory_int| v_prenex_130) .cse18)) (= (select (select .cse19 3) 0) 0) (= (store .cse18 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (exists ((v_prenex_134 Int)) (= (select .cse18 v_prenex_134) 1)) (= v_DerPreprocessor_68 .cse18) (= .cse18 .cse12) (= (select (select .cse19 5) 0) 0))))) (exists ((v_prenex_1257 Int) (v_prenex_1255 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse20 v_prenex_1257 (select v_DerPreprocessor_69 v_prenex_1257)) v_DerPreprocessor_69) (= 1 (select .cse20 v_prenex_1255)) (= v_DerPreprocessor_68 .cse20) (exists ((v_prenex_1256 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse21 (store .cse24 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse22 (store .cse24 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse23 (select .cse21 4))) (and (= .cse20 (select .cse21 v_prenex_1256)) (= 0 (select (select .cse22 5) 0)) (= (select (select .cse22 3) 0) 1) (= .cse23 .cse20) (= .cse23 v_DerPreprocessor_100)))))) (= (store .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1237 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse25 (select .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_69 (store .cse25 v_prenex_1237 (select v_DerPreprocessor_69 v_prenex_1237))) (= v_DerPreprocessor_68 .cse25) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse26 (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse27 (select (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse25 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse26 3) 0) 0) (= 0 (select (select .cse26 5) 0)) (= .cse27 .cse25) (= .cse27 v_DerPreprocessor_100))))) (= (store .cse25 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1236 Int)) (and (= (select (select .cse29 v_prenex_1236) 0) 1) (not (= v_prenex_1236 4)))))))) (and .cse30 (let ((.cse31 (= .cse40 1))) (or (and .cse31 .cse32 .cse33) (and (or (and .cse34 (exists ((v_prenex_1206 Int)) (= (select .cse35 v_prenex_1206) 1)) .cse31) (and .cse34 (exists ((v_prenex_1216 Int) (v_prenex_1215 Int) (v_DerPreprocessor_68 (Array Int Int))) (and (= (select (select (store |c_#memory_int| 4 v_DerPreprocessor_68) v_prenex_1216) v_prenex_1215) 1) (not (= v_prenex_1216 4)) (= (store v_DerPreprocessor_68 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse12))))) .cse33) (and .cse34 .cse31 (exists ((v_prenex_1229 Int)) (= (select .cse36 v_prenex_1229) 1)) .cse33) (and .cse34 .cse31 .cse33) (and .cse34 .cse37 .cse31) (and .cse34 (exists ((v_prenex_127 Int) (v_prenex_1213 Int) (v_DerPreprocessor_68 (Array Int Int))) (and (= (select (select (store |c_#memory_int| 4 v_DerPreprocessor_68) v_prenex_1213) v_prenex_127) 1) (not (= v_prenex_1213 4)) (= (store v_DerPreprocessor_68 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse12))) .cse33) (and (or (exists ((v_prenex_134 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_130 Int)) (let ((.cse38 (select (store |c_#memory_int| 4 v_DerPreprocessor_100) v_prenex_130))) (and (= (store .cse38 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse12) (= (store .cse38 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) v_DerPreprocessor_100) (= 1 (select .cse38 v_prenex_134))))) (exists ((v_prenex_134 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_130 Int) (v_prenex_1209 Int)) (let ((.cse39 (select (store |c_#memory_int| 4 v_DerPreprocessor_100) v_prenex_130))) (and (= (store (store .cse39 v_prenex_1209 (select .cse12 v_prenex_1209)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse12) (not (= v_prenex_1209 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (store .cse39 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) v_DerPreprocessor_100) (= 1 (select .cse39 v_prenex_134)))))) .cse34 .cse33) (and .cse37 .cse31 .cse32)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse44 (select .cse41 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1240 Int) (v_prenex_1293 Int)) (and (= (select (select .cse41 v_prenex_1240) v_prenex_1293) 1) (not (= v_prenex_1240 4)))) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse42 (store .cse43 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse42 3) 0) 0) (= 0 (select (select .cse42 5) 0)) (= (select (store .cse43 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse44 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) .cse44))))) (= v_DerPreprocessor_68 .cse44) (= (store .cse44 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1241 Int)) (= v_DerPreprocessor_69 (store .cse44 v_prenex_1241 (select v_DerPreprocessor_69 v_prenex_1241)))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse46 (store .cse47 4 v_DerPreprocessor_69))) (let ((.cse45 (select .cse46 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse45 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (exists ((v_prenex_127 Int) (v_prenex_126 Int)) (and (= (select (select .cse46 v_prenex_126) v_prenex_127) 1) (not (= v_prenex_126 4)))) (= (select (select .cse47 3) 0) 0) (= (store .cse45 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse45) (= .cse45 .cse12) (= (select (select .cse47 5) 0) 0)))))) (exists ((v_prenex_1246 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select .cse48 v_prenex_1246) 1) (= v_DerPreprocessor_69 (store .cse48 v_prenex_1246 (select v_DerPreprocessor_69 v_prenex_1246))) (= v_DerPreprocessor_68 .cse48) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse49 (store .cse51 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse50 (select (store .cse51 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse48 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= 0 (select (select .cse49 5) 0)) (= (select (select .cse49 3) 0) 1) (= .cse50 .cse48) (= .cse50 v_DerPreprocessor_100))))) (= (store .cse48 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_134 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse53 (select (store .cse52 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse52 3) 0) 0) (= (store .cse53 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse53 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse53) (= (store .cse53 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse53 .cse12) (= (select (select .cse52 5) 0) 0))))) (exists ((v_prenex_1262 Int) (v_prenex_1260 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1261 Int)) (let ((.cse58 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse57 (store .cse58 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse56 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse54 (store .cse58 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse55 (select .cse57 4))) (and (= (select (select .cse54 3) 0) 0) (= 0 (select (select .cse54 5) 0)) (= .cse55 .cse56) (= .cse55 v_DerPreprocessor_100) (= (select .cse57 v_prenex_1261) .cse56)))))) (= (store .cse56 v_prenex_1262 (select v_DerPreprocessor_69 v_prenex_1262)) v_DerPreprocessor_69) (= (select .cse56 v_prenex_1260) 1) (= v_DerPreprocessor_68 .cse56) (= (store .cse56 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1238 Int)) (= (store .cse59 v_prenex_1238 (select v_DerPreprocessor_69 v_prenex_1238)) v_DerPreprocessor_69)) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse60 (store .cse62 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse61 (select (store .cse62 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse59 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse60 5) 0) 1) (= (select (select .cse60 3) 0) 1) (= .cse61 .cse59) (= .cse61 v_DerPreprocessor_100))))) (= v_DerPreprocessor_68 .cse59) (= (store .cse59 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse63 (select (store .cse64 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse63 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse64 3) 0) 0) (= (store .cse63 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse63) (= .cse63 .cse12) (= (select (select .cse64 5) 0) 1))))) (and (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse66 (select (store .cse65 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse65 3) 0) 1) (= (store .cse66 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse66) (= (store .cse66 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse66 .cse12) (= (select (select .cse65 5) 0) 0))))) .cse67) (exists ((v_prenex_134 Int) (v_prenex_130 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse69 (select (store .cse68 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse68 3) 0) 1) (= (store .cse69 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse69 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse69) (= (store .cse69 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse69 .cse12) (= (select |c_#memory_int| v_prenex_130) .cse69) (= (select (select .cse68 5) 0) 1))))) (exists ((v_prenex_1262 Int) (v_prenex_1260 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse70 v_prenex_1262 (select v_DerPreprocessor_69 v_prenex_1262)) v_DerPreprocessor_69) (= (select .cse70 v_prenex_1260) 1) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1261 Int)) (let ((.cse74 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse73 (store .cse74 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse70 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse71 (store .cse74 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse72 (select .cse73 4))) (and (= (select (select .cse71 3) 0) 0) (= (select (select .cse71 5) 0) 1) (= .cse72 .cse70) (= .cse72 v_DerPreprocessor_100) (= (select .cse73 v_prenex_1261) .cse70)))))) (= v_DerPreprocessor_68 .cse70) (= (store .cse70 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_134 Int) (v_prenex_130 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse75 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse76 (select (store .cse75 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse75 3) 0) 1) (= (store .cse76 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse76 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse76) (= (store .cse76 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse76 .cse12) (= (select |c_#memory_int| v_prenex_130) .cse76) (= (select (select .cse75 5) 0) 0))))) (exists ((v_prenex_1246 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse77 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select .cse77 v_prenex_1246) 1) (= v_DerPreprocessor_69 (store .cse77 v_prenex_1246 (select v_DerPreprocessor_69 v_prenex_1246))) (= v_DerPreprocessor_68 .cse77) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse80 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse78 (store .cse80 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse79 (select (store .cse80 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse77 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse78 3) 0) 0) (= 0 (select (select .cse78 5) 0)) (= .cse79 .cse77) (= .cse79 v_DerPreprocessor_100))))) (= (store .cse77 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse81 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse81 3) 0) 1) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse82 (select (store .cse81 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse82 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse82) (= (store .cse82 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse82 .cse12)))) (= (select (select .cse81 5) 0) 0)))) (exists ((v_prenex_134 Int) (v_prenex_130 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse83 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse84 (select (store .cse83 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse83 3) 0) 0) (= (store .cse84 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse84 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse84) (= (store .cse84 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse84 .cse12) (= (select |c_#memory_int| v_prenex_130) .cse84) (= (select (select .cse83 5) 0) 0))))) (exists ((v_prenex_1247 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_69 (store .cse85 v_prenex_1247 (select v_DerPreprocessor_69 v_prenex_1247))) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse89 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse88 (store .cse89 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse85 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse86 (store .cse89 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse87 (select .cse88 4))) (and (= 0 (select (select .cse86 5) 0)) (= (select (select .cse86 3) 0) 1) (= .cse87 .cse85) (exists ((v_prenex_1296 Int) (v_prenex_1295 Int)) (and (not (= v_prenex_1296 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) (not (= v_prenex_1296 4)) (= (select (select .cse88 v_prenex_1296) v_prenex_1295) 1))) (= .cse87 v_DerPreprocessor_100)))))) (= v_DerPreprocessor_68 .cse85) (= (store .cse85 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1254 Int)) (= v_DerPreprocessor_69 (store .cse90 v_prenex_1254 (select v_DerPreprocessor_69 v_prenex_1254)))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1291 Int)) (let ((.cse93 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse91 (store .cse93 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse92 (store .cse93 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse90 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (and (= (select (select .cse91 3) 0) 0) (= 0 (select (select .cse91 5) 0)) (= (select .cse92 v_prenex_1291) .cse90) (= (select .cse92 4) .cse90))))) (= v_DerPreprocessor_68 .cse90) (exists ((v_prenex_1253 Int)) (= (select .cse90 v_prenex_1253) 1)) (= (store .cse90 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1244 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse98 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse95 (store .cse98 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse94 (select .cse95 3)) (.cse96 (select (store .cse98 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse97 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select .cse94 0) 0) (= 0 (select (select .cse95 5) 0)) (exists ((v_prenex_1233 Int)) (= (select .cse94 v_prenex_1233) 1)) (= .cse96 .cse97) (= .cse96 v_DerPreprocessor_100)))))) (= (store .cse97 v_prenex_1244 (select v_DerPreprocessor_69 v_prenex_1244)) v_DerPreprocessor_69) (= v_DerPreprocessor_68 .cse97) (= (store .cse97 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse99 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse100 (select (store .cse99 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse99 3) 0) 0) (= (store .cse100 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse100) (= (store .cse100 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= (select .cse100 |~#top~0.offset|) 1) (= .cse100 .cse12) (= (select (select .cse99 5) 0) 0))))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse103 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse101 (select .cse103 3))) (and (= (select .cse101 0) 0) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse102 (select (store .cse103 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse102 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse102) (= (store .cse102 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse102 .cse12)))) (exists ((v_prenex_127 Int)) (= (select .cse101 v_prenex_127) 1)) (= (select (select .cse103 5) 0) 0))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse106 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse104 (store .cse106 4 v_DerPreprocessor_69))) (let ((.cse105 (select .cse104 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_126 Int)) (and (= (select (select .cse104 v_prenex_126) 0) 1) (not (= v_prenex_126 4)))) (exists ((|~#top~0.offset| Int)) (= (store .cse105 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse106 3) 0) 0) (= (store .cse105 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse105) (= .cse105 .cse12) (= (select (select .cse106 5) 0) 0)))))) (exists ((v_prenex_1244 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse107 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse108 (select .cse107 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1243 Int) (v_prenex_1242 Int)) (and (not (= v_prenex_1243 4)) (= (select (select .cse107 v_prenex_1243) v_prenex_1242) 1))) (= (store .cse108 v_prenex_1244 (select v_DerPreprocessor_69 v_prenex_1244)) v_DerPreprocessor_69) (= v_DerPreprocessor_68 .cse108) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse111 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse109 (store .cse111 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse110 (select (store .cse111 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse108 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse109 3) 0) 0) (= 0 (select (select .cse109 5) 0)) (= .cse110 .cse108) (= .cse110 v_DerPreprocessor_100))))) (= (store .cse108 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse112 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse113 (select (store .cse112 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse112 3) 0) 0) (= (store .cse113 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse113) (= (store .cse113 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= (select .cse113 |~#top~0.offset|) 1) (= .cse113 .cse12) (= (select (select .cse112 5) 0) 1))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse116 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse117 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse114 (store .cse117 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse115 (select (store .cse117 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse116 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse114 5) 0) 1) (= (select (select .cse114 3) 0) 1) (= .cse115 .cse116) (= .cse115 v_DerPreprocessor_100))))) (exists ((v_prenex_131 Int)) (= (select .cse116 v_prenex_131) 1)) (= v_DerPreprocessor_68 .cse116) (= (store .cse116 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1248 Int)) (= v_DerPreprocessor_69 (store .cse116 v_prenex_1248 (select v_DerPreprocessor_69 v_prenex_1248))))))) (and .cse118 (let ((.cse134 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_prenex_130 Int) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse161 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse162 (select (store .cse161 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse161 3) 0) 1) (= (store .cse162 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select |c_#memory_int| v_prenex_130) .cse162) (= (select (select .cse161 5) 0) 0)))))))) (.cse135 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_prenex_130 Int) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse159 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse160 (select (store .cse159 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse159 3) 0) 0) (= (store .cse160 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select |c_#memory_int| v_prenex_130) .cse160) (= (select (select .cse159 5) 0) 0)))))))) (.cse147 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse158 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse158 3) 0) 1) (= (store (select (store .cse158 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse158 5) 0) 0)))))))) (or (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse119 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse119 3) 0) 1) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (= (store (select (store .cse119 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse119 5) 0) 1)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse120 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse121 (select (store .cse120 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse120 3) 0) 1) (exists ((v_prenex_131 Int)) (= (select .cse121 v_prenex_131) 1)) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (= (store .cse121 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse120 5) 0) 1))))) (exists ((|~#top~0.offset| Int)) (and (= (select .cse12 |~#top~0.offset|) 1) (exists ((v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse122 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse122 3) 0) 0) (= (store (select (store .cse122 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse122 5) 0) 0)))))))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse124 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse123 (select .cse124 3))) (and (= (select .cse123 0) 0) (= (store (select (store .cse124 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (exists ((v_prenex_127 Int)) (= (select .cse123 v_prenex_127) 1)) (= (select (select .cse124 5) 0) 0))))))) (and (exists ((v_prenex_130 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse125 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse126 (select (store .cse125 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse125 3) 0) 0) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (= (store .cse126 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select |c_#memory_int| v_prenex_130) .cse126) (= (select (select .cse125 5) 0) 0))))) .cse127) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse129 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse128 (store .cse129 4 v_DerPreprocessor_69))) (and (exists ((v_prenex_127 Int) (v_prenex_126 Int)) (and (= (select (select .cse128 v_prenex_126) v_prenex_127) 1) (not (= v_prenex_126 4)))) (= (select (select .cse129 3) 0) 0) (= (store (select .cse128 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse129 5) 0) 0))))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))) (and .cse67 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse130 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse130 3) 0) 1) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (= (store (select (store .cse130 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse130 5) 0) 0))))) (exists ((|~#top~0.offset| Int)) (and (exists ((v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse131 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse131 3) 0) 0) (= (store (select (store .cse131 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse131 5) 0) 1)))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))) (= (select .cse12 |~#top~0.offset|) 1))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse133 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse132 (store .cse133 4 v_DerPreprocessor_69))) (and (exists ((v_prenex_126 Int)) (and (= (select (select .cse132 v_prenex_126) 0) 1) (not (= v_prenex_126 4)))) (= (select (select .cse133 3) 0) 0) (= (store (select .cse132 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse133 5) 0) 0))))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))) (and (or .cse134 .cse135 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_prenex_130 Int) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse136 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse137 (select (store .cse136 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse136 3) 0) 0) (= (store .cse137 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select |c_#memory_int| v_prenex_130) .cse137) (= (select (select .cse136 5) 0) 1))))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_prenex_130 Int) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse138 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse139 (select (store .cse138 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse138 3) 0) 1) (= (store .cse139 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select |c_#memory_int| v_prenex_130) .cse139) (= (select (select .cse138 5) 0) 1)))))))) .cse127) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse141 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse140 (store .cse141 4 v_DerPreprocessor_69))) (and (exists ((v_prenex_127 Int) (v_prenex_126 Int)) (and (= (select (select .cse140 v_prenex_126) v_prenex_127) 1) (not (= v_prenex_126 4)))) (= (select (select .cse141 3) 0) 0) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (= (store (select .cse140 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse141 5) 0) 0))))) (exists ((|~#top~0.offset| Int)) (and (= (select .cse12 |~#top~0.offset|) 1) (exists ((v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse142 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse142 3) 0) 1) (= (store (select (store .cse142 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse142 5) 0) 0)))))))) (and .cse127 (or .cse134 .cse135)) (and (= .cse143 0) .cse144 .cse32 (or (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse37)) (and (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse145 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse145 3) 0) 0) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (= (store (select (store .cse145 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse145 5) 0) 0)))) .cse127) (and .cse127 (or (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse146 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse146 3) 0) 0) (= (store (select (store .cse146 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse146 5) 0) 0)))))) .cse147)) (exists ((|~#top~0.offset| Int)) (and (= (select .cse12 |~#top~0.offset|) 1) (exists ((v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse148 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse148 3) 0) 1) (= (store (select (store .cse148 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse148 5) 0) 1)))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse150 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse149 (select (store .cse150 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_123 Int)) (= (select .cse149 v_prenex_123) 1)) (= (select (select .cse150 3) 0) 1) (= (store .cse149 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse150 5) 0) 0))))) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse151 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse151 3) 0) 0) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (= (store (select (store .cse151 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse151 5) 0) 1)))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (and (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse153 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse152 (select (store .cse153 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_122 Int)) (and (= .cse152 (select |c_#memory_int| v_prenex_122)) (not (= v_prenex_122 4)))) (exists ((v_prenex_123 Int)) (= (select .cse152 v_prenex_123) 1)) (= (select (select .cse153 3) 0) 1) (= (store .cse152 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse153 5) 0) 0))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse155 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse154 (store .cse155 4 v_DerPreprocessor_69))) (and (exists ((v_prenex_126 Int)) (and (= (select (select .cse154 v_prenex_126) 0) 1) (not (= v_prenex_126 4)))) (= (select (select .cse155 3) 0) 0) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (= (store (select .cse154 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse155 5) 0) 0))))) .cse147 (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse156 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse157 (select .cse156 5))) (and (= (select (select .cse156 3) 0) 0) (exists ((|~#top~0.offset| Int)) (= v_DerPreprocessor_69 (store .cse12 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)))) (exists ((v_prenex_127 Int)) (= (select .cse157 v_prenex_127) 1)) (= (store (select (store .cse156 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse157 0) 0)))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse163 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_68 .cse163) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse166 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse164 (store .cse166 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse165 (select (store .cse166 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse163 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse164 3) 0) 0) (= 0 (select (select .cse164 5) 0)) (= .cse165 .cse163) (= .cse165 v_DerPreprocessor_100))))) (exists ((v_prenex_1251 Int)) (= (select .cse163 v_prenex_1251) 1)) (exists ((v_prenex_1252 Int)) (= (store .cse163 v_prenex_1252 (select v_DerPreprocessor_69 v_prenex_1252)) v_DerPreprocessor_69)) (= (store .cse163 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1237 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse167 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_69 (store .cse167 v_prenex_1237 (select v_DerPreprocessor_69 v_prenex_1237))) (= v_DerPreprocessor_68 .cse167) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse170 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse168 (store .cse170 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse169 (select (store .cse170 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse167 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= 0 (select (select .cse168 5) 0)) (= (select (select .cse168 3) 0) 1) (= .cse169 .cse167) (= .cse169 v_DerPreprocessor_100))))) (= (store .cse167 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1247 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse171 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_69 (store .cse171 v_prenex_1247 (select v_DerPreprocessor_69 v_prenex_1247))) (exists ((v_prenex_1235 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse175 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse174 (store .cse175 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse171 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse172 (store .cse175 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse173 (select .cse174 4))) (and (= 0 (select (select .cse172 5) 0)) (not (= v_prenex_1235 4)) (= (select (select .cse172 3) 0) 1) (= .cse173 .cse171) (= .cse173 v_DerPreprocessor_100) (= (select .cse174 v_prenex_1235) .cse171)))))) (exists ((v_prenex_1234 Int)) (= (select .cse171 v_prenex_1234) 1)) (= v_DerPreprocessor_68 .cse171) (= (store .cse171 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse176 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse177 (select (store .cse176 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse176 3) 0) 1) (= (store .cse177 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse177) (= (store .cse177 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= (select .cse177 |~#top~0.offset|) 1) (= .cse177 .cse12) (= (select (select .cse176 5) 0) 1))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse178 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1258 Int)) (= (select .cse178 v_prenex_1258) 1)) (= v_DerPreprocessor_68 .cse178) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse181 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse179 (store .cse181 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse180 (select (store .cse181 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse178 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= 0 (select (select .cse179 5) 0)) (= (select (select .cse179 3) 0) 1) (= .cse180 .cse178) (= .cse180 v_DerPreprocessor_100))))) (= (store .cse178 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1259 Int)) (= v_DerPreprocessor_69 (store .cse178 v_prenex_1259 (select v_DerPreprocessor_69 v_prenex_1259))))))) (exists ((v_prenex_1257 Int) (v_prenex_1255 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse182 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse182 v_prenex_1257 (select v_DerPreprocessor_69 v_prenex_1257)) v_DerPreprocessor_69) (= 1 (select .cse182 v_prenex_1255)) (exists ((v_prenex_1256 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse186 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse183 (store .cse186 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse182 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse184 (store .cse186 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse185 (select .cse183 4))) (and (= .cse182 (select .cse183 v_prenex_1256)) (= (select (select .cse184 3) 0) 0) (= 0 (select (select .cse184 5) 0)) (= .cse185 .cse182) (= .cse185 v_DerPreprocessor_100)))))) (= v_DerPreprocessor_68 .cse182) (= (store .cse182 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse188 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse187 (select .cse188 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1292 Int)) (= v_DerPreprocessor_69 (store .cse187 v_prenex_1292 (select v_DerPreprocessor_69 v_prenex_1292)))) (exists ((v_prenex_1294 Int)) (and (= (select (select .cse188 v_prenex_1294) 0) 1) (not (= v_prenex_1294 4)))) (= v_DerPreprocessor_68 .cse187) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse191 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse189 (store .cse191 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse190 (select (store .cse191 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse187 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse189 3) 0) 0) (= 0 (select (select .cse189 5) 0)) (= .cse190 .cse187) (= .cse190 v_DerPreprocessor_100))))) (= (store .cse187 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) (exists ((v_prenex_134 Int) (v_prenex_130 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse192 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse193 (select (store .cse192 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse192 3) 0) 0) (= (store .cse193 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse193 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse193) (= (store .cse193 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse193 .cse12) (= (select |c_#memory_int| v_prenex_130) .cse193) (= (select (select .cse192 5) 0) 1))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse194 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= v_DerPreprocessor_68 .cse194) (exists ((v_prenex_1245 Int)) (= v_DerPreprocessor_69 (store .cse194 v_prenex_1245 (select v_DerPreprocessor_69 v_prenex_1245)))) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse196 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse195 (store .cse196 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse195 3) 0) 0) (= (select (select .cse195 5) 0) 1) (= (select (store .cse196 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse194 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) .cse194))))) (= (store .cse194 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse197 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse197 3) 0) 0) (exists ((v_prenex_126 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse199 (store .cse197 4 v_DerPreprocessor_69))) (let ((.cse198 (select .cse199 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse198 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse199 v_prenex_126) 0) 1) (= v_DerPreprocessor_68 .cse198) (= (store .cse198 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse198 .cse12) (not (= v_prenex_126 4)))))) (= (select (select .cse197 5) 0) 0)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse201 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse200 (select (store .cse201 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse200 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse201 3) 0) 0) (= (store .cse200 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (exists ((v_prenex_134 Int)) (= (select .cse200 v_prenex_134) 1)) (= v_DerPreprocessor_68 .cse200) (= .cse200 .cse12) (= (select (select .cse201 5) 0) 0))))) (exists ((v_prenex_1246 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse202 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select .cse202 v_prenex_1246) 1) (= v_DerPreprocessor_69 (store .cse202 v_prenex_1246 (select v_DerPreprocessor_69 v_prenex_1246))) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse205 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse203 (store .cse205 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse204 (select (store .cse205 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse202 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse203 5) 0) 1) (= (select (select .cse203 3) 0) 1) (= .cse204 .cse202) (= .cse204 v_DerPreprocessor_100))))) (= v_DerPreprocessor_68 .cse202) (= (store .cse202 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse206 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse207 (select (store .cse206 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse206 3) 0) 1) (= (store .cse207 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse207) (= (store .cse207 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= (select .cse207 |~#top~0.offset|) 1) (= .cse207 .cse12) (= (select (select .cse206 5) 0) 0))))) (exists ((v_prenex_1239 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int)) (v_prenex_1290 Int)) (let ((.cse208 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select .cse208 v_prenex_1290) 1) (= v_DerPreprocessor_69 (store .cse208 v_prenex_1239 (select v_DerPreprocessor_69 v_prenex_1239))) (= v_DerPreprocessor_68 .cse208) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse211 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse209 (store .cse211 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse210 (select (store .cse211 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse208 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select (select .cse209 3) 0) 0) (= 0 (select (select .cse209 5) 0)) (= .cse210 .cse208) (= .cse210 v_DerPreprocessor_100))))) (= (store .cse208 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse213 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse212 (select (store .cse213 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse212 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse213 3) 0) 1) (= (store .cse212 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse212) (= .cse212 .cse12) (= (select (select .cse213 5) 0) 1))))) (and .cse30 (let ((.cse216 (exists ((v_prenex_126 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int))) (and (= v_DerPreprocessor_68 (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (select v_DerPreprocessor_68 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) |~#top~0.offset| (select v_DerPreprocessor_68 |~#top~0.offset|))) (= (select (select (store |c_#memory_int| 4 v_DerPreprocessor_68) v_prenex_126) 0) 1) (not (= v_prenex_126 4))))) (.cse215 (exists ((v_prenex_127 Int) (v_prenex_126 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int))) (and (= v_DerPreprocessor_68 (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (select v_DerPreprocessor_68 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) |~#top~0.offset| (select v_DerPreprocessor_68 |~#top~0.offset|))) (= (select (select (store |c_#memory_int| 4 v_DerPreprocessor_68) v_prenex_126) v_prenex_127) 1) (not (= v_prenex_126 4))))) (.cse217 (exists ((v_prenex_134 Int) (v_prenex_130 Int)) (let ((.cse223 (select |c_#memory_int| v_prenex_130))) (and (= 1 (select .cse223 v_prenex_134)) (= .cse12 (store .cse223 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))))) (.cse218 (or .cse34 .cse32)) (.cse214 (= .cse40 0)) (.cse220 (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (or (and .cse34 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_86 Int) (v_DerPreprocessor_87 Int)) (= v_DerPreprocessor_86 (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_86) |~#top~0.offset| v_DerPreprocessor_87) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (exists ((v_prenex_127 Int)) (= (select .cse36 v_prenex_127) 1)) .cse33 .cse214) (and .cse33 (or (and .cse215 .cse34) (and .cse34 (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_84 Int) (v_DerPreprocessor_85 Int)) (= v_DerPreprocessor_84 (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_84) |~#top~0.offset| v_DerPreprocessor_85) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (exists ((v_prenex_127 Int)) (= (select .cse35 v_prenex_127) 1)))) .cse214) (and (or (and (exists ((v_DerPreprocessor_82 Int) (v_DerPreprocessor_83 Int) (|~#top~0.offset| Int)) (= (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_82) |~#top~0.offset| v_DerPreprocessor_83) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) v_DerPreprocessor_82)) .cse32) (and .cse216 .cse34)) .cse33 .cse214) (and .cse216 .cse34 .cse33 .cse214) (and .cse217 .cse34 .cse33) (and .cse218 .cse214 (or .cse37 .cse33)) (and .cse215 .cse34 .cse33 .cse214) (and .cse34 .cse37 .cse214 (exists ((v_DerPreprocessor_80 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_81 Int)) (= v_DerPreprocessor_80 (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_80) |~#top~0.offset| v_DerPreprocessor_81) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))) (and .cse217 .cse218 .cse33) (and .cse37 .cse32 .cse214 (exists ((v_DerPreprocessor_88 Int) (v_DerPreprocessor_89 Int) (|~#top~0.offset| Int)) (= (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_88) |~#top~0.offset| v_DerPreprocessor_89) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) v_DerPreprocessor_88))) (and .cse34 (or (exists ((v_prenex_134 Int) (v_DerPreprocessor_91 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_92 Int)) (let ((.cse219 (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_91) |~#top~0.offset| v_DerPreprocessor_92))) (and (= (select .cse219 v_prenex_134) 1) (= (select .cse12 v_prenex_134) 1) (= v_DerPreprocessor_91 (select .cse219 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse127 (exists ((v_DerPreprocessor_93 Int) (|~#top~0.offset| Int)) (= (select (store .cse220 |~#top~0.offset| v_DerPreprocessor_93) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) .cse33 .cse214) (and (or (and (exists ((v_prenex_123 Int) (v_prenex_122 Int)) (and (= (select (select |c_#memory_int| v_prenex_122) v_prenex_123) 1) (not (= v_prenex_122 4)))) (exists ((v_DerPreprocessor_71 Int) (v_DerPreprocessor_72 Int) (|~#top~0.offset| Int)) (= v_DerPreprocessor_71 (select (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_71) |~#top~0.offset| v_DerPreprocessor_72) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse214) (exists ((v_prenex_123 Int) (v_prenex_122 Int)) (let ((.cse221 (select |c_#memory_int| v_prenex_122))) (and (= (store .cse221 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse12) (= (select .cse221 v_prenex_123) 1) (not (= v_prenex_122 4)))))) .cse32 .cse33) (and .cse218 .cse33 .cse214 (or (exists ((v_DerPreprocessor_77 Int) (|~#top~0.offset| Int)) (= (select (store .cse220 |~#top~0.offset| v_DerPreprocessor_77) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (exists ((v_prenex_134 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_75 Int) (v_DerPreprocessor_76 Int)) (let ((.cse222 (store (store .cse12 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| v_DerPreprocessor_75) |~#top~0.offset| v_DerPreprocessor_76))) (and (= v_DerPreprocessor_75 (select .cse222 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (select .cse12 v_prenex_134) 1) (= (select .cse222 v_prenex_134) 1)))) .cse127))))) (exists ((v_prenex_134 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse224 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse225 (select (store .cse224 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select (select .cse224 3) 0) 1) (= (store .cse225 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select .cse225 v_prenex_134) 1) (= v_DerPreprocessor_68 .cse225) (= (store .cse225 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse225 .cse12) (= (select (select .cse224 5) 0) 0))))) (exists ((|~#top~0.offset| Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse227 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse226 (select (store .cse227 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_123 Int)) (= (select .cse226 v_prenex_123) 1)) (= (select (select .cse227 3) 0) 1) (= (store .cse226 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse226) (= (store .cse226 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse226 .cse12) (= (select (select .cse227 5) 0) 0))))) (exists ((v_DerPreprocessor_68 (Array Int Int))) (let ((.cse230 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (exists ((v_prenex_127 Int) (v_prenex_126 Int) (|~#top~0.offset| Int) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse229 (store .cse230 4 v_DerPreprocessor_69))) (let ((.cse228 (select .cse229 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse228 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= (select (select .cse229 v_prenex_126) v_prenex_127) 1) (= v_DerPreprocessor_68 .cse228) (= (store .cse228 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69) (= .cse228 .cse12) (not (= v_prenex_126 4)))))) (= (select (select .cse230 3) 0) 0) (= (select (select .cse230 5) 0) 0)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse232 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse231 (select (store .cse232 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) (.cse233 (select .cse232 5))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse231 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse232 3) 0) 0) (exists ((v_prenex_127 Int)) (= (select .cse233 v_prenex_127) 1)) (= (store .cse231 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse231) (= .cse231 .cse12) (= (select .cse233 0) 0))))) (exists ((v_prenex_1239 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int)) (v_prenex_1290 Int)) (let ((.cse234 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (select .cse234 v_prenex_1290) 1) (= v_DerPreprocessor_69 (store .cse234 v_prenex_1239 (select v_DerPreprocessor_69 v_prenex_1239))) (= v_DerPreprocessor_68 .cse234) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse237 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse235 (store .cse237 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse236 (select (store .cse237 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse234 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= 0 (select (select .cse235 5) 0)) (= (select (select .cse235 3) 0) 1) (= .cse236 .cse234) (= .cse236 v_DerPreprocessor_100))))) (= (store .cse234 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_prenex_1262 Int) (v_prenex_1260 Int) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse238 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse238 v_prenex_1262 (select v_DerPreprocessor_69 v_prenex_1262)) v_DerPreprocessor_69) (= (select .cse238 v_prenex_1260) 1) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1261 Int)) (let ((.cse242 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse241 (store .cse242 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse238 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse239 (store .cse242 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse240 (select .cse241 4))) (and (= (select (select .cse239 5) 0) 1) (= (select (select .cse239 3) 0) 1) (= .cse240 .cse238) (= .cse240 v_DerPreprocessor_100) (= (select .cse241 v_prenex_1261) .cse238)))))) (= v_DerPreprocessor_68 .cse238) (= (store .cse238 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (and (or (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse245 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1269 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1271 Int) (v_prenex_1270 Int)) (let ((.cse247 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse246 (store .cse247 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse245 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse244 (store .cse247 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse243 (select .cse246 4))) (and (= (select .cse243 v_prenex_1269) 1) (= 0 (select (select .cse244 5) 0)) (= (select (select .cse244 3) 0) 1) (= v_DerPreprocessor_69 (store .cse243 v_prenex_1271 (select v_DerPreprocessor_69 v_prenex_1271))) (= .cse245 (select .cse246 v_prenex_1270))))))) (= (store .cse245 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse248 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse248 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse250 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse249 (store .cse250 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse249 5) 0) 1) (exists ((v_prenex_1263 Int)) (= v_DerPreprocessor_69 (store (select (store .cse250 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse248 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1263 (select v_DerPreprocessor_69 v_prenex_1263)))) (= (select (select .cse249 3) 0) 1)))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse251 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse251 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse253 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse252 (store .cse253 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse252 3) 0) 0) (= (select (select .cse252 5) 0) 1) (exists ((v_prenex_1272 Int)) (= (store (select (store .cse253 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse251 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1272 (select v_DerPreprocessor_69 v_prenex_1272)) v_DerPreprocessor_69))))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse257 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1274 Int) (v_prenex_1273 Int)) (let ((.cse256 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse255 (store .cse256 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse254 (select (store .cse256 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse257 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select .cse254 v_prenex_1273) 1) (= (select (select .cse255 3) 0) 0) (= 0 (select (select .cse255 5) 0)) (= v_DerPreprocessor_69 (store .cse254 v_prenex_1274 (select v_DerPreprocessor_69 v_prenex_1274))))))) (= (store .cse257 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse260 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1264 Int)) (let ((.cse259 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse258 (store .cse259 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= 0 (select (select .cse258 5) 0)) (= (select (select .cse258 3) 0) 1) (= v_DerPreprocessor_69 (store (select (store .cse259 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse260 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1264 (select v_DerPreprocessor_69 v_prenex_1264))))))) (= (store .cse260 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse264 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1287 Int)) (let ((.cse263 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse262 (store .cse263 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse261 (select (store .cse263 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse264 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (store .cse261 v_prenex_1287 (select v_DerPreprocessor_69 v_prenex_1287)) v_DerPreprocessor_69) (= 0 (select (select .cse262 5) 0)) (= (select (select .cse262 3) 0) 1) (= (select .cse261 v_prenex_1287) 1))))) (= (store .cse264 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse267 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1268 Int) (v_prenex_1267 Int) (v_prenex_1266 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse269 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse268 (store .cse269 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse267 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse265 (store .cse269 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse266 (select .cse268 4))) (and (= 0 (select (select .cse265 5) 0)) (= (select .cse266 v_prenex_1266) 1) (= (select (select .cse265 3) 0) 1) (= .cse267 (select .cse268 v_prenex_1267)) (= v_DerPreprocessor_69 (store .cse266 v_prenex_1268 (select v_DerPreprocessor_69 v_prenex_1268)))))))) (= (store .cse267 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse270 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse271 (select .cse270 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1285 Int) (v_prenex_1284 Int)) (and (= (select (select .cse270 v_prenex_1285) v_prenex_1284) 1) (not (= v_prenex_1285 4)))) (= (store .cse271 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1286 Int)) (let ((.cse273 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse272 (store .cse273 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse272 3) 0) 0) (= 0 (select (select .cse272 5) 0)) (= v_DerPreprocessor_69 (store (select (store .cse273 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse271 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1286 (select v_DerPreprocessor_69 v_prenex_1286))))))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse277 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse276 (select .cse277 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1264 Int)) (let ((.cse275 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse274 (store .cse275 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse274 3) 0) 0) (= 0 (select (select .cse274 5) 0)) (= v_DerPreprocessor_69 (store (select (store .cse275 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse276 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1264 (select v_DerPreprocessor_69 v_prenex_1264))))))) (exists ((v_prenex_1302 Int)) (and (not (= v_prenex_1302 4)) (= (select (select .cse277 v_prenex_1302) 0) 1))) (= (store .cse276 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse281 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1287 Int)) (let ((.cse280 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse279 (store .cse280 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse278 (select (store .cse280 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse281 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (store .cse278 v_prenex_1287 (select v_DerPreprocessor_69 v_prenex_1287)) v_DerPreprocessor_69) (= (select (select .cse279 3) 0) 0) (= (select (select .cse279 5) 0) 1) (= (select .cse278 v_prenex_1287) 1))))) (= (store .cse281 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse282 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1299 Int)) (= (select .cse282 v_prenex_1299) 1)) (= (store .cse282 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1278 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse283 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse284 (store .cse283 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= v_DerPreprocessor_69 (store (select (store .cse283 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse282 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1278 (select v_DerPreprocessor_69 v_prenex_1278))) (= (select (select .cse284 5) 0) 1) (= (select (select .cse284 3) 0) 1)))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse285 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse288 (select .cse285 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1279 Int) (v_prenex_1280 Int)) (and (not (= v_prenex_1280 4)) (= (select (select .cse285 v_prenex_1280) v_prenex_1279) 1))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1281 Int)) (let ((.cse287 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse286 (store .cse287 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse286 3) 0) 0) (= 0 (select (select .cse286 5) 0)) (= v_DerPreprocessor_69 (store (select (store .cse287 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse288 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1281 (select v_DerPreprocessor_69 v_prenex_1281))))))) (= (store .cse288 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse289 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse289 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1287 Int)) (let ((.cse292 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse291 (store .cse292 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse290 (select (store .cse292 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse289 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (store .cse290 v_prenex_1287 (select v_DerPreprocessor_69 v_prenex_1287)) v_DerPreprocessor_69) (= (select (select .cse291 3) 0) 0) (= 0 (select (select .cse291 5) 0)) (= (select .cse290 v_prenex_1287) 1)))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse295 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1269 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1271 Int) (v_prenex_1270 Int)) (let ((.cse297 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse296 (store .cse297 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse295 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse293 (store .cse297 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse294 (select .cse296 4))) (and (= (select (select .cse293 3) 0) 0) (= (select (select .cse293 5) 0) 1) (= (select .cse294 v_prenex_1269) 1) (= v_DerPreprocessor_69 (store .cse294 v_prenex_1271 (select v_DerPreprocessor_69 v_prenex_1271))) (= .cse295 (select .cse296 v_prenex_1270))))))) (= (store .cse295 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse299 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1283 Int)) (let ((.cse298 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse300 (store .cse298 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= v_DerPreprocessor_69 (store (select (store .cse298 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse299 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1283 (select v_DerPreprocessor_69 v_prenex_1283))) (= 0 (select (select .cse300 5) 0)) (= (select (select .cse300 3) 0) 1))))) (exists ((v_prenex_1282 Int)) (= (select .cse299 v_prenex_1282) 1)) (= (store .cse299 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse304 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1287 Int)) (let ((.cse303 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse302 (store .cse303 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse301 (select (store .cse303 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse304 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (store .cse301 v_prenex_1287 (select v_DerPreprocessor_69 v_prenex_1287)) v_DerPreprocessor_69) (= (select (select .cse302 5) 0) 1) (= (select (select .cse302 3) 0) 1) (= (select .cse301 v_prenex_1287) 1))))) (= (store .cse304 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse307 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse309 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse308 (store .cse309 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse307 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse305 (store .cse309 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse306 (select .cse308 4))) (and (= (select (select .cse305 3) 0) 0) (exists ((v_prenex_1300 Int)) (= (store .cse306 v_prenex_1300 (select v_DerPreprocessor_69 v_prenex_1300)) v_DerPreprocessor_69)) (exists ((v_prenex_1298 Int)) (= .cse307 (select .cse308 v_prenex_1298))) (= 0 (select (select .cse305 5) 0)) (exists ((v_prenex_1297 Int)) (= (select .cse306 v_prenex_1297) 1))))))) (= (store .cse307 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse312 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1268 Int) (v_prenex_1267 Int) (v_prenex_1266 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse314 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse313 (store .cse314 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse312 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse310 (store .cse314 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse311 (select .cse313 4))) (and (= (select (select .cse310 3) 0) 0) (= 0 (select (select .cse310 5) 0)) (= (select .cse311 v_prenex_1266) 1) (= .cse312 (select .cse313 v_prenex_1267)) (= v_DerPreprocessor_69 (store .cse311 v_prenex_1268 (select v_DerPreprocessor_69 v_prenex_1268)))))))) (= (store .cse312 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (and (= .cse143 1) .cse144 .cse37 .cse32) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse318 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse317 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse316 (store .cse317 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse315 (select (store .cse317 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse318 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (exists ((v_prenex_1275 Int)) (= (select .cse315 v_prenex_1275) 1)) (= (select (select .cse316 3) 0) 0) (= 0 (select (select .cse316 5) 0)) (exists ((v_prenex_1276 Int)) (= v_DerPreprocessor_69 (store .cse315 v_prenex_1276 (select v_DerPreprocessor_69 v_prenex_1276)))))))) (= (store .cse318 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse319 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69))) (let ((.cse322 (select .cse319 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1288 Int)) (and (not (= v_prenex_1288 4)) (= (select (select .cse319 v_prenex_1288) 0) 1))) (exists ((v_prenex_1289 Int) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse321 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse320 (store .cse321 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= (select (select .cse320 3) 0) 0) (= 0 (select (select .cse320 5) 0)) (= v_DerPreprocessor_69 (store (select (store .cse321 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse322 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1289 (select v_DerPreprocessor_69 v_prenex_1289))))))) (= (store .cse322 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse326 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int))) (let ((.cse325 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse323 (store .cse325 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse324 (select .cse323 5))) (and (= (select (select .cse323 3) 0) 0) (exists ((v_prenex_1301 Int)) (= (select .cse324 v_prenex_1301) 1)) (= 0 (select .cse324 0)) (exists ((v_prenex_1277 Int)) (= v_DerPreprocessor_69 (store (select (store .cse325 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse326 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1277 (select v_DerPreprocessor_69 v_prenex_1277))))))))) (= (store .cse326 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse330 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1286 Int)) (let ((.cse329 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse328 (store .cse329 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse327 (select .cse328 3))) (and (= (select .cse327 0) 0) (= 0 (select (select .cse328 5) 0)) (= v_DerPreprocessor_69 (store (select (store .cse329 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse330 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4) v_prenex_1286 (select v_DerPreprocessor_69 v_prenex_1286))) (exists ((v_prenex_1306 Int)) (= (select .cse327 v_prenex_1306) 1))))))) (= (store .cse330 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse333 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1269 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1271 Int) (v_prenex_1270 Int)) (let ((.cse335 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse334 (store .cse335 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse333 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse331 (store .cse335 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse332 (select .cse334 4))) (and (= (select (select .cse331 3) 0) 0) (= (select .cse332 v_prenex_1269) 1) (= 0 (select (select .cse331 5) 0)) (= v_DerPreprocessor_69 (store .cse332 v_prenex_1271 (select v_DerPreprocessor_69 v_prenex_1271))) (= .cse333 (select .cse334 v_prenex_1270))))))) (= (store .cse333 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse339 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1265 Int)) (let ((.cse338 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse337 (store .cse338 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse336 (store .cse338 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse339 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (and (= v_DerPreprocessor_69 (store (select .cse336 4) v_prenex_1265 (select v_DerPreprocessor_69 v_prenex_1265))) (= 0 (select (select .cse337 5) 0)) (= (select (select .cse337 3) 0) 1) (exists ((v_prenex_1304 Int) (v_prenex_1307 Int)) (and (= (select (select .cse336 v_prenex_1307) v_prenex_1304) 1) (not (= v_prenex_1307 4)) (not (= v_prenex_1307 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)))))))) (= (store .cse339 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5)))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse340 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (= (store .cse340 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1269 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1271 Int) (v_prenex_1270 Int)) (let ((.cse344 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse343 (store .cse344 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse340 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)))) (let ((.cse341 (store .cse344 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse342 (select .cse343 4))) (and (= (select (select .cse341 5) 0) 1) (= (select .cse342 v_prenex_1269) 1) (= (select (select .cse341 3) 0) 1) (= v_DerPreprocessor_69 (store .cse342 v_prenex_1271 (select v_DerPreprocessor_69 v_prenex_1271))) (= .cse340 (select .cse343 v_prenex_1270)))))))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse345 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_prenex_1303 Int) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1265 Int)) (let ((.cse348 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse346 (store .cse348 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse345 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0))) (.cse347 (store .cse348 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (and (= .cse345 (select .cse346 v_prenex_1303)) (= v_DerPreprocessor_69 (store (select .cse346 4) v_prenex_1265 (select v_DerPreprocessor_69 v_prenex_1265))) (= 0 (select (select .cse347 5) 0)) (= (select (select .cse347 3) 0) 1) (not (= v_prenex_1303 4)))))) (= (store .cse345 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5) (exists ((v_prenex_1305 Int)) (= (select .cse345 v_prenex_1305) 1))))) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse352 (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68) 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_prenex_1274 Int) (v_prenex_1273 Int)) (let ((.cse351 (store |c_#memory_int| 4 v_DerPreprocessor_100))) (let ((.cse350 (store .cse351 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68)) (.cse349 (select (store .cse351 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store .cse352 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0)) 4))) (and (= (select .cse349 v_prenex_1273) 1) (= 0 (select (select .cse350 5) 0)) (= (select (select .cse350 3) 0) 1) (= v_DerPreprocessor_69 (store .cse349 v_prenex_1274 (select v_DerPreprocessor_69 v_prenex_1274))))))) (= (store .cse352 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1) .cse5))))) .cse118) (exists ((v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse354 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_68))) (let ((.cse353 (select (store .cse354 4 v_DerPreprocessor_69) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (exists ((|~#top~0.offset| Int)) (= (store .cse353 |~#top~0.offset| (select v_DerPreprocessor_69 |~#top~0.offset|)) v_DerPreprocessor_69)) (= (select (select .cse354 3) 0) 1) (exists ((v_prenex_131 Int)) (= (select .cse353 v_prenex_131) 1)) (= (store .cse353 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 0) .cse5) (= v_DerPreprocessor_68 .cse353) (= .cse353 .cse12) (= (select (select .cse354 5) 0) 1))))))))) (= |c_~#m2~0.base| 5) (= |c_~#m~0.base| 3)) is different from false Killed by 15