/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:17:43,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:17:43,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 21:17:43,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:17:43,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:17:43,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:17:43,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:17:43,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:17:43,349 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:17:43,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:17:43,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:17:43,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:17:43,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:17:43,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:17:43,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:17:43,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:17:43,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:17:43,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:17:43,354 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:17:43,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:17:43,354 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:17:43,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:17:43,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:17:43,355 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:17:43,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:17:43,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:17:43,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:17:43,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:17:43,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:17:43,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:17:43,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:17:43,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:17:43,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:17:43,358 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/UAutomizer-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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 21:17:43,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:17:43,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:17:43,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:17:43,559 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:17:43,560 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:17:43,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-11-29 21:17:44,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:17:44,746 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:17:44,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-11-29 21:17:44,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245502b60/9542aacc24a24201a83e87a8eba46224/FLAGaad276cc5 [2023-11-29 21:17:44,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245502b60/9542aacc24a24201a83e87a8eba46224 [2023-11-29 21:17:44,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:17:44,765 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:17:44,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:17:44,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:17:44,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:17:44,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75930bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44, skipping insertion in model container [2023-11-29 21:17:44,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,784 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:17:44,884 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2023-11-29 21:17:44,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:17:44,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:17:44,910 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2023-11-29 21:17:44,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:17:44,922 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:17:44,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44 WrapperNode [2023-11-29 21:17:44,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:17:44,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:17:44,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:17:44,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:17:44,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,950 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2023-11-29 21:17:44,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:17:44,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:17:44,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:17:44,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:17:44,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:17:44,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:17:44,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:17:44,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:17:44,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (1/1) ... [2023-11-29 21:17:44,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:17:45,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:45,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 21:17:45,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:17:45,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:17:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:17:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:17:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:17:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 21:17:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:17:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:17:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:17:45,037 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:17:45,106 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:17:45,107 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:17:45,391 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:17:45,403 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:17:45,403 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-29 21:17:45,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:17:45 BoogieIcfgContainer [2023-11-29 21:17:45,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:17:45,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:17:45,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:17:45,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:17:45,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:17:44" (1/3) ... [2023-11-29 21:17:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f417bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:17:45, skipping insertion in model container [2023-11-29 21:17:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:17:44" (2/3) ... [2023-11-29 21:17:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f417bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:17:45, skipping insertion in model container [2023-11-29 21:17:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:17:45" (3/3) ... [2023-11-29 21:17:45,414 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2023-11-29 21:17:45,426 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:17:45,426 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:17:45,426 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:17:45,514 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 21:17:45,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 291 transitions, 596 flow [2023-11-29 21:17:45,701 INFO L124 PetriNetUnfolderBase]: 26/289 cut-off events. [2023-11-29 21:17:45,701 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 21:17:45,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 26/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 302 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 218. Up to 2 conditions per place. [2023-11-29 21:17:45,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 291 transitions, 596 flow [2023-11-29 21:17:45,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 280 transitions, 572 flow [2023-11-29 21:17:45,726 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:17:45,731 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d287c64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:17:45,732 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 21:17:45,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:17:45,811 INFO L124 PetriNetUnfolderBase]: 26/279 cut-off events. [2023-11-29 21:17:45,811 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 21:17:45,811 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:45,812 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:45,813 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:45,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1711979408, now seen corresponding path program 1 times [2023-11-29 21:17:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613861810] [2023-11-29 21:17:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:45,919 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:45,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264433357] [2023-11-29 21:17:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:45,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:45,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:45,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:45,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 21:17:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:46,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 21:17:46,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:17:46,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:17:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613861810] [2023-11-29 21:17:46,299 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264433357] [2023-11-29 21:17:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264433357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:17:46,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:17:46,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 21:17:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752356402] [2023-11-29 21:17:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:17:46,309 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:17:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:46,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:17:46,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:17:46,332 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 291 [2023-11-29 21:17:46,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 280 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 180.16666666666666) internal successors, (1081), 6 states have internal predecessors, (1081), 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) [2023-11-29 21:17:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 291 [2023-11-29 21:17:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:46,577 INFO L124 PetriNetUnfolderBase]: 21/417 cut-off events. [2023-11-29 21:17:46,577 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 21:17:46,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 417 events. 21/417 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 795 event pairs, 4 based on Foata normal form. 31/412 useless extension candidates. Maximal degree in co-relation 374. Up to 89 conditions per place. [2023-11-29 21:17:46,580 INFO L140 encePairwiseOnDemand]: 251/291 looper letters, 102 selfloop transitions, 4 changer transitions 26/291 dead transitions. [2023-11-29 21:17:46,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 291 transitions, 870 flow [2023-11-29 21:17:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 21:17:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 21:17:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1840 transitions. [2023-11-29 21:17:46,594 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6323024054982818 [2023-11-29 21:17:46,595 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1840 transitions. [2023-11-29 21:17:46,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1840 transitions. [2023-11-29 21:17:46,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:46,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1840 transitions. [2023-11-29 21:17:46,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 184.0) internal successors, (1840), 10 states have internal predecessors, (1840), 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) [2023-11-29 21:17:46,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 291.0) internal successors, (3201), 11 states have internal predecessors, (3201), 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) [2023-11-29 21:17:46,612 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 291.0) internal successors, (3201), 11 states have internal predecessors, (3201), 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) [2023-11-29 21:17:46,614 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 9 predicate places. [2023-11-29 21:17:46,614 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 291 transitions, 870 flow [2023-11-29 21:17:46,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.16666666666666) internal successors, (1081), 6 states have internal predecessors, (1081), 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) [2023-11-29 21:17:46,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:46,615 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:46,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 21:17:46,821 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 21:17:46,821 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:46,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash 741294186, now seen corresponding path program 1 times [2023-11-29 21:17:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:46,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797690100] [2023-11-29 21:17:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:46,871 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798754148] [2023-11-29 21:17:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:46,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:46,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:46,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:46,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 21:17:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:47,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 21:17:47,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:17:47,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:17:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:17:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797690100] [2023-11-29 21:17:47,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798754148] [2023-11-29 21:17:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798754148] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:17:47,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:17:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-29 21:17:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979249280] [2023-11-29 21:17:47,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 21:17:47,203 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:17:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:47,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:17:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:17:47,206 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 291 [2023-11-29 21:17:47,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 291 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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) [2023-11-29 21:17:47,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:47,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 291 [2023-11-29 21:17:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:47,318 INFO L124 PetriNetUnfolderBase]: 37/461 cut-off events. [2023-11-29 21:17:47,319 INFO L125 PetriNetUnfolderBase]: For 165/176 co-relation queries the response was YES. [2023-11-29 21:17:47,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 461 events. 37/461 cut-off events. For 165/176 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1245 event pairs, 7 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 397. Up to 99 conditions per place. [2023-11-29 21:17:47,322 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 30 selfloop transitions, 9 changer transitions 33/305 dead transitions. [2023-11-29 21:17:47,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 305 transitions, 1025 flow [2023-11-29 21:17:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 21:17:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 21:17:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1992 transitions. [2023-11-29 21:17:47,326 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8556701030927835 [2023-11-29 21:17:47,326 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1992 transitions. [2023-11-29 21:17:47,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1992 transitions. [2023-11-29 21:17:47,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:47,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1992 transitions. [2023-11-29 21:17:47,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 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) [2023-11-29 21:17:47,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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) [2023-11-29 21:17:47,334 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 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) [2023-11-29 21:17:47,334 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 16 predicate places. [2023-11-29 21:17:47,335 INFO L500 AbstractCegarLoop]: Abstraction has has 277 places, 305 transitions, 1025 flow [2023-11-29 21:17:47,338 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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) [2023-11-29 21:17:47,338 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:47,342 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:47,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 21:17:47,546 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-29 21:17:47,547 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:47,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash -995432948, now seen corresponding path program 1 times [2023-11-29 21:17:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468734501] [2023-11-29 21:17:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:47,588 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60261415] [2023-11-29 21:17:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:47,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:47,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 21:17:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:47,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 21:17:47,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:17:47,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:17:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468734501] [2023-11-29 21:17:47,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60261415] [2023-11-29 21:17:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60261415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:17:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:17:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:17:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066143003] [2023-11-29 21:17:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:17:47,835 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:17:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:17:47,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:17:47,837 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 291 [2023-11-29 21:17:47,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 305 transitions, 1025 flow. Second operand has 8 states, 8 states have (on average 150.5) internal successors, (1204), 8 states have internal predecessors, (1204), 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) [2023-11-29 21:17:47,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:47,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 291 [2023-11-29 21:17:47,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:48,194 INFO L124 PetriNetUnfolderBase]: 71/689 cut-off events. [2023-11-29 21:17:48,194 INFO L125 PetriNetUnfolderBase]: For 529/543 co-relation queries the response was YES. [2023-11-29 21:17:48,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 689 events. 71/689 cut-off events. For 529/543 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2857 event pairs, 20 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 721. Up to 151 conditions per place. [2023-11-29 21:17:48,196 INFO L140 encePairwiseOnDemand]: 266/291 looper letters, 133 selfloop transitions, 8 changer transitions 81/357 dead transitions. [2023-11-29 21:17:48,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 357 transitions, 1639 flow [2023-11-29 21:17:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 21:17:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 21:17:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2102 transitions. [2023-11-29 21:17:48,200 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5159548355424645 [2023-11-29 21:17:48,200 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2102 transitions. [2023-11-29 21:17:48,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2102 transitions. [2023-11-29 21:17:48,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:48,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2102 transitions. [2023-11-29 21:17:48,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 150.14285714285714) internal successors, (2102), 14 states have internal predecessors, (2102), 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) [2023-11-29 21:17:48,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 291.0) internal successors, (4365), 15 states have internal predecessors, (4365), 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) [2023-11-29 21:17:48,208 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 291.0) internal successors, (4365), 15 states have internal predecessors, (4365), 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) [2023-11-29 21:17:48,209 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 29 predicate places. [2023-11-29 21:17:48,209 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 357 transitions, 1639 flow [2023-11-29 21:17:48,209 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 150.5) internal successors, (1204), 8 states have internal predecessors, (1204), 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) [2023-11-29 21:17:48,209 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:48,210 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:48,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 21:17:48,415 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:48,415 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:48,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1160512291, now seen corresponding path program 1 times [2023-11-29 21:17:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227037296] [2023-11-29 21:17:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:48,433 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443750220] [2023-11-29 21:17:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:48,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:48,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 21:17:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:48,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:17:48,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:17:48,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:17:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:17:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227037296] [2023-11-29 21:17:48,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443750220] [2023-11-29 21:17:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443750220] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:17:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 21:17:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2023-11-29 21:17:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237317420] [2023-11-29 21:17:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:17:48,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:17:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:17:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 21:17:48,750 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 291 [2023-11-29 21:17:48,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 357 transitions, 1639 flow. Second operand has 7 states, 7 states have (on average 214.28571428571428) internal successors, (1500), 7 states have internal predecessors, (1500), 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) [2023-11-29 21:17:48,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:48,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 291 [2023-11-29 21:17:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:48,952 INFO L124 PetriNetUnfolderBase]: 129/895 cut-off events. [2023-11-29 21:17:48,953 INFO L125 PetriNetUnfolderBase]: For 1587/1604 co-relation queries the response was YES. [2023-11-29 21:17:48,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 895 events. 129/895 cut-off events. For 1587/1604 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4344 event pairs, 19 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 950. Up to 228 conditions per place. [2023-11-29 21:17:48,956 INFO L140 encePairwiseOnDemand]: 276/291 looper letters, 71 selfloop transitions, 11 changer transitions 118/403 dead transitions. [2023-11-29 21:17:48,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 403 transitions, 2234 flow [2023-11-29 21:17:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:17:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:17:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1956 transitions. [2023-11-29 21:17:48,959 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7468499427262314 [2023-11-29 21:17:48,959 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1956 transitions. [2023-11-29 21:17:48,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1956 transitions. [2023-11-29 21:17:48,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:48,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1956 transitions. [2023-11-29 21:17:48,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.33333333333334) internal successors, (1956), 9 states have internal predecessors, (1956), 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) [2023-11-29 21:17:48,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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) [2023-11-29 21:17:48,965 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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) [2023-11-29 21:17:48,966 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 37 predicate places. [2023-11-29 21:17:48,966 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 403 transitions, 2234 flow [2023-11-29 21:17:48,966 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 214.28571428571428) internal successors, (1500), 7 states have internal predecessors, (1500), 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) [2023-11-29 21:17:48,966 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:48,967 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:48,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 21:17:49,172 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:49,172 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:49,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1683119497, now seen corresponding path program 1 times [2023-11-29 21:17:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76710285] [2023-11-29 21:17:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:49,190 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987041823] [2023-11-29 21:17:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:49,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:49,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:49,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 21:17:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:49,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 21:17:49,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:17:49,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:17:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76710285] [2023-11-29 21:17:49,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987041823] [2023-11-29 21:17:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987041823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:17:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:17:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 21:17:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675766682] [2023-11-29 21:17:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:17:49,724 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 21:17:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 21:17:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 21:17:49,726 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 291 [2023-11-29 21:17:49,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 403 transitions, 2234 flow. Second operand has 12 states, 12 states have (on average 198.66666666666666) internal successors, (2384), 12 states have internal predecessors, (2384), 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) [2023-11-29 21:17:49,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:49,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 291 [2023-11-29 21:17:49,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:50,669 INFO L124 PetriNetUnfolderBase]: 400/2094 cut-off events. [2023-11-29 21:17:50,669 INFO L125 PetriNetUnfolderBase]: For 4243/4311 co-relation queries the response was YES. [2023-11-29 21:17:50,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 2094 events. 400/2094 cut-off events. For 4243/4311 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12180 event pairs, 126 based on Foata normal form. 16/1800 useless extension candidates. Maximal degree in co-relation 1632. Up to 527 conditions per place. [2023-11-29 21:17:50,677 INFO L140 encePairwiseOnDemand]: 260/291 looper letters, 92 selfloop transitions, 16 changer transitions 214/507 dead transitions. [2023-11-29 21:17:50,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 507 transitions, 3528 flow [2023-11-29 21:17:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 21:17:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-29 21:17:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4614 transitions. [2023-11-29 21:17:50,685 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6893769610040341 [2023-11-29 21:17:50,685 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4614 transitions. [2023-11-29 21:17:50,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4614 transitions. [2023-11-29 21:17:50,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:50,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4614 transitions. [2023-11-29 21:17:50,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 200.6086956521739) internal successors, (4614), 23 states have internal predecessors, (4614), 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) [2023-11-29 21:17:50,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 291.0) internal successors, (6984), 24 states have internal predecessors, (6984), 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) [2023-11-29 21:17:50,701 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 291.0) internal successors, (6984), 24 states have internal predecessors, (6984), 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) [2023-11-29 21:17:50,701 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 59 predicate places. [2023-11-29 21:17:50,701 INFO L500 AbstractCegarLoop]: Abstraction has has 320 places, 507 transitions, 3528 flow [2023-11-29 21:17:50,702 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 198.66666666666666) internal successors, (2384), 12 states have internal predecessors, (2384), 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) [2023-11-29 21:17:50,702 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:50,702 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:50,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 21:17:50,908 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:50,909 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:50,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -750592521, now seen corresponding path program 1 times [2023-11-29 21:17:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204426072] [2023-11-29 21:17:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:50,926 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619533928] [2023-11-29 21:17:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:50,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:50,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 21:17:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:51,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:17:51,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 21:17:51,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:17:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 21:17:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:17:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204426072] [2023-11-29 21:17:51,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:17:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619533928] [2023-11-29 21:17:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619533928] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:17:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 21:17:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2023-11-29 21:17:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549427364] [2023-11-29 21:17:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:17:51,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:17:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:17:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:17:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 21:17:51,376 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 291 [2023-11-29 21:17:51,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 507 transitions, 3528 flow. Second operand has 7 states, 7 states have (on average 219.71428571428572) internal successors, (1538), 7 states have internal predecessors, (1538), 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) [2023-11-29 21:17:51,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:17:51,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 291 [2023-11-29 21:17:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:17:51,793 INFO L124 PetriNetUnfolderBase]: 502/2837 cut-off events. [2023-11-29 21:17:51,793 INFO L125 PetriNetUnfolderBase]: For 8232/8386 co-relation queries the response was YES. [2023-11-29 21:17:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 2837 events. 502/2837 cut-off events. For 8232/8386 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19852 event pairs, 179 based on Foata normal form. 17/2486 useless extension candidates. Maximal degree in co-relation 2248. Up to 555 conditions per place. [2023-11-29 21:17:51,804 INFO L140 encePairwiseOnDemand]: 271/291 looper letters, 78 selfloop transitions, 7 changer transitions 272/567 dead transitions. [2023-11-29 21:17:51,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 567 transitions, 4640 flow [2023-11-29 21:17:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:17:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:17:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2011 transitions. [2023-11-29 21:17:51,807 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7678503245513555 [2023-11-29 21:17:51,807 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2011 transitions. [2023-11-29 21:17:51,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2011 transitions. [2023-11-29 21:17:51,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:17:51,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2011 transitions. [2023-11-29 21:17:51,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.44444444444446) internal successors, (2011), 9 states have internal predecessors, (2011), 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) [2023-11-29 21:17:51,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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) [2023-11-29 21:17:51,813 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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) [2023-11-29 21:17:51,814 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, 67 predicate places. [2023-11-29 21:17:51,814 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 567 transitions, 4640 flow [2023-11-29 21:17:51,814 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 219.71428571428572) internal successors, (1538), 7 states have internal predecessors, (1538), 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) [2023-11-29 21:17:51,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:17:51,815 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:17:51,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 21:17:52,019 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:52,022 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 21:17:52,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:17:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1218296260, now seen corresponding path program 1 times [2023-11-29 21:17:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:17:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789491488] [2023-11-29 21:17:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:17:52,042 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 21:17:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354456722] [2023-11-29 21:17:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:17:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:17:52,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:17:52,043 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:17:52,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 21:17:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:17:52,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 134 conjunts are in the unsatisfiable core [2023-11-29 21:17:52,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:17:52,672 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 [2023-11-29 21:17:53,104 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 21:17:53,104 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 [2023-11-29 21:17:53,464 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 21:17:53,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 21:17:54,034 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 21:17:54,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 21:17:54,803 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 15 treesize of output 1 [2023-11-29 21:17:55,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:17:55,121 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 25 treesize of output 18 [2023-11-29 21:17:55,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:17:55,253 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 25 treesize of output 18 [2023-11-29 21:17:55,579 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 15 treesize of output 15 [2023-11-29 21:17:55,587 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 25 treesize of output 18 [2023-11-29 21:17:56,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 21:17:56,116 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2023-11-29 21:17:56,130 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-29 21:17:56,130 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 1 case distinctions, treesize of input 39 treesize of output 33 [2023-11-29 21:17:56,142 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 55 treesize of output 40 [2023-11-29 21:17:57,107 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 62 treesize of output 42 [2023-11-29 21:17:57,112 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 38 treesize of output 26 [2023-11-29 21:17:57,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:17:57,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2023-11-29 21:17:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:17:57,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:17:58,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:17:58,277 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 322 treesize of output 290 [2023-11-29 21:17:58,285 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 137 [2023-11-29 21:18:17,775 INFO L349 Elim1Store]: treesize reduction 4, result has 97.9 percent of original size [2023-11-29 21:18:17,776 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 5398 treesize of output 3874 [2023-11-29 21:20:23,477 INFO L349 Elim1Store]: treesize reduction 4, result has 97.9 percent of original size [2023-11-29 21:20:23,477 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 5654 treesize of output 4098 [2023-11-29 21:20:26,275 INFO L349 Elim1Store]: treesize reduction 8, result has 97.6 percent of original size [2023-11-29 21:20:26,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 16837 treesize of output 13705 [2023-11-29 21:20:43,713 INFO L349 Elim1Store]: treesize reduction 8, result has 97.6 percent of original size [2023-11-29 21:20:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7528 treesize of output 6124 [2023-11-29 21:21:02,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 21:21:02,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 21:21:02,116 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 21:21:02,245 INFO L349 Elim1Store]: treesize reduction 4, result has 97.9 percent of original size [2023-11-29 21:21:02,246 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 3268 treesize of output 2584 [2023-11-29 21:21:21,231 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 603 DAG size of output: 321 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 21:22:22,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:22:22,987 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 146 treesize of output 98 [2023-11-29 21:22:23,028 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 21:22:23,029 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 120999 treesize of output 115815 [2023-11-29 21:22:23,575 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 5383 treesize of output 4711 [2023-11-29 21:22:23,640 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 21:22:23,641 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 4711 treesize of output 4139 [2023-11-29 21:22:23,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:22:23,764 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 1374 treesize of output 1257 [2023-11-29 21:22:23,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 21:22:23,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2053 treesize of output 1769 [2023-11-29 21:22:24,422 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:22:24,422 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 146 treesize of output 1 [2023-11-29 21:22:24,435 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:22:24,435 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 85 treesize of output 1 [2023-11-29 21:22:24,441 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:22:24,441 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 29 treesize of output 1 [2023-11-29 21:22:24,452 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:22:24,452 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 146 treesize of output 1 [2023-11-29 21:23:24,991 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 21:23:24,991 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 18 [2023-11-29 21:23:25,001 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 21:23:25,001 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 18 [2023-11-29 21:23:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:23:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:23:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789491488] [2023-11-29 21:23:27,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 21:23:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354456722] [2023-11-29 21:23:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354456722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:23:27,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:23:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 52] total 106 [2023-11-29 21:23:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142487181] [2023-11-29 21:23:27,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 21:23:27,130 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-11-29 21:23:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:23:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-11-29 21:23:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=10490, Unknown=62, NotChecked=0, Total=11130 [2023-11-29 21:23:27,140 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 291 [2023-11-29 21:23:27,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 567 transitions, 4640 flow. Second operand has 106 states, 106 states have (on average 50.679245283018865) internal successors, (5372), 106 states have internal predecessors, (5372), 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) [2023-11-29 21:23:27,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:23:27,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 291 [2023-11-29 21:23:27,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:23:43,411 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse240 (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0))) (let ((.cse116 (select |c_#memory_$Pointer$.base| c_~B~0.base)) (.cse6 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)) (.cse262 (* .cse240 4)) (.cse306 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse307 (div (+ (- 1) (* c_~A~0.offset (- 1)) c_~F~0.offset) 4))) (let ((.cse123 (+ .cse240 .cse307)) (.cse211 (+ .cse307 c_thread1Thread1of1ForFork0_~i~0)) (.cse72 (+ 5 c_~F~0.offset .cse306)) (.cse73 (+ 5 .cse262 c_~F~0.offset)) (.cse74 (* 4 c_~M~0)) (.cse40 (select .cse116 .cse6)) (.cse64 (+ c_~F~0.offset .cse306)) (.cse43 (+ .cse262 c_~F~0.offset)) (.cse48 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse50 (not (= c_~B~0.base c_~A~0.base))) (.cse49 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse124 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0)))) (.cse114 (select |c_#memory_int| c_~A~0.base)) (.cse303 (+ c_~A~0.offset .cse306))) (let ((.cse28 (store |c_#memory_int| c_~A~0.base (store .cse114 .cse303 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse56 (and (or .cse48 .cse124) (or .cse124 .cse50) (not (= (select |c_#valid| c_~B~0.base) 0)) (or .cse49 .cse124))) (.cse154 (forall ((~a~0 Int)) (let ((.cse304 (* ~a~0 c_~M~0))) (let ((.cse305 (+ c_~A~0.offset (* .cse304 4) 1))) (or (= .cse304 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse64 .cse305) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse305)))))) (.cse51 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse61 (< c_~M~0 2)) (.cse60 (= .cse40 c_~B~0.base)) (.cse239 (select |c_#memory_int| c_~F~0.base)) (.cse91 (= .cse43 .cse303)) (.cse42 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse0 (< c_~M~0 1)) (.cse125 (< |c_ULTIMATE.start_main_~i~2#1| 1)) (.cse156 (forall ((~a~0 Int)) (let ((.cse301 (* ~a~0 c_~M~0))) (let ((.cse302 (+ c_~A~0.offset (* .cse301 4) .cse74))) (or (= .cse301 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse302 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse302 .cse73)))))) (.cse153 (forall ((~a~0 Int)) (let ((.cse300 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse211 .cse300) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse300 4) .cse74) .cse73))))) (.cse155 (forall ((~a~0 Int)) (let ((.cse299 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse299 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse299))))) (.cse47 (forall ((v_ArrVal_557 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))))) (let ((.cse18 (forall ((~a~0 Int)) (let ((.cse296 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse296 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse296) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse298 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse297 (select (select .cse298 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse297) (= (select (select (store .cse298 .cse297 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse15 (forall ((~a~0 Int)) (let ((.cse295 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse293 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse294 (select (select .cse293 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse293 .cse294 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse294))))) (< ~a~0 0) (< (+ c_~A~0.offset (* .cse295 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse295))))) (.cse16 (forall ((~a~0 Int)) (let ((.cse292 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse292 4) .cse74) .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse292))))) (.cse17 (or .cse155 .cse47)) (.cse78 (or .cse153 .cse47)) (.cse80 (forall ((~a~0 Int)) (let ((.cse289 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse211 .cse289) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse289 4) .cse74) .cse73) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse291 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse290 (select (select .cse291 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse290) (= (select (select (store .cse291 .cse290 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse81 (forall ((~a~0 Int)) (let ((.cse288 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse211 .cse288) .cse47 (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse288 4) .cse74) .cse73))))) (.cse82 (forall ((~a~0 Int)) (let ((.cse287 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse285 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse286 (select (select .cse285 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse285 .cse286 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse286))))) (< ~a~0 0) (< .cse211 .cse287) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse287 4) .cse74) .cse73))))) (.cse83 (or .cse47 .cse156)) (.cse84 (forall ((~a~0 Int)) (let ((.cse281 (* ~a~0 c_~M~0))) (let ((.cse284 (+ c_~A~0.offset (* .cse281 4) .cse74))) (or (= .cse281 c_thread1Thread1of1ForFork0_~i~0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse282 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse283 (select (select .cse282 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse282 .cse283 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse283))))) (< ~a~0 0) (< .cse284 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse284 .cse73)))))) (.cse75 (forall ((~a~0 Int)) (let ((.cse280 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse280 .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse280 .cse73))))) (.cse76 (forall ((~a~0 Int)) (let ((.cse277 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse277 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse277 .cse73) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse279 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse278 (select (select .cse279 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse278) (= (select (select (store .cse279 .cse278 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse86 (forall ((~a~0 Int)) (let ((.cse275 (* ~a~0 c_~M~0))) (let ((.cse276 (+ c_~A~0.offset (* .cse275 4) .cse74))) (or (= .cse275 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse276 .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse276 .cse73)))))) (.cse85 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse271 (* ~a~0 c_~M~0)) (.cse272 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse273 (select (select .cse272 c_~B~0.base) .cse6)) (.cse274 (+ c_~A~0.offset (* .cse271 4) .cse74))) (or (= .cse271 c_thread1Thread1of1ForFork0_~i~0) (not (= (select (select (store .cse272 .cse273 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse273) (< .cse274 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse274 .cse73)))))) (.cse14 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse268 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse269 (select (select .cse268 c_~B~0.base) .cse6)) (.cse270 (* ~a~0 c_~M~0))) (or (not (= (select (select (store .cse268 .cse269 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse269) (< (+ c_~A~0.offset (* .cse270 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse270)))))) (.cse55 (or .cse0 .cse125)) (.cse11 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse12 (+ .cse42 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse1 (< c_~N~0 1)) (.cse102 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse267 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse266 (select (select .cse267 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse266) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (= (select (select (store .cse267 .cse266 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (.cse103 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse265 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse264 (select (select .cse265 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse264) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (= (select (select (store .cse265 .cse264 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse0)) (.cse46 (forall ((~a~0 Int)) (or (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1))))) (.cse108 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse104 (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557) c_~B~0.base) c_~B~0.offset))))) (.cse45 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse263 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse263) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (= .cse263 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) (.cse44 (not .cse91)) (.cse157 (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1))))) (.cse13 (select .cse239 (+ .cse42 .cse262 c_~F~0.offset))) (.cse120 (not .cse60)) (.cse127 (or .cse51 .cse61)) (.cse79 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse260 (select (select .cse259 c_~B~0.base) .cse6)) (.cse261 (* ~a~0 c_~M~0))) (or (not (= (select (select (store .cse259 .cse260 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse260) (< .cse211 .cse261) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse261 4) .cse74) .cse73)))))) (.cse87 (or .cse154 .cse47)) (.cse62 (forall ((~a~0 Int)) (let ((.cse258 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse258) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse258))))) (.cse63 (forall ((~a~0 Int)) (let ((.cse255 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse255) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse255) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse257 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse256 (select (select .cse257 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse256) (= (select (select (store .cse257 .cse256 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse88 (forall ((~a~0 Int)) (let ((.cse253 (* ~a~0 c_~M~0))) (let ((.cse254 (+ c_~A~0.offset (* .cse253 4) 1))) (or (= .cse253 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse64 .cse254) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse254)))))) (.cse89 (forall ((~a~0 Int)) (let ((.cse249 (* ~a~0 c_~M~0))) (let ((.cse252 (+ c_~A~0.offset (* .cse249 4) 1))) (or (= .cse249 c_thread1Thread1of1ForFork0_~i~0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse250 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse251 (select (select .cse250 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse250 .cse251 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse251))))) (< ~a~0 0) (< .cse64 .cse252) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse252)))))) (.cse90 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse245 (* ~a~0 c_~M~0)) (.cse246 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse247 (select (select .cse246 c_~B~0.base) .cse6)) (.cse248 (+ c_~A~0.offset (* .cse245 4) 1))) (or (= .cse245 c_thread1Thread1of1ForFork0_~i~0) (not (= (select (select (store .cse246 .cse247 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse247) (< .cse64 .cse248) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse248)))))) (.cse126 (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (.cse173 (and (or .cse124 .cse51 .cse61) (or .cse56 .cse0 .cse51) (or .cse124 .cse0 .cse125))) (.cse206 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse243 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse244 (select (select .cse243 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse243 .cse244 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse244) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse0)) (.cse207 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse241 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse242 (select (select .cse241 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse241 .cse242 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse242) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))))) .cse0)) (.cse2 (= .cse240 c_thread1Thread1of1ForFork0_~i~0)) (.cse7 (= c_~F~0.base c_~A~0.base)) (.cse33 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse34 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse29 (select (select .cse28 c_~F~0.base) .cse43)) (.cse35 (not (= c_~M~0 1))) (.cse41 (select |c_#memory_int| .cse40)) (.cse59 (select .cse239 .cse43))) (and (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557) c_~B~0.base) c_~B~0.offset) c_~B~0.base))) .cse0 .cse1) (or (and (or .cse2 .cse1) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse4 (select (select .cse5 c_~B~0.base) .cse6))) (let ((.cse3 (select (select (store .cse5 .cse4 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse3 c_~A~0.base) (= .cse3 .cse4)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) .cse0 .cse7) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse8 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse11 .cse12 .cse13))) (.cse10 (* ~b~0 4))) (= (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_558) c_~B~0.base) .cse9)) (+ .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_560) c_~B~0.base) .cse9)))) (select (select .cse8 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse10)))))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse20 (select (select .cse21 c_~B~0.base) .cse6))) (let ((.cse19 (select (select (store .cse21 .cse20 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse19 .cse20) (< c_~N~0 (+ ~a~0 1)) (= .cse19 c_~F~0.base)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (or (< ~a~0 0) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse22 (select (select .cse23 c_~B~0.base) c_~B~0.offset))) (= .cse22 (select (select (store .cse23 .cse22 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse24 (select (select .cse26 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse24) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse25 (store .cse28 .cse24 (store (select .cse28 .cse24) v_arrayElimCell_21 .cse29))) (.cse27 (* ~b~0 4))) (= (select (select .cse25 (select (select (store .cse26 .cse24 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse27 v_arrayElimCell_22)) (select (select .cse25 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse27)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse31 (select (select .cse32 c_~B~0.base) c_~B~0.offset))) (let ((.cse30 (select (select (store .cse32 .cse31 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse30) (= .cse31 .cse30) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) .cse0) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| c_~A~0.base 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ c_~A~0.base 1)) (not (= (select |c_#valid| c_~A~0.base) 0)))) .cse35) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse38 (* ~b~0 4)) (.cse39 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13)))) (let ((.cse37 (select .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse36 (select (select .cse39 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse38)))) (or (= .cse36 (select .cse37 (+ .cse38 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse37 (+ .cse38 v_arrayElimCell_23)) .cse36)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))) (or (< c_~N~0 2) .cse0) (or .cse2 .cse0 (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))) (or .cse0 (and (or .cse44 .cse45) (or .cse44 .cse46 .cse47))) (or (and .cse48 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse49 .cse50) .cse0 .cse51) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse52 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (let ((.cse53 (select (select (store .cse54 .cse52 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse52 .cse53) (< c_~N~0 (+ ~a~0 1)) (= c_~F~0.base .cse53))))))) (or (and .cse33 .cse34 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse35) .cse55 (or (and (or .cse1 (< c_~N~0 (+ 2 c_thread2Thread1of1ForFork1_~i~1))) (or .cse1 (< c_thread2Thread1of1ForFork1_~i~1 1))) .cse0) (or .cse56 .cse35) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse57 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59))) (.cse58 (* ~b~0 4))) (= (select (select .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse58 v_arrayElimCell_22)) (select (select .cse57 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse58)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse60) (or .cse1 .cse61) (or (and (or (and (or (and .cse14 .cse16 .cse17 .cse18) .cse0) (or (and .cse62 .cse63 (or .cse47 (forall ((~a~0 Int)) (let ((.cse65 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse65) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse65))))) (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse67 (select (select .cse66 c_~B~0.base) .cse6)) (.cse68 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (not (= (select (select (store .cse66 .cse67 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse67) (< .cse64 .cse68) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse68)))))) .cse0) (or .cse0 (and (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse70 (select (select .cse69 c_~B~0.base) .cse6)) (.cse71 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (not (= (select (select (store .cse69 .cse70 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse70) (< .cse71 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse71 .cse73))))) .cse75 .cse76 (or (forall ((~a~0 Int)) (let ((.cse77 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse77 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse77 .cse73)))) .cse47))) (or (and .cse78 .cse79 .cse80 .cse81) .cse0)) .cse2) (or (and .cse14 .cse15 .cse16 .cse17) .cse0) (or .cse0 (and .cse78 .cse79 .cse81 .cse82)) (or (and .cse83 .cse84 .cse85 .cse86) .cse0) (or (and .cse87 .cse88 .cse89 .cse90) .cse0)) .cse91) (or (forall ((v_ArrVal_557 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)))) .cse0 .cse1) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse92 (* ~a~0 c_~M~0))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse94 (+ c_~A~0.offset (* .cse92 4) 1))) (or (= .cse92 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= c_~B~0.base .cse93) (< .cse64 .cse94) (= .cse93 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse94))))) .cse0) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse95 (select (select .cse97 c_~B~0.base) c_~B~0.offset))) (let ((.cse96 (select (select (store .cse97 .cse95 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse95 .cse96) (= c_~A~0.base .cse96) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))))) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse100 (select (select .cse99 c_~B~0.base) .cse6))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse98 (store .cse28 .cse100 (store (select .cse28 .cse100) v_arrayElimCell_22 .cse29))) (.cse101 (* ~b~0 4))) (= (select (select .cse98 (select (select (store .cse99 .cse100 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse101 v_arrayElimCell_23)) (select (select .cse98 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse101)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse100)))))) (or .cse44 (and .cse102 .cse103)) (or .cse0 .cse104 .cse51) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse107 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse106 (select (select .cse107 c_~B~0.base) c_~B~0.offset))) (let ((.cse105 (select (select (store .cse107 .cse106 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse105) (= .cse106 .cse105) (< c_~N~0 (+ ~a~0 1))))))) .cse0 .cse7) (or .cse108 .cse61) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse109 (* ~a~0 c_~M~0))) (let ((.cse110 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse111 (+ c_~A~0.offset (* .cse109 4) .cse74))) (or (= .cse109 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= c_~B~0.base .cse110) (< .cse111 .cse72) (= .cse110 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse111 .cse73)))))) (or .cse0 (and .cse48 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse49 .cse50) .cse51) (or (and .cse78 .cse79 .cse80 .cse81 .cse82) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< ~a~0 0) (let ((.cse113 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse112 (select (select .cse113 c_~B~0.base) c_~B~0.offset))) (= .cse112 (select (select (store .cse113 .cse112 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (or (and .cse83 .cse84 .cse85 (or (and .cse75 .cse76) .cse2) .cse86) .cse0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse115 (* ~b~0 4))) (= (select .cse114 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse115)) (let ((.cse117 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse116 .cse117)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse117) .cse115))))) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse118 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59))) (.cse119 (* ~b~0 4))) (= (select (select .cse118 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse119 v_arrayElimCell_23)) (select (select .cse118 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse119)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse120) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse122 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (= c_~B~0.base .cse121) (< (+ c_~A~0.offset (* .cse122 4) .cse74) .cse72) (= .cse121 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse123 .cse122)))) .cse0) (or .cse0 .cse90) (or .cse85 .cse0) (or (and (or .cse124 .cse125) (or .cse56 .cse51)) .cse35) (or .cse14 .cse0) (or .cse126 (and .cse55 .cse127 (or .cse0 .cse51 (and .cse48 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse49 .cse50)))) (or .cse44 (and (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse128 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse129 (select (select .cse128 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse128 .cse129 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse129) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse131 (select (select .cse130 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse130 .cse131 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse131) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))))) .cse0))) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse132 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse11 .cse12 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse133 (* ~b~0 4))) (= (select (select .cse132 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse133)) (let ((.cse134 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse132 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_558) c_~B~0.base) .cse134)) (+ .cse133 (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_560) c_~B~0.base) .cse134)))))) (< c_~N~0 (+ ~a~0 1)))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse137 (* ~b~0 4)) (.cse138 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13)))) (let ((.cse136 (select .cse138 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse135 (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse137)))) (or (forall ((v_arrayElimCell_23 Int)) (= .cse135 (select .cse136 (+ .cse137 v_arrayElimCell_23)))) (= (select .cse136 (+ .cse137 v_arrayElimCell_22)) .cse135))))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse143 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse144 (select (select .cse143 c_~B~0.base) .cse6))) (let ((.cse141 (* ~b~0 4)) (.cse142 (store .cse28 .cse144 (store (select .cse28 .cse144) v_arrayElimCell_22 .cse29)))) (let ((.cse140 (select .cse142 (select (select (store .cse143 .cse144 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse139 (select (select .cse142 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse141)))) (or (= .cse139 (select .cse140 (+ .cse141 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse140 (+ .cse141 v_arrayElimCell_23)) .cse139)))))))) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse147 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse146 (select (select .cse147 c_~B~0.base) c_~B~0.offset))) (let ((.cse145 (select (select (store .cse147 .cse146 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse145) (= .cse146 .cse145) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0)))))) .cse0) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse150 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse148 (select (select .cse150 c_~B~0.base) c_~B~0.offset))) (let ((.cse149 (select (select (store .cse150 .cse148 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse148 .cse149) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= c_~F~0.base .cse149)))))) .cse0) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse151 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59))) (.cse152 (* ~b~0 4))) (= (select (select .cse151 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse152 v_arrayElimCell_23)) (select (select .cse151 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse152)))) (< c_~N~0 (+ ~a~0 1)))) .cse120) (or (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) .cse35) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse35) (or .cse0 .cse1 .cse104) (or .cse47 (and (or .cse153 .cse0) (or .cse154 .cse0) (or .cse155 .cse0) (or .cse0 .cse156))) (or (and .cse102 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1))))) .cse103 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))))) .cse44) (or .cse44 (and (or .cse157 .cse0) (or .cse46 .cse0)) .cse47) (or .cse44 (and (or .cse0 (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse159 (select (select .cse158 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse158 .cse159 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse159))))) (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse161 (select (select .cse160 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse160 .cse161 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse161))))) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))))) (or (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse162 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse163 (select (select .cse162 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse162 .cse163 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse163))))) (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) .cse47 (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse165 (select (select .cse164 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse164 .cse165 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse165))))) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse0))) (or (and .cse48 .cse49 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse50) .cse0 .cse51) (or .cse108 .cse0 .cse104) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse166 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13))) (.cse167 (* ~b~0 4))) (= (select (select .cse166 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse167)) (select (select .cse166 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse167 v_arrayElimCell_22)))) (< c_~N~0 (+ ~a~0 1)))) .cse60) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse170 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse168 (select (select .cse170 c_~B~0.base) c_~B~0.offset))) (let ((.cse169 (select (select (store .cse170 .cse168 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse168 .cse169) (= c_~A~0.base .cse169) (< c_~N~0 (+ ~a~0 1))))))) .cse0 .cse7) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse172 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse171 (select (select .cse172 c_~B~0.base) c_~B~0.offset))) (= .cse171 (select (select (store .cse172 .cse171 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse0) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)) .cse173) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse175 (* ~b~0 4)) (.cse177 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59)))) (let ((.cse174 (select .cse177 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse176 (select (select .cse177 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse175)))) (or (= (select .cse174 (+ .cse175 v_arrayElimCell_22)) .cse176) (forall ((v_arrayElimCell_23 Int)) (= (select .cse174 (+ .cse175 v_arrayElimCell_23)) .cse176)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse178 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59))) (.cse179 (* ~b~0 4))) (= (select (select .cse178 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse179)) (select (select .cse178 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse179 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse60) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse180 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13))) (.cse181 (* ~b~0 4))) (= (select (select .cse180 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse181 v_arrayElimCell_22)) (select (select .cse180 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse181)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse60) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse184 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse182 (select (select .cse184 c_~B~0.base) c_~B~0.offset))) (let ((.cse183 (select (select (store .cse184 .cse182 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse182 .cse183) (< c_~N~0 (+ ~a~0 1)) (= c_~F~0.base .cse183)))))) .cse0) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse35) (or .cse44 .cse0 .cse45) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse185 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13))) (.cse186 (* ~b~0 4))) (= (select (select .cse185 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse186)) (select (select .cse185 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse186 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse120) (or .cse0 (and (or .cse44 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse187 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse187) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (= .cse187 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) (or .cse44 .cse157 .cse47))) (forall ((v_ArrVal_557 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse192 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse193 (select (select .cse192 c_~B~0.base) .cse6))) (let ((.cse189 (* ~b~0 4)) (.cse191 (store .cse28 .cse193 (store (select .cse28 .cse193) v_arrayElimCell_21 .cse29)))) (let ((.cse188 (select .cse191 (select (select (store .cse192 .cse193 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse190 (select (select .cse191 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse189)))) (or (= (select .cse188 (+ .cse189 v_arrayElimCell_22)) .cse190) (forall ((v_arrayElimCell_23 Int)) (= (select .cse188 (+ .cse189 v_arrayElimCell_23)) .cse190)))))))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (or .cse0 .cse7 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse196 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse195 (select (select .cse196 c_~B~0.base) c_~B~0.offset))) (let ((.cse194 (select (select (store .cse196 .cse195 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse194) (= .cse195 .cse194) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse197 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13))) (.cse198 (* ~b~0 4))) (= (select (select .cse197 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse198 v_arrayElimCell_23)) (select (select .cse197 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse198)))) (< c_~N~0 (+ ~a~0 1)))) .cse120) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse201 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse200 (select (select .cse201 c_~B~0.base) c_~B~0.offset))) (let ((.cse199 (select (select (store .cse201 .cse200 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse199) (= .cse200 .cse199) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) .cse0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse203 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse204 (select (select .cse203 c_~B~0.base) .cse6))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse202 (store .cse28 .cse204 (store (select .cse28 .cse204) v_arrayElimCell_21 .cse29))) (.cse205 (* ~b~0 4))) (= (select (select .cse202 (select (select (store .cse203 .cse204 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse205 v_arrayElimCell_23)) (select (select .cse202 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse205)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (not (= c_~B~0.base .cse204)))))) (or .cse2 (and .cse206 .cse207) .cse91) .cse127 (or .cse79 .cse0) (or (and .cse87 (or (and .cse62 .cse63) .cse2) .cse88 .cse89 .cse90) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (or (< ~a~0 0) (let ((.cse208 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse209 (select (select .cse208 c_~B~0.base) .cse6))) (= (select (select (store .cse208 .cse209 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse209))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse210 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse212 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (= c_~B~0.base .cse210) (< .cse211 .cse212) (= .cse210 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse212 4) .cse74) .cse73)))) .cse0) (or .cse126 .cse173) (or .cse2 .cse91 (and .cse206 (or (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))) .cse0) (or .cse0 (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse47) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse214 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse213 (select (select .cse214 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse213) (= (select (select (store .cse214 .cse213 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))) .cse0) .cse207 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse216 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse215 (select (select .cse216 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse215) (= (select (select (store .cse216 .cse215 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse0))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse219 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse217 (select (select .cse219 c_~B~0.base) c_~B~0.offset))) (let ((.cse218 (select (select (store .cse219 .cse217 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= .cse217 .cse218) (= c_~F~0.base .cse218)))))) .cse0) (or .cse0 (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse222 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse221 (select (select .cse222 c_~B~0.base) .cse6))) (let ((.cse220 (select (select (store .cse222 .cse221 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse220 c_~A~0.base) (= .cse220 .cse221)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))))) (or .cse2 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse225 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse224 (select (select .cse225 c_~B~0.base) .cse6))) (let ((.cse223 (select (select (store .cse225 .cse224 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse223 c_~A~0.base) (= .cse223 .cse224) (< c_~N~0 (+ ~a~0 1)))))))))) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse228 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse227 (select (select .cse228 c_~B~0.base) c_~B~0.offset))) (let ((.cse226 (select (select (store .cse228 .cse227 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse226) (= .cse227 .cse226)))))) .cse7) (or (and .cse33 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse34) .cse35 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse232 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse229 (select (select .cse232 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse229) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse230 (store .cse28 .cse229 (store (select .cse28 .cse229) v_arrayElimCell_22 .cse29))) (.cse231 (* ~b~0 4))) (= (select (select .cse230 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse231)) (select (select .cse230 (select (select (store .cse232 .cse229 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse231 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))))))) (or (and (or .cse124 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse124 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse124) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0))) .cse35) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< ~a~0 0) (let ((.cse234 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse233 (select (select .cse234 c_~B~0.base) c_~B~0.offset))) (= .cse233 (select (select (store .cse234 .cse233 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0)))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse237 (* ~b~0 4)) (.cse238 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59)))) (let ((.cse236 (select .cse238 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse235 (select (select .cse238 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse237)))) (or (= .cse235 (select .cse236 (+ .cse237 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse236 (+ .cse237 v_arrayElimCell_23)) .cse235)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))))))))) is different from true [2023-11-29 21:23:46,714 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse245 (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0))) (let ((.cse117 (select |c_#memory_$Pointer$.base| c_~B~0.base)) (.cse6 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)) (.cse267 (* .cse245 4)) (.cse311 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse312 (div (+ (- 1) (* c_~A~0.offset (- 1)) c_~F~0.offset) 4))) (let ((.cse124 (+ .cse245 .cse312)) (.cse216 (+ .cse312 c_thread1Thread1of1ForFork0_~i~0)) (.cse72 (+ 5 c_~F~0.offset .cse311)) (.cse73 (+ 5 .cse267 c_~F~0.offset)) (.cse74 (* 4 c_~M~0)) (.cse40 (select .cse117 .cse6)) (.cse64 (+ c_~F~0.offset .cse311)) (.cse43 (+ .cse267 c_~F~0.offset)) (.cse48 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse50 (not (= c_~B~0.base c_~A~0.base))) (.cse49 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse125 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0)))) (.cse115 (select |c_#memory_int| c_~A~0.base)) (.cse308 (+ c_~A~0.offset .cse311))) (let ((.cse28 (store |c_#memory_int| c_~A~0.base (store .cse115 .cse308 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse56 (and (or .cse48 .cse125) (or .cse125 .cse50) (not (= (select |c_#valid| c_~B~0.base) 0)) (or .cse49 .cse125))) (.cse155 (forall ((~a~0 Int)) (let ((.cse309 (* ~a~0 c_~M~0))) (let ((.cse310 (+ c_~A~0.offset (* .cse309 4) 1))) (or (= .cse309 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse64 .cse310) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse310)))))) (.cse51 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse61 (< c_~M~0 2)) (.cse60 (= .cse40 c_~B~0.base)) (.cse244 (select |c_#memory_int| c_~F~0.base)) (.cse91 (= .cse43 .cse308)) (.cse42 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse0 (< c_~M~0 1)) (.cse126 (< |c_ULTIMATE.start_main_~i~2#1| 1)) (.cse157 (forall ((~a~0 Int)) (let ((.cse306 (* ~a~0 c_~M~0))) (let ((.cse307 (+ c_~A~0.offset (* .cse306 4) .cse74))) (or (= .cse306 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse307 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse307 .cse73)))))) (.cse154 (forall ((~a~0 Int)) (let ((.cse305 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse216 .cse305) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse305 4) .cse74) .cse73))))) (.cse156 (forall ((~a~0 Int)) (let ((.cse304 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse304 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse304))))) (.cse47 (forall ((v_ArrVal_557 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))))) (let ((.cse18 (forall ((~a~0 Int)) (let ((.cse301 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse301 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse301) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse303 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse302 (select (select .cse303 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse302) (= (select (select (store .cse303 .cse302 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse15 (forall ((~a~0 Int)) (let ((.cse300 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse298 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse299 (select (select .cse298 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse298 .cse299 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse299))))) (< ~a~0 0) (< (+ c_~A~0.offset (* .cse300 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse300))))) (.cse16 (forall ((~a~0 Int)) (let ((.cse297 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse297 4) .cse74) .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse297))))) (.cse17 (or .cse156 .cse47)) (.cse78 (or .cse154 .cse47)) (.cse80 (forall ((~a~0 Int)) (let ((.cse294 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse216 .cse294) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse294 4) .cse74) .cse73) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse296 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse295 (select (select .cse296 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse295) (= (select (select (store .cse296 .cse295 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse81 (forall ((~a~0 Int)) (let ((.cse293 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse216 .cse293) .cse47 (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse293 4) .cse74) .cse73))))) (.cse82 (forall ((~a~0 Int)) (let ((.cse292 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse290 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse291 (select (select .cse290 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse290 .cse291 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse291))))) (< ~a~0 0) (< .cse216 .cse292) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse292 4) .cse74) .cse73))))) (.cse83 (or .cse47 .cse157)) (.cse84 (forall ((~a~0 Int)) (let ((.cse286 (* ~a~0 c_~M~0))) (let ((.cse289 (+ c_~A~0.offset (* .cse286 4) .cse74))) (or (= .cse286 c_thread1Thread1of1ForFork0_~i~0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse287 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse288 (select (select .cse287 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse287 .cse288 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse288))))) (< ~a~0 0) (< .cse289 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse289 .cse73)))))) (.cse75 (forall ((~a~0 Int)) (let ((.cse285 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse285 .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse285 .cse73))))) (.cse76 (forall ((~a~0 Int)) (let ((.cse282 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse282 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse282 .cse73) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse284 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse283 (select (select .cse284 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse283) (= (select (select (store .cse284 .cse283 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse86 (forall ((~a~0 Int)) (let ((.cse280 (* ~a~0 c_~M~0))) (let ((.cse281 (+ c_~A~0.offset (* .cse280 4) .cse74))) (or (= .cse280 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse281 .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse281 .cse73)))))) (.cse85 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse276 (* ~a~0 c_~M~0)) (.cse277 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse278 (select (select .cse277 c_~B~0.base) .cse6)) (.cse279 (+ c_~A~0.offset (* .cse276 4) .cse74))) (or (= .cse276 c_thread1Thread1of1ForFork0_~i~0) (not (= (select (select (store .cse277 .cse278 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse278) (< .cse279 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse279 .cse73)))))) (.cse14 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse273 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse274 (select (select .cse273 c_~B~0.base) .cse6)) (.cse275 (* ~a~0 c_~M~0))) (or (not (= (select (select (store .cse273 .cse274 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse274) (< (+ c_~A~0.offset (* .cse275 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse275)))))) (.cse55 (or .cse0 .cse126)) (.cse11 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse12 (+ .cse42 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse1 (< c_~N~0 1)) (.cse103 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse272 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse271 (select (select .cse272 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse271) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (= (select (select (store .cse272 .cse271 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (.cse104 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse270 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse269 (select (select .cse270 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse269) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (= (select (select (store .cse270 .cse269 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse0)) (.cse46 (forall ((~a~0 Int)) (or (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1))))) (.cse109 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse105 (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557) c_~B~0.base) c_~B~0.offset))))) (.cse176 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (.cse95 (+ |c_#StackHeapBarrier| 1)) (.cse45 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse268 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse268) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (= .cse268 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) (.cse44 (not .cse91)) (.cse159 (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1))))) (.cse13 (select .cse244 (+ .cse42 .cse267 c_~F~0.offset))) (.cse121 (not .cse60)) (.cse128 (or .cse51 .cse61)) (.cse79 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse264 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse265 (select (select .cse264 c_~B~0.base) .cse6)) (.cse266 (* ~a~0 c_~M~0))) (or (not (= (select (select (store .cse264 .cse265 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse265) (< .cse216 .cse266) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse266 4) .cse74) .cse73)))))) (.cse87 (or .cse155 .cse47)) (.cse62 (forall ((~a~0 Int)) (let ((.cse263 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse263) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse263))))) (.cse63 (forall ((~a~0 Int)) (let ((.cse260 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse260) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse260) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse262 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse261 (select (select .cse262 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse261) (= (select (select (store .cse262 .cse261 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (.cse88 (forall ((~a~0 Int)) (let ((.cse258 (* ~a~0 c_~M~0))) (let ((.cse259 (+ c_~A~0.offset (* .cse258 4) 1))) (or (= .cse258 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< .cse64 .cse259) .cse47 (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse259)))))) (.cse89 (forall ((~a~0 Int)) (let ((.cse254 (* ~a~0 c_~M~0))) (let ((.cse257 (+ c_~A~0.offset (* .cse254 4) 1))) (or (= .cse254 c_thread1Thread1of1ForFork0_~i~0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse255 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse256 (select (select .cse255 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse255 .cse256 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse256))))) (< ~a~0 0) (< .cse64 .cse257) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse257)))))) (.cse90 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse250 (* ~a~0 c_~M~0)) (.cse251 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse252 (select (select .cse251 c_~B~0.base) .cse6)) (.cse253 (+ c_~A~0.offset (* .cse250 4) 1))) (or (= .cse250 c_thread1Thread1of1ForFork0_~i~0) (not (= (select (select (store .cse251 .cse252 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse252) (< .cse64 .cse253) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse253)))))) (.cse127 (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (.cse178 (and (or .cse125 .cse51 .cse61) (or .cse56 .cse0 .cse51) (or .cse125 .cse0 .cse126))) (.cse211 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse248 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse249 (select (select .cse248 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse248 .cse249 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse249) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse0)) (.cse212 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse246 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse247 (select (select .cse246 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse246 .cse247 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse247) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))))) .cse0)) (.cse2 (= .cse245 c_thread1Thread1of1ForFork0_~i~0)) (.cse7 (= c_~F~0.base c_~A~0.base)) (.cse33 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse34 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse29 (select (select .cse28 c_~F~0.base) .cse43)) (.cse175 (<= (+ c_~M~0 1) 0)) (.cse158 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse177 (<= 0 c_~M~0)) (.cse35 (not (= c_~M~0 1))) (.cse41 (select |c_#memory_int| .cse40)) (.cse59 (select .cse244 .cse43))) (and (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557) c_~B~0.base) c_~B~0.offset) c_~B~0.base))) .cse0 .cse1) (or (and (or .cse2 .cse1) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse4 (select (select .cse5 c_~B~0.base) .cse6))) (let ((.cse3 (select (select (store .cse5 .cse4 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse3 c_~A~0.base) (= .cse3 .cse4)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) .cse0 .cse7) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse8 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse11 .cse12 .cse13))) (.cse10 (* ~b~0 4))) (= (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_558) c_~B~0.base) .cse9)) (+ .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_560) c_~B~0.base) .cse9)))) (select (select .cse8 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse10)))))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse20 (select (select .cse21 c_~B~0.base) .cse6))) (let ((.cse19 (select (select (store .cse21 .cse20 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse19 .cse20) (< c_~N~0 (+ ~a~0 1)) (= .cse19 c_~F~0.base)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (or (< ~a~0 0) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse22 (select (select .cse23 c_~B~0.base) c_~B~0.offset))) (= .cse22 (select (select (store .cse23 .cse22 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse24 (select (select .cse26 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse24) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse25 (store .cse28 .cse24 (store (select .cse28 .cse24) v_arrayElimCell_21 .cse29))) (.cse27 (* ~b~0 4))) (= (select (select .cse25 (select (select (store .cse26 .cse24 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse27 v_arrayElimCell_22)) (select (select .cse25 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse27)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse31 (select (select .cse32 c_~B~0.base) c_~B~0.offset))) (let ((.cse30 (select (select (store .cse32 .cse31 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse30) (= .cse31 .cse30) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) .cse0) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| c_~A~0.base 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ c_~A~0.base 1)) (not (= (select |c_#valid| c_~A~0.base) 0)))) .cse35) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse38 (* ~b~0 4)) (.cse39 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13)))) (let ((.cse37 (select .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse36 (select (select .cse39 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse38)))) (or (= .cse36 (select .cse37 (+ .cse38 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse37 (+ .cse38 v_arrayElimCell_23)) .cse36)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))) (or (< c_~N~0 2) .cse0) (or .cse2 .cse0 (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))) (or .cse0 (and (or .cse44 .cse45) (or .cse44 .cse46 .cse47))) (or (and .cse48 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse49 .cse50) .cse0 .cse51) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse52 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (let ((.cse53 (select (select (store .cse54 .cse52 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse52 .cse53) (< c_~N~0 (+ ~a~0 1)) (= c_~F~0.base .cse53))))))) (or (and .cse33 .cse34 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse35) .cse55 (or (and (or .cse1 (< c_~N~0 (+ 2 c_thread2Thread1of1ForFork1_~i~1))) (or .cse1 (< c_thread2Thread1of1ForFork1_~i~1 1))) .cse0) (or .cse56 .cse35) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse57 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59))) (.cse58 (* ~b~0 4))) (= (select (select .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse58 v_arrayElimCell_22)) (select (select .cse57 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse58)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse60) (or .cse1 .cse61) (or (and (or (and (or (and .cse14 .cse16 .cse17 .cse18) .cse0) (or (and .cse62 .cse63 (or .cse47 (forall ((~a~0 Int)) (let ((.cse65 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (< ~a~0 0) (< .cse64 .cse65) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse65))))) (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse67 (select (select .cse66 c_~B~0.base) .cse6)) (.cse68 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1))) (or (not (= (select (select (store .cse66 .cse67 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse67) (< .cse64 .cse68) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse68)))))) .cse0) (or .cse0 (and (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse70 (select (select .cse69 c_~B~0.base) .cse6)) (.cse71 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (not (= (select (select (store .cse69 .cse70 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse70) (< .cse71 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse71 .cse73))))) .cse75 .cse76 (or (forall ((~a~0 Int)) (let ((.cse77 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74))) (or (< ~a~0 0) (< .cse77 .cse72) (< c_~N~0 (+ ~a~0 1)) (< .cse77 .cse73)))) .cse47))) (or (and .cse78 .cse79 .cse80 .cse81) .cse0)) .cse2) (or (and .cse14 .cse15 .cse16 .cse17) .cse0) (or .cse0 (and .cse78 .cse79 .cse81 .cse82)) (or (and .cse83 .cse84 .cse85 .cse86) .cse0) (or (and .cse87 .cse88 .cse89 .cse90) .cse0)) .cse91) (or (forall ((v_ArrVal_557 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)))) .cse0 .cse1) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse92 (* ~a~0 c_~M~0))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse94 (+ c_~A~0.offset (* .cse92 4) 1))) (or (= .cse92 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= c_~B~0.base .cse93) (< .cse64 .cse94) (= .cse93 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse43 .cse94))))) .cse0) (<= .cse95 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse98 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse96 (select (select .cse98 c_~B~0.base) c_~B~0.offset))) (let ((.cse97 (select (select (store .cse98 .cse96 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse96 .cse97) (= c_~A~0.base .cse97) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))))) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse101 (select (select .cse100 c_~B~0.base) .cse6))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse99 (store .cse28 .cse101 (store (select .cse28 .cse101) v_arrayElimCell_22 .cse29))) (.cse102 (* ~b~0 4))) (= (select (select .cse99 (select (select (store .cse100 .cse101 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_23)) (select (select .cse99 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse101)))))) (or .cse44 (and .cse103 .cse104)) (or .cse0 .cse105 .cse51) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse108 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse107 (select (select .cse108 c_~B~0.base) c_~B~0.offset))) (let ((.cse106 (select (select (store .cse108 .cse107 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse106) (= .cse107 .cse106) (< c_~N~0 (+ ~a~0 1))))))) .cse0 .cse7) (or .cse109 .cse61) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse110 (* ~a~0 c_~M~0))) (let ((.cse111 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse112 (+ c_~A~0.offset (* .cse110 4) .cse74))) (or (= .cse110 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= c_~B~0.base .cse111) (< .cse112 .cse72) (= .cse111 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse112 .cse73)))))) (or .cse0 (and .cse48 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse49 .cse50) .cse51) (or (and .cse78 .cse79 .cse80 .cse81 .cse82) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< ~a~0 0) (let ((.cse114 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse113 (select (select .cse114 c_~B~0.base) c_~B~0.offset))) (= .cse113 (select (select (store .cse114 .cse113 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (or (and .cse83 .cse84 .cse85 (or (and .cse75 .cse76) .cse2) .cse86) .cse0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse116 (* ~b~0 4))) (= (select .cse115 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse116)) (let ((.cse118 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse117 .cse118)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse118) .cse116))))) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse119 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59))) (.cse120 (* ~b~0 4))) (= (select (select .cse119 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse120 v_arrayElimCell_23)) (select (select .cse119 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse120)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse121) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse122 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse123 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (= c_~B~0.base .cse122) (< (+ c_~A~0.offset (* .cse123 4) .cse74) .cse72) (= .cse122 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse124 .cse123)))) .cse0) (or .cse0 .cse90) (or .cse85 .cse0) (or (and (or .cse125 .cse126) (or .cse56 .cse51)) .cse35) (or .cse14 .cse0) (or .cse127 (and .cse55 .cse128 (or .cse0 .cse51 (and .cse48 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse49 .cse50)))) (or .cse44 (and (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse129 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse130 (select (select .cse129 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse129 .cse130 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse130) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse132 (select (select .cse131 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse131 .cse132 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< ~a~0 0) (= c_~B~0.base .cse132) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))))) .cse0))) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse133 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse11 .cse12 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse134 (* ~b~0 4))) (= (select (select .cse133 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse134)) (let ((.cse135 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse133 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_558) c_~B~0.base) .cse135)) (+ .cse134 (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_560) c_~B~0.base) .cse135)))))) (< c_~N~0 (+ ~a~0 1)))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse138 (* ~b~0 4)) (.cse139 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13)))) (let ((.cse137 (select .cse139 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse136 (select (select .cse139 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse138)))) (or (forall ((v_arrayElimCell_23 Int)) (= .cse136 (select .cse137 (+ .cse138 v_arrayElimCell_23)))) (= (select .cse137 (+ .cse138 v_arrayElimCell_22)) .cse136))))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse144 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse145 (select (select .cse144 c_~B~0.base) .cse6))) (let ((.cse142 (* ~b~0 4)) (.cse143 (store .cse28 .cse145 (store (select .cse28 .cse145) v_arrayElimCell_22 .cse29)))) (let ((.cse141 (select .cse143 (select (select (store .cse144 .cse145 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse140 (select (select .cse143 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse142)))) (or (= .cse140 (select .cse141 (+ .cse142 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse141 (+ .cse142 v_arrayElimCell_23)) .cse140)))))))) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse148 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse147 (select (select .cse148 c_~B~0.base) c_~B~0.offset))) (let ((.cse146 (select (select (store .cse148 .cse147 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse146) (= .cse147 .cse146) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0)))))) .cse0) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse151 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse149 (select (select .cse151 c_~B~0.base) c_~B~0.offset))) (let ((.cse150 (select (select (store .cse151 .cse149 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse149 .cse150) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= c_~F~0.base .cse150)))))) .cse0) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse152 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59))) (.cse153 (* ~b~0 4))) (= (select (select .cse152 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse153 v_arrayElimCell_23)) (select (select .cse152 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse153)))) (< c_~N~0 (+ ~a~0 1)))) .cse121) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse35) (or .cse0 .cse1 .cse105) (or .cse47 (and (or .cse154 .cse0) (or .cse155 .cse0) (or .cse156 .cse0) (or .cse0 .cse157))) (or (and .cse103 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1))))) .cse104 (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))))) .cse44) .cse158 (or .cse44 (and (or .cse159 .cse0) (or .cse46 .cse0)) .cse47) (or .cse44 (and (or .cse0 (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse161 (select (select .cse160 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse160 .cse161 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse161))))) (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) .cse47 (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse162 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse163 (select (select .cse162 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse162 .cse163 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse163))))) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (< c_~N~0 (+ ~a~0 1)))))) (or (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse165 (select (select .cse164 c_~B~0.base) .cse6))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse164 .cse165 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse165))))) (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) .cse47 (< c_~N~0 (+ ~a~0 1)))) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse166 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse167 (select (select .cse166 c_~B~0.base) .cse6))) (or (not (= (select (select (store .cse166 .cse167 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (= c_~B~0.base .cse167))))) (< .cse64 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse0))) (or (and .cse48 .cse49 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse50) .cse0 .cse51) (or .cse109 .cse0 .cse105) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse168 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13))) (.cse169 (* ~b~0 4))) (= (select (select .cse168 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse169)) (select (select .cse168 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse169 v_arrayElimCell_22)))) (< c_~N~0 (+ ~a~0 1)))) .cse60) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (let ((.cse172 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse170 (select (select .cse172 c_~B~0.base) c_~B~0.offset))) (let ((.cse171 (select (select (store .cse172 .cse170 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse170 .cse171) (= c_~A~0.base .cse171) (< c_~N~0 (+ ~a~0 1))))))) .cse0 .cse7) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse174 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse173 (select (select .cse174 c_~B~0.base) c_~B~0.offset))) (= .cse173 (select (select (store .cse174 .cse173 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse0) (or (and .cse175 .cse176) (and (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse177)) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)) .cse178) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse180 (* ~b~0 4)) (.cse182 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse59)))) (let ((.cse179 (select .cse182 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse181 (select (select .cse182 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse180)))) (or (= (select .cse179 (+ .cse180 v_arrayElimCell_22)) .cse181) (forall ((v_arrayElimCell_23 Int)) (= (select .cse179 (+ .cse180 v_arrayElimCell_23)) .cse181)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse183 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59))) (.cse184 (* ~b~0 4))) (= (select (select .cse183 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse184)) (select (select .cse183 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse184 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse60) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse185 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13))) (.cse186 (* ~b~0 4))) (= (select (select .cse185 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse186 v_arrayElimCell_22)) (select (select .cse185 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse186)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse60) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse189 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse187 (select (select .cse189 c_~B~0.base) c_~B~0.offset))) (let ((.cse188 (select (select (store .cse189 .cse187 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse187 .cse188) (< c_~N~0 (+ ~a~0 1)) (= c_~F~0.base .cse188)))))) .cse0) .cse176 (<= .cse95 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse33 .cse34 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse35) (or .cse44 .cse0 .cse45) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse190 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_21) .cse13))) (.cse191 (* ~b~0 4))) (= (select (select .cse190 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse191)) (select (select .cse190 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse191 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse121) (or .cse0 (and (or .cse44 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse192 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse192) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse72) (= .cse192 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) (or .cse44 .cse159 .cse47))) (forall ((v_ArrVal_557 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse197 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse198 (select (select .cse197 c_~B~0.base) .cse6))) (let ((.cse194 (* ~b~0 4)) (.cse196 (store .cse28 .cse198 (store (select .cse28 .cse198) v_arrayElimCell_21 .cse29)))) (let ((.cse193 (select .cse196 (select (select (store .cse197 .cse198 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse195 (select (select .cse196 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse194)))) (or (= (select .cse193 (+ .cse194 v_arrayElimCell_22)) .cse195) (forall ((v_arrayElimCell_23 Int)) (= (select .cse193 (+ .cse194 v_arrayElimCell_23)) .cse195)))))))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (or .cse0 .cse7 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse201 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse200 (select (select .cse201 c_~B~0.base) c_~B~0.offset))) (let ((.cse199 (select (select (store .cse201 .cse200 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse199) (= .cse200 .cse199) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse202 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse42 v_arrayElimCell_22) .cse13))) (.cse203 (* ~b~0 4))) (= (select (select .cse202 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse203 v_arrayElimCell_23)) (select (select .cse202 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse203)))) (< c_~N~0 (+ ~a~0 1)))) .cse121) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse206 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse205 (select (select .cse206 c_~B~0.base) c_~B~0.offset))) (let ((.cse204 (select (select (store .cse206 .cse205 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse204) (= .cse205 .cse204) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) .cse0) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse208 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse209 (select (select .cse208 c_~B~0.base) .cse6))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse207 (store .cse28 .cse209 (store (select .cse28 .cse209) v_arrayElimCell_21 .cse29))) (.cse210 (* ~b~0 4))) (= (select (select .cse207 (select (select (store .cse208 .cse209 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse210 v_arrayElimCell_23)) (select (select .cse207 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse210)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (not (= c_~B~0.base .cse209)))))) (or .cse2 (and .cse211 .cse212) .cse91) .cse128 (or .cse79 .cse0) (or (and .cse87 (or (and .cse62 .cse63) .cse2) .cse88 .cse89 .cse90) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (or (< ~a~0 0) (let ((.cse213 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse214 (select (select .cse213 c_~B~0.base) .cse6))) (= (select (select (store .cse213 .cse214 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse214))) (< c_~N~0 (+ ~a~0 1)))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (let ((.cse215 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (.cse217 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (= c_~B~0.base .cse215) (< .cse216 .cse217) (= .cse215 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* .cse217 4) .cse74) .cse73)))) .cse0) (or .cse127 .cse178) (or .cse2 .cse91 (and .cse211 (or (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))) .cse0) (or .cse0 (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse47) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse219 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse218 (select (select .cse219 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse218) (= (select (select (store .cse219 .cse218 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))))) .cse0) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int)) (or (< ~a~0 0) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557) c_~B~0.base) .cse6)) (< c_~N~0 (+ ~a~0 1)) (< .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)))) .cse0) .cse212 (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse221 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse220 (select (select .cse221 c_~B~0.base) .cse6))) (or (< ~a~0 0) (= c_~B~0.base .cse220) (= (select (select (store .cse221 .cse220 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse74) .cse73))))) .cse0))) (or (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse224 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse222 (select (select .cse224 c_~B~0.base) c_~B~0.offset))) (let ((.cse223 (select (select (store .cse224 .cse222 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= .cse222 .cse223) (= c_~F~0.base .cse223)))))) .cse0) (or .cse0 (and (forall ((~a~0 Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse227 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse226 (select (select .cse227 c_~B~0.base) .cse6))) (let ((.cse225 (select (select (store .cse227 .cse226 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse225 c_~A~0.base) (= .cse225 .cse226)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse43 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))))) (or .cse2 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int))) (let ((.cse230 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse229 (select (select .cse230 c_~B~0.base) .cse6))) (let ((.cse228 (select (select (store .cse230 .cse229 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse228 c_~A~0.base) (= .cse228 .cse229) (< c_~N~0 (+ ~a~0 1)))))))))) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse233 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse232 (select (select .cse233 c_~B~0.base) c_~B~0.offset))) (let ((.cse231 (select (select (store .cse233 .cse232 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse231) (= .cse232 .cse231)))))) .cse7) (or (and .cse33 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse34) .cse35 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (forall ((v_ArrVal_557 (Array Int Int))) (let ((.cse237 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_557))) (let ((.cse234 (select (select .cse237 c_~B~0.base) .cse6))) (or (= c_~B~0.base .cse234) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse235 (store .cse28 .cse234 (store (select .cse28 .cse234) v_arrayElimCell_22 .cse29))) (.cse236 (* ~b~0 4))) (= (select (select .cse235 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse236)) (select (select .cse235 (select (select (store .cse237 .cse234 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse236 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))))))) (or (and .cse175 .cse158) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse177)) (or (and (or .cse125 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse125 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse125) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0))) .cse35) (or .cse0 (forall ((v_ArrVal_557 (Array Int Int)) (~a~0 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (< ~a~0 0) (let ((.cse239 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_555) c_~A~0.base v_ArrVal_557))) (let ((.cse238 (select (select .cse239 c_~B~0.base) c_~B~0.offset))) (= .cse238 (select (select (store .cse239 .cse238 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0)))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_558 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse242 (* ~b~0 4)) (.cse243 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse59)))) (let ((.cse241 (select .cse243 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_558) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse240 (select (select .cse243 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse242)))) (or (= .cse240 (select .cse241 (+ .cse242 v_arrayElimCell_22))) (forall ((v_arrayElimCell_23 Int)) (= (select .cse241 (+ .cse242 v_arrayElimCell_23)) .cse240)))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))))))))) is different from true [2023-11-29 21:23:49,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:24:28,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:24:53,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:01,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:10,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:14,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:22,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:40,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:25:48,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:26:01,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:26:11,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:26:19,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:26:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:26:46,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:27:00,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:27:22,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:27:28,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:23,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:27,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:29,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=true, quantifiers [1] [2023-11-29 21:29:30,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:33,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:36,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:38,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:41,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:49,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:51,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:55,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:29:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:03,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:06,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:10,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:14,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:19,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=true, quantifiers [1] [2023-11-29 21:30:22,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:29,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:53,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:54,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:30:58,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:00,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:05,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:06,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:10,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:12,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:17,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:34,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:38,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:43,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:44,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:51,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:31:58,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:32:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:32:05,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 21:32:11,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] Received shutdown request... [2023-11-29 21:32:13,484 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:32:13,494 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:32:14,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 21:32:14,684 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-29 21:32:14,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-29 21:32:14,812 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-29 21:32:14,812 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 21:32:14,812 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-29 21:32:14,813 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-29 21:32:14,813 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-29 21:32:14,813 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:14,816 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:32:14,816 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:32:14,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:32:14 BasicIcfg [2023-11-29 21:32:14,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:32:14,818 INFO L158 Benchmark]: Toolchain (without parser) took 870053.50ms. Allocated memory was 362.8MB in the beginning and 962.6MB in the end (delta: 599.8MB). Free memory was 322.9MB in the beginning and 758.3MB in the end (delta: -435.5MB). Peak memory consumption was 615.1MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,818 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory was 319.1MB in the beginning and 318.9MB in the end (delta: 237.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.95ms. Allocated memory is still 362.8MB. Free memory was 322.9MB in the beginning and 310.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.74ms. Allocated memory is still 362.8MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,819 INFO L158 Benchmark]: Boogie Preprocessor took 26.78ms. Allocated memory is still 362.8MB. Free memory was 308.4MB in the beginning and 306.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,819 INFO L158 Benchmark]: RCFGBuilder took 426.31ms. Allocated memory is still 362.8MB. Free memory was 306.3MB in the beginning and 282.1MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,819 INFO L158 Benchmark]: TraceAbstraction took 869411.83ms. Allocated memory was 362.8MB in the beginning and 962.6MB in the end (delta: 599.8MB). Free memory was 281.5MB in the beginning and 758.3MB in the end (delta: -476.8MB). Peak memory consumption was 573.2MB. Max. memory is 16.0GB. [2023-11-29 21:32:14,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory was 319.1MB in the beginning and 318.9MB in the end (delta: 237.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 156.95ms. Allocated memory is still 362.8MB. Free memory was 322.9MB in the beginning and 310.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 27.74ms. Allocated memory is still 362.8MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.78ms. Allocated memory is still 362.8MB. Free memory was 308.4MB in the beginning and 306.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 426.31ms. Allocated memory is still 362.8MB. Free memory was 306.3MB in the beginning and 282.1MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 869411.83ms. Allocated memory was 362.8MB in the beginning and 962.6MB in the end (delta: 599.8MB). Free memory was 281.5MB in the beginning and 758.3MB in the end (delta: -476.8MB). Peak memory consumption was 573.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 302 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 869.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 530.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 188 mSolverCounterUnknown, 1569 SdHoareTripleChecker+Valid, 203.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1569 mSDsluCounter, 9855 SdHoareTripleChecker+Invalid, 200.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 104 IncrementalHoareTripleChecker+Unchecked, 9276 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7521 IncrementalHoareTripleChecker+Invalid, 7991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 579 mSDtfsCounter, 7521 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2563 GetRequests, 2261 SyntacticMatches, 7 SemanticMatches, 295 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12153 ImplicationChecksByTransitivity, 461.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4640occurred in iteration=6, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 336.2s InterpolantComputationTime, 1515 NumberOfCodeBlocks, 1515 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 2414 ConstructedInterpolants, 208 QuantifiedInterpolants, 86399 SizeOfPredicates, 115 NumberOfNonLiveVariables, 3445 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 25/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown