/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:59:49,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:59:49,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 12:59:49,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 12:59:49,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 12:59:49,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:59:49,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 12:59:49,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 12:59:49,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:59:49,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:59:49,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:59:49,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:59:49,216 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:59:49,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:59:49,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:59:49,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:59:49,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:59:49,223 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:59:49,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:59:49,223 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:59:49,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:59:49,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:59:49,224 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:59:49,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:59:49,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:59:49,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:59:49,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:59:49,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:59:49,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:59:49,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:59:49,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 12:59:49,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 12:59:49,227 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 12:59:49,227 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 12:59:49,227 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 12:59:49,227 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: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:59:49,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:59:49,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:59:49,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:59:49,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:59:49,454 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:59:49,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-17 12:59:50,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:59:50,897 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:59:50,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-17 12:59:50,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede0ee050/820e78ebe4474d7c979a52fa7791e028/FLAG2a7b45ba4 [2023-11-17 12:59:50,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede0ee050/820e78ebe4474d7c979a52fa7791e028 [2023-11-17 12:59:50,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:59:50,934 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:59:50,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:59:50,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:59:50,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:59:50,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:59:50" (1/1) ... [2023-11-17 12:59:50,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45302c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:50, skipping insertion in model container [2023-11-17 12:59:50,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:59:50" (1/1) ... [2023-11-17 12:59:50,976 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:59:51,122 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 12:59:51,256 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-17 12:59:51,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:59:51,279 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:59:51,299 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 12:59:51,317 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-17 12:59:51,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:59:51,346 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:59:51,347 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:59:51,347 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:59:51,352 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:59:51,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51 WrapperNode [2023-11-17 12:59:51,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:59:51,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:59:51,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:59:51,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:59:51,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,402 INFO L138 Inliner]: procedures = 171, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-17 12:59:51,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:59:51,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:59:51,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:59:51,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:59:51,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:59:51,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:59:51,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:59:51,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:59:51,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (1/1) ... [2023-11-17 12:59:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:59:51,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:51,455 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-17 12:59:51,457 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-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 12:59:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:59:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:59:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:59:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:59:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:59:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:59:51,481 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 12:59:51,581 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:59:51,582 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:59:51,734 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:59:51,881 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:59:51,881 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 12:59:51,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:59:51 BoogieIcfgContainer [2023-11-17 12:59:51,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:59:51,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:59:51,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:59:51,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:59:51,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:59:50" (1/3) ... [2023-11-17 12:59:51,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508e1080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:59:51, skipping insertion in model container [2023-11-17 12:59:51,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:51" (2/3) ... [2023-11-17 12:59:51,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508e1080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:59:51, skipping insertion in model container [2023-11-17 12:59:51,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:59:51" (3/3) ... [2023-11-17 12:59:51,891 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-17 12:59:51,897 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 12:59:51,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:59:51,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:59:51,904 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:59:51,951 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 12:59:51,996 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:51,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 12:59:51,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:52,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 12:59:52,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 12:59:52,065 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 12:59:52,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-17 12:59:52,085 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@578164c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:52,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 12:59:52,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 12:59:52,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 606400581, now seen corresponding path program 1 times [2023-11-17 12:59:52,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013292368] [2023-11-17 12:59:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:59:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:59:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013292368] [2023-11-17 12:59:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013292368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:59:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:59:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:59:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702466583] [2023-11-17 12:59:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:59:52,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 12:59:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:59:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 12:59:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 12:59:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:52,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 12:59:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-17 12:59:52,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:59:52,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 12:59:52,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1237003992, now seen corresponding path program 1 times [2023-11-17 12:59:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011671852] [2023-11-17 12:59:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:59:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:59:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011671852] [2023-11-17 12:59:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011671852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:59:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373841822] [2023-11-17 12:59:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:59:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:53,399 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-17 12:59:53,417 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-17 12:59:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:53,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 12:59:53,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:59:53,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:59:53,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 12:59:53,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:59:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:59:53,857 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-17 12:59:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 12:59:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:59:53,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:59:56,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296))) (or (and (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (let ((.cse1 (select .cse3 |c_~#value~0.base|))) (or (not (= .cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (forall ((|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (let ((.cse2 (store .cse3 |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (or (= .cse0 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (or (= (mod (select v_DerPreprocessor_1 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store .cse4 |thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (= .cse0 4294967295))) is different from false [2023-11-17 12:59:56,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse5 4294967296))) (or (= .cse0 4294967295) (and (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (or (= (mod (select v_DerPreprocessor_1 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store .cse1 |thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (or (forall ((|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (let ((.cse2 (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse5))))) (store .cse2 |thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse0)))))))))) is different from false [2023-11-17 12:59:56,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse5 4294967296))) (or (= .cse0 4294967295) (and (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (or (= (mod (select v_DerPreprocessor_1 0) 4294967296) 0) (< .cse0 (mod (select (select (store .cse1 |thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (let ((.cse2 (select .cse4 |c_~#value~0.base|))) (or (not (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) .cse0)) (forall ((|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (let ((.cse3 (store .cse4 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse5))))) (store .cse3 |thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_~#casret~0#1.base|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) is different from false [2023-11-17 12:59:56,926 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_37 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (or (= (mod (select v_DerPreprocessor_1 0) 4294967296) 0) (< .cse1 (mod (select (select (store .cse0 |thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (= 4294967295 .cse1)))) (forall ((v_ArrVal_37 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_37) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod .cse6 4294967296))) (or (= 4294967295 .cse2) (forall ((v_ArrVal_38 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_38))) (let ((.cse3 (select .cse5 |c_~#value~0.base|))) (or (not (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) .cse2)) (forall ((|thr1Thread1of1ForFork0_~#casret~0#1.base| Int)) (< .cse2 (mod (select (select (let ((.cse4 (store .cse5 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse4 |thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse4 |thr1Thread1of1ForFork0_~#casret~0#1.base|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))) is different from false [2023-11-17 12:59:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-17 12:59:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373841822] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:59:56,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:59:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 23 [2023-11-17 12:59:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612027151] [2023-11-17 12:59:56,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:59:56,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 12:59:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:59:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 12:59:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=341, Unknown=6, NotChecked=164, Total=600 [2023-11-17 12:59:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:56,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 12:59:56,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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-17 12:59:56,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:56,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 12:59:58,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 12:59:58,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 12:59:58,337 WARN L477 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-17 12:59:58,343 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 12:59:58,344 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-17 12:59:58,347 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 12:59:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:58,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 12:59:58,353 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 12:59:58,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 12:59:58,354 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@578164c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 12:59:58,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-11-17 12:59:58,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:59:58,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash 597451201, now seen corresponding path program 1 times [2023-11-17 12:59:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217124571] [2023-11-17 12:59:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:58,436 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-17 12:59:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:59:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217124571] [2023-11-17 12:59:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217124571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:59:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:59:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:59:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574207190] [2023-11-17 12:59:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:59:58,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 12:59:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:59:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 12:59:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 12:59:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 12:59:58,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 12:59:58,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:59:58,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:59:58,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 597451232, now seen corresponding path program 1 times [2023-11-17 12:59:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:58,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328886458] [2023-11-17 12:59:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:59:58,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 12:59:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:59:58,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 12:59:58,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 12:59:58,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-17 12:59:58,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:59:58,511 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 12:59:58,512 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-17 12:59:58,513 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 12:59:58,513 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 12:59:58,538 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 12:59:58,540 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 12:59:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:58,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 12:59:58,577 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 12:59:58,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 12:59:58,578 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@578164c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 12:59:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-17 12:59:58,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:59:58,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1805555504, now seen corresponding path program 1 times [2023-11-17 12:59:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329729380] [2023-11-17 12:59:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:59:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:59:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329729380] [2023-11-17 12:59:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329729380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:59:58,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:59:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:59:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658721030] [2023-11-17 12:59:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:59:58,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 12:59:58,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:59:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 12:59:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 12:59:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 12:59:58,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-17 12:59:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:58,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 12:59:58,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:59:58,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1887823217, now seen corresponding path program 1 times [2023-11-17 12:59:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:58,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817167968] [2023-11-17 12:59:58,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:59:58,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 12:59:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:59:58,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 12:59:58,893 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 12:59:58,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-17 12:59:58,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 12:59:58,895 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 12:59:58,896 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-17 12:59:58,896 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 12:59:58,896 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 12:59:58,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 12:59:58,921 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 12:59:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:59:58,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 12:59:58,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-11-17 12:59:58,932 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 12:59:58,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-17 12:59:58,933 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@578164c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:59:58,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 12:59:59,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 12:59:59,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1180279273, now seen corresponding path program 1 times [2023-11-17 12:59:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831780658] [2023-11-17 12:59:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:59:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:59:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:59:59,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831780658] [2023-11-17 12:59:59,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831780658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:59:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:59:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:59:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53005313] [2023-11-17 12:59:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:59:59,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 12:59:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:59:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 12:59:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 12:59:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:59,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 12:59:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-17 12:59:59,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 12:59:59,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 12:59:59,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 12:59:59,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:59:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1121742838, now seen corresponding path program 1 times [2023-11-17 12:59:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:59:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455799756] [2023-11-17 12:59:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:59:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:59:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:00:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:00:00,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455799756] [2023-11-17 13:00:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455799756] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:00:00,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994688812] [2023-11-17 13:00:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:00:00,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:00:00,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:00:00,792 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-17 13:00:00,808 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-17 13:00:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:00,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-17 13:00:00,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:00:00,957 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 13:00:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 13:00:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:00:01,080 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-17 13:00:01,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-17 13:00:01,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:00:01,385 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 13:00:01,386 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-17 13:00:01,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:00:01,524 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 35 treesize of output 18 [2023-11-17 13:00:02,167 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-17 13:00:02,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2023-11-17 13:00:02,272 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-17 13:00:02,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 31 [2023-11-17 13:00:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:00:02,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:00:03,738 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse6 (select .cse3 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse5 (store .cse3 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse1 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (let ((.cse4 (select (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (store .cse4 |c_~#value~0.offset| (+ (select .cse4 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse0)))))) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (let ((.cse9 (store .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse8 (let ((.cse10 (select .cse9 |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse8) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse9 |c_~#value~0.base| .cse8) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-17 13:00:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-17 13:00:14,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994688812] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:00:14,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:00:14,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 40 [2023-11-17 13:00:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137662670] [2023-11-17 13:00:14,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:00:14,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-17 13:00:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:00:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-17 13:00:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1314, Unknown=23, NotChecked=76, Total=1640 [2023-11-17 13:00:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:14,333 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:00:14,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:00:14,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:14,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:16,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse66 (select .cse26 |c_~#value~0.offset|))) (let ((.cse45 (mod .cse66 4294967296)) (.cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse16 (= .cse45 .cse5)) (.cse28 (+ 1 .cse66)) (.cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (= (mod (select (select .cse62 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse64 (store .cse62 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse63 (let ((.cse65 (select .cse64 |c_~#value~0.base|))) (store .cse65 |c_~#value~0.offset| (+ (select .cse65 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse63) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse64 |c_~#value~0.base| .cse63) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse0) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (let ((.cse2 (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse2 |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))) (or (= 4294967295 .cse5) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse6 (select .cse9 |c_~#value~0.base|))) (or (not (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse11 (store .cse9 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse7 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (let ((.cse10 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) .cse12)) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (store .cse14 |c_~#value~0.base| (let ((.cse15 (select .cse14 |c_~#value~0.base|))) (store .cse15 |c_~#value~0.offset| (+ (select .cse15 |c_~#value~0.offset|) 1))))))) (store .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse16) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse17 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse17) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 0) 4294967296) 0) (< .cse17 (mod (select (select (store (let ((.cse19 (store .cse21 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3))) (let ((.cse18 (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (store .cse20 |c_~#value~0.offset| (+ (select .cse20 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3) |c_~#value~0.base| .cse18) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse19 |c_~#value~0.base| .cse18) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse17)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) (or (not .cse16) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse22 (let ((.cse25 (store |c_#memory_int| |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse23 (store (select .cse25 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse23) |c_~#value~0.base| (let ((.cse24 (select (store .cse25 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse23) |c_~#value~0.base|))) (store .cse24 |c_~#value~0.offset| (+ (select .cse24 |c_~#value~0.offset|) 1)))))))) (store .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse27 (store |c_#memory_int| |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| .cse28)))) (store .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse29 (mod .cse36 4294967296))) (or (= 4294967295 .cse29) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse35 (select .cse32 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse29 (mod (select (select (store (let ((.cse34 (store .cse32 |c_~#value~0.base| (store .cse35 |c_~#value~0.offset| (+ .cse36 1))))) (let ((.cse30 (store (select .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse31 (let ((.cse33 (select (store .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base|))) (store .cse33 |c_~#value~0.offset| (+ (select .cse33 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse32 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse35 |c_~#value~0.offset|) 4294967296) .cse29)))))))))))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse38 (mod .cse44 4294967296))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse37 (select .cse41 |c_~#value~0.base|))) (or (not (= (mod (select .cse37 |c_~#value~0.offset|) 4294967296) .cse38)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse38 (mod (select (select (store (let ((.cse43 (store .cse41 |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| (+ .cse44 1))))) (let ((.cse39 (store (select .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0 1))) (let ((.cse40 (let ((.cse42 (select (store .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base|))) (store .cse42 |c_~#value~0.offset| (+ (select .cse42 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse41 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (= 4294967295 .cse38))))))) (= |c_~#value~0.base| 3) (= |c_thr1Thread1of3ForFork0_~vn~0#1| 1) (= |c_thr1Thread1of3ForFork0_~v~0#1| 0) (or (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse45 (mod (select (select (store (let ((.cse47 (store .cse49 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse46 (let ((.cse48 (select .cse47 |c_~#value~0.base|))) (store .cse48 |c_~#value~0.offset| (+ (select .cse48 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse46) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse47 |c_~#value~0.base| .cse46) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse45 (mod (select (select .cse49 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse55 (select .cse52 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse45 (mod (select (select (store (let ((.cse54 (store .cse52 |c_~#value~0.base| (store .cse55 |c_~#value~0.offset| .cse28)))) (let ((.cse50 (store (select .cse54 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse51 (let ((.cse53 (select (store .cse54 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base|))) (store .cse53 |c_~#value~0.offset| (+ (select .cse53 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base| .cse51) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse52 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base| .cse51) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse45 (mod (select .cse55 |c_~#value~0.offset|) 4294967296)))))))))) (= .cse45 4294967295)) .cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse56 (select .cse59 |c_~#value~0.base|))) (or (not (= (mod (select .cse56 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse61 (store .cse59 |c_~#value~0.base| (store .cse56 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse57 (store (select .cse61 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse58 (let ((.cse60 (select (store .cse61 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base|))) (store .cse60 |c_~#value~0.offset| (+ (select .cse60 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base| .cse58) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse59 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base| .cse58) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-11-17 13:00:18,822 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse66 (select .cse26 |c_~#value~0.offset|))) (let ((.cse45 (mod .cse66 4294967296)) (.cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse16 (= .cse45 .cse5)) (.cse28 (+ 1 .cse66)) (.cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (= (mod (select (select .cse62 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse64 (store .cse62 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse63 (let ((.cse65 (select .cse64 |c_~#value~0.base|))) (store .cse65 |c_~#value~0.offset| (+ (select .cse65 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse63) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse64 |c_~#value~0.base| .cse63) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse0) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (let ((.cse2 (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse2 |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))) (or (= 4294967295 .cse5) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse6 (select .cse9 |c_~#value~0.base|))) (or (not (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse11 (store .cse9 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse7 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (let ((.cse10 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) .cse12)) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (store .cse14 |c_~#value~0.base| (let ((.cse15 (select .cse14 |c_~#value~0.base|))) (store .cse15 |c_~#value~0.offset| (+ (select .cse15 |c_~#value~0.offset|) 1))))))) (store .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse16) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse17 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse17) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 0) 4294967296) 0) (< .cse17 (mod (select (select (store (let ((.cse19 (store .cse21 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3))) (let ((.cse18 (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (store .cse20 |c_~#value~0.offset| (+ (select .cse20 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3) |c_~#value~0.base| .cse18) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse19 |c_~#value~0.base| .cse18) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse17)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) (or (not .cse16) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse22 (let ((.cse25 (store |c_#memory_int| |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse23 (store (select .cse25 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse23) |c_~#value~0.base| (let ((.cse24 (select (store .cse25 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse23) |c_~#value~0.base|))) (store .cse24 |c_~#value~0.offset| (+ (select .cse24 |c_~#value~0.offset|) 1)))))))) (store .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse27 (store |c_#memory_int| |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| .cse28)))) (store .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse29 (mod .cse36 4294967296))) (or (= 4294967295 .cse29) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse35 (select .cse32 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse29 (mod (select (select (store (let ((.cse34 (store .cse32 |c_~#value~0.base| (store .cse35 |c_~#value~0.offset| (+ .cse36 1))))) (let ((.cse30 (store (select .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse31 (let ((.cse33 (select (store .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base|))) (store .cse33 |c_~#value~0.offset| (+ (select .cse33 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse32 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse35 |c_~#value~0.offset|) 4294967296) .cse29)))))))))))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse38 (mod .cse44 4294967296))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse37 (select .cse41 |c_~#value~0.base|))) (or (not (= (mod (select .cse37 |c_~#value~0.offset|) 4294967296) .cse38)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse38 (mod (select (select (store (let ((.cse43 (store .cse41 |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| (+ .cse44 1))))) (let ((.cse39 (store (select .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0 1))) (let ((.cse40 (let ((.cse42 (select (store .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base|))) (store .cse42 |c_~#value~0.offset| (+ (select .cse42 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse41 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (= 4294967295 .cse38))))))) (= |c_~#value~0.base| 3) (= |c_thr1Thread1of3ForFork0_~vn~0#1| 1) (= |c_thr1Thread1of3ForFork0_~v~0#1| 0) (or (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse45 (mod (select (select (store (let ((.cse47 (store .cse49 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse46 (let ((.cse48 (select .cse47 |c_~#value~0.base|))) (store .cse48 |c_~#value~0.offset| (+ (select .cse48 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse46) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse47 |c_~#value~0.base| .cse46) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse45 (mod (select (select .cse49 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse55 (select .cse52 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse45 (mod (select (select (store (let ((.cse54 (store .cse52 |c_~#value~0.base| (store .cse55 |c_~#value~0.offset| .cse28)))) (let ((.cse50 (store (select .cse54 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse51 (let ((.cse53 (select (store .cse54 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base|))) (store .cse53 |c_~#value~0.offset| (+ (select .cse53 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base| .cse51) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse52 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse50) |c_~#value~0.base| .cse51) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse45 (mod (select .cse55 |c_~#value~0.offset|) 4294967296)))))))))) (= .cse45 4294967295)) .cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse56 (select .cse59 |c_~#value~0.base|))) (or (not (= (mod (select .cse56 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse61 (store .cse59 |c_~#value~0.base| (store .cse56 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse57 (store (select .cse61 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse58 (let ((.cse60 (select (store .cse61 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base|))) (store .cse60 |c_~#value~0.offset| (+ (select .cse60 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base| .cse58) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse59 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse57) |c_~#value~0.base| .cse58) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from true [2023-11-17 13:00:25,966 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse58 (select .cse27 |c_~#value~0.offset|))) (let ((.cse47 (mod .cse58 4294967296))) (let ((.cse70 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse47)) (.cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse13 (or .cse70 (forall ((v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (.cse45 (not .cse70))) (let ((.cse17 (= .cse47 .cse5)) (.cse28 (and .cse13 (or .cse45 (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse69 (store |c_#memory_int| |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse69 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse69 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (.cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (= (mod (select (select .cse65 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse67 (store .cse65 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse66 (let ((.cse68 (select .cse67 |c_~#value~0.base|))) (store .cse68 |c_~#value~0.offset| (+ (select .cse68 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse66) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse67 |c_~#value~0.base| .cse66) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse0) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (let ((.cse2 (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse2 |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))) (exists ((|thr1Thread2of3ForFork0_~#casret~0#1.base| Int)) (and (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1))) (or (= 4294967295 .cse5) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse6 (select .cse9 |c_~#value~0.base|))) (or (not (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse11 (store .cse9 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse7 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (let ((.cse10 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) .cse12)) (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) .cse13 (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int)) (and (= (select (select |c_#memory_int| |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_~#value~0.base| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (store .cse15 |c_~#value~0.base| (let ((.cse16 (select .cse15 |c_~#value~0.base|))) (store .cse16 |c_~#value~0.offset| (+ (select .cse16 |c_~#value~0.offset|) 1))))))) (store .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse17) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse18 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse18) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 0) 4294967296) 0) (< .cse18 (mod (select (select (store (let ((.cse20 (store .cse22 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3))) (let ((.cse19 (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (store .cse21 |c_~#value~0.offset| (+ (select .cse21 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3) |c_~#value~0.base| .cse19) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse20 |c_~#value~0.base| .cse19) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse18)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) (or (not .cse17) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse23 (let ((.cse26 (store |c_#memory_int| |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse24 (store (select .cse26 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse24) |c_~#value~0.base| (let ((.cse25 (select (store .cse26 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse24) |c_~#value~0.base|))) (store .cse25 |c_~#value~0.offset| (+ (select .cse25 |c_~#value~0.offset|) 1)))))))) (store .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) .cse28) (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse29 (mod .cse36 4294967296))) (or (= 4294967295 .cse29) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse35 (select .cse32 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse29 (mod (select (select (store (let ((.cse34 (store .cse32 |c_~#value~0.base| (store .cse35 |c_~#value~0.offset| (+ .cse36 1))))) (let ((.cse30 (store (select .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse31 (let ((.cse33 (select (store .cse34 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base|))) (store .cse33 |c_~#value~0.offset| (+ (select .cse33 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse32 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse30) |c_~#value~0.base| .cse31) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse35 |c_~#value~0.offset|) 4294967296) .cse29)))))))))))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse38 (mod .cse44 4294967296))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse37 (select .cse41 |c_~#value~0.base|))) (or (not (= (mod (select .cse37 |c_~#value~0.offset|) 4294967296) .cse38)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse38 (mod (select (select (store (let ((.cse43 (store .cse41 |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| (+ .cse44 1))))) (let ((.cse39 (store (select .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0 1))) (let ((.cse40 (let ((.cse42 (select (store .cse43 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base|))) (store .cse42 |c_~#value~0.offset| (+ (select .cse42 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse41 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse39) |c_~#value~0.base| .cse40) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (= 4294967295 .cse38))))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse45 (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse46 (store |c_#memory_int| |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse46 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse46 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= |c_thr1Thread1of3ForFork0_~vn~0#1| 1) (or (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) .cse28) (= |c_thr1Thread1of3ForFork0_~v~0#1| 0) (or (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse47 (mod (select (select (store (let ((.cse49 (store .cse51 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse48 (let ((.cse50 (select .cse49 |c_~#value~0.base|))) (store .cse50 |c_~#value~0.offset| (+ (select .cse50 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse48) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse49 |c_~#value~0.base| .cse48) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse47 (mod (select (select .cse51 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse57 (select .cse54 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse47 (mod (select (select (store (let ((.cse56 (store .cse54 |c_~#value~0.base| (store .cse57 |c_~#value~0.offset| (+ 1 .cse58))))) (let ((.cse52 (store (select .cse56 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse53 (let ((.cse55 (select (store .cse56 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse52) |c_~#value~0.base|))) (store .cse55 |c_~#value~0.offset| (+ (select .cse55 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse52) |c_~#value~0.base| .cse53) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse54 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse52) |c_~#value~0.base| .cse53) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse47 (mod (select .cse57 |c_~#value~0.offset|) 4294967296)))))))))) (= .cse47 4294967295)) (= (select (select |c_#memory_int| 3) 0) 2) .cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse59 (select .cse62 |c_~#value~0.base|))) (or (not (= (mod (select .cse59 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse64 (store .cse62 |c_~#value~0.base| (store .cse59 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse60 (store (select .cse64 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse61 (let ((.cse63 (select (store .cse64 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse60) |c_~#value~0.base|))) (store .cse63 |c_~#value~0.offset| (+ (select .cse63 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse60) |c_~#value~0.base| .cse61) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse62 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse60) |c_~#value~0.base| .cse61) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) is different from true [2023-11-17 13:00:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 13:00:30,266 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-17 13:00:30,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:00:30,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:00:30,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:00:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1365769995, now seen corresponding path program 1 times [2023-11-17 13:00:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:00:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682542772] [2023-11-17 13:00:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:00:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:00:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:00:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:00:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682542772] [2023-11-17 13:00:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682542772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:00:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501422045] [2023-11-17 13:00:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:00:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:00:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:00:32,617 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-17 13:00:32,620 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-17 13:00:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:32,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 13:00:32,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:00:32,865 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:00:32,866 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-17 13:00:33,028 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 13:00:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-17 13:00:33,331 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:00:33,331 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-17 13:00:33,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:00:33,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:00:33,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:00:34,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2023-11-17 13:00:34,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2023-11-17 13:00:34,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2023-11-17 13:00:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-17 13:00:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:00:34,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:00:36,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 219 [2023-11-17 13:00:36,383 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 118 treesize of output 114 [2023-11-17 13:00:36,400 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 114 treesize of output 112 [2023-11-17 13:00:36,417 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 112 treesize of output 108 [2023-11-17 13:00:36,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2023-11-17 13:00:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:00:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501422045] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:00:37,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:00:37,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 24 [2023-11-17 13:00:37,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284366419] [2023-11-17 13:00:37,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:00:37,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 13:00:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:00:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 13:00:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=560, Unknown=6, NotChecked=0, Total=650 [2023-11-17 13:00:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:37,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:00:37,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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-17 13:00:37,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:37,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-17 13:00:37,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 13:00:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:00:46,137 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-17 13:00:46,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:00:46,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:00:46,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:00:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -608497406, now seen corresponding path program 1 times [2023-11-17 13:00:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:00:46,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117743821] [2023-11-17 13:00:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:00:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:00:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:00:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:00:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117743821] [2023-11-17 13:00:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117743821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:00:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296516601] [2023-11-17 13:00:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:00:52,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:00:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:00:52,797 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:00:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 13:00:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:00:52,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 13:00:52,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:00:53,036 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 13:00:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 13:00:53,526 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-17 13:00:53,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-17 13:00:53,838 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 13:00:53,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 13:00:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:00:54,698 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 14 treesize of output 14 [2023-11-17 13:00:54,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-17 13:00:55,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-17 13:00:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 13:00:55,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:00:58,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-17 13:00:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 13:00:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296516601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:00:58,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:00:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 9] total 38 [2023-11-17 13:00:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233011498] [2023-11-17 13:00:58,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:00:58,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-17 13:00:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:00:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-17 13:00:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1331, Unknown=15, NotChecked=0, Total=1482 [2023-11-17 13:00:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:58,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:00:58,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5128205128205128) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:00:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:00:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-17 13:00:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:00:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:01:19,209 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse28 |c_~#value~0.offset|))) (let ((.cse46 (mod .cse14 4294967296)) (.cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse18 (= .cse46 .cse5)) (.cse13 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse29 (let ((.cse67 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse46))) (and (or .cse67 (forall ((v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (not .cse67) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse68 (store |c_#memory_int| |c_~#value~0.base| (store .cse28 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse68 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse68 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (.cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (= (mod (select (select .cse63 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse65 (store .cse63 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse64 (let ((.cse66 (select .cse65 |c_~#value~0.base|))) (store .cse66 |c_~#value~0.offset| (+ (select .cse66 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse64) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse65 |c_~#value~0.base| .cse64) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (and (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse0) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (let ((.cse2 (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse2 |c_~#value~0.base| .cse1) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))) (or (= 4294967295 .cse5) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse6 (select .cse9 |c_~#value~0.base|))) (or (not (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse11 (store .cse9 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse7 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (let ((.cse10 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| .cse8) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) .cse12)) (or (and .cse13 (= 1 .cse14)) (= 2 .cse14)) (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (exists ((|thr1Thread2of3ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_~#value~0.base| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select (store (let ((.cse15 (let ((.cse16 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (store .cse16 |c_~#value~0.base| (let ((.cse17 (select .cse16 |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ (select .cse17 |c_~#value~0.offset|) 1))))))) (store .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse18) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse19 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse19) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 0) 4294967296) 0) (< .cse19 (mod (select (select (store (let ((.cse21 (store .cse23 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3))) (let ((.cse20 (let ((.cse22 (select .cse21 |c_~#value~0.base|))) (store .cse22 |c_~#value~0.offset| (+ (select .cse22 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_3) |c_~#value~0.base| .cse20) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse21 |c_~#value~0.base| .cse20) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse19)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) (or (not .cse18) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse24 (let ((.cse27 (store |c_#memory_int| |c_~#value~0.base| (store .cse28 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse25 (store (select .cse27 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse25) |c_~#value~0.base| (let ((.cse26 (select (store .cse27 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse25) |c_~#value~0.base|))) (store .cse26 |c_~#value~0.offset| (+ (select .cse26 |c_~#value~0.offset|) 1)))))))) (store .cse24 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse24 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) .cse29) .cse13 (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse30 (mod .cse37 4294967296))) (or (= 4294967295 .cse30) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse36 (select .cse33 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse30 (mod (select (select (store (let ((.cse35 (store .cse33 |c_~#value~0.base| (store .cse36 |c_~#value~0.offset| (+ .cse37 1))))) (let ((.cse31 (store (select .cse35 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse32 (let ((.cse34 (select (store .cse35 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse31) |c_~#value~0.base|))) (store .cse34 |c_~#value~0.offset| (+ (select .cse34 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse31) |c_~#value~0.base| .cse32) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse33 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse31) |c_~#value~0.base| .cse32) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (mod (select .cse36 |c_~#value~0.offset|) 4294967296) .cse30)))))))))))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_174 Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse39 (mod .cse45 4294967296))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| v_ArrVal_174) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse38 (select .cse42 |c_~#value~0.base|))) (or (not (= (mod (select .cse38 |c_~#value~0.offset|) 4294967296) .cse39)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse39 (mod (select (select (store (let ((.cse44 (store .cse42 |c_~#value~0.base| (store .cse38 |c_~#value~0.offset| (+ .cse45 1))))) (let ((.cse40 (store (select .cse44 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13|) 0 1))) (let ((.cse41 (let ((.cse43 (select (store .cse44 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse40) |c_~#value~0.base|))) (store .cse43 |c_~#value~0.offset| (+ (select .cse43 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse40) |c_~#value~0.base| .cse41) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse42 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_13| .cse40) |c_~#value~0.base| .cse41) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (= 4294967295 .cse39))))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (= |c_thr1Thread1of3ForFork0_~vn~0#1| 1) (or (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) .cse29) (= |c_thr1Thread1of3ForFork0_~v~0#1| 0) (or (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (or (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse46 (mod (select (select (store (let ((.cse48 (store .cse50 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3))) (let ((.cse47 (let ((.cse49 (select .cse48 |c_~#value~0.base|))) (store .cse49 |c_~#value~0.offset| (+ (select .cse49 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base| .cse47) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store .cse48 |c_~#value~0.base| .cse47) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse46 (mod (select (select .cse50 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse56 (select .cse53 |c_~#value~0.base|))) (or (forall ((v_ArrVal_187 (Array Int Int))) (< .cse46 (mod (select (select (store (let ((.cse55 (store .cse53 |c_~#value~0.base| (store .cse56 |c_~#value~0.offset| (+ 1 .cse14))))) (let ((.cse51 (store (select .cse55 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse52 (let ((.cse54 (select (store .cse55 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse51) |c_~#value~0.base|))) (store .cse54 |c_~#value~0.offset| (+ (select .cse54 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse51) |c_~#value~0.base| .cse52) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse53 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse51) |c_~#value~0.base| .cse52) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse46 (mod (select .cse56 |c_~#value~0.offset|) 4294967296)))))))))) (= .cse46 4294967295)) (= (select (select |c_#memory_int| 3) 0) 2) .cse12 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_176))) (let ((.cse57 (select .cse60 |c_~#value~0.base|))) (or (not (= (mod (select .cse57 |c_~#value~0.offset|) 4294967296) .cse5)) (forall ((v_ArrVal_187 (Array Int Int))) (< .cse5 (mod (select (select (store (let ((.cse62 (store .cse60 |c_~#value~0.base| (store .cse57 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse58 (store (select .cse62 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse59 (let ((.cse61 (select (store .cse62 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse58) |c_~#value~0.base|))) (store .cse61 |c_~#value~0.offset| (+ (select .cse61 |c_~#value~0.offset|) 1))))) (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse58) |c_~#value~0.base| .cse59) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select (store (store .cse60 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse58) |c_~#value~0.base| .cse59) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0 1))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_187) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))) is different from true [2023-11-17 13:01:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:01:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 13:01:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:01:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:01:29,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 13:01:29,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 13:01:29,726 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:01:29,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:01:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1496383076, now seen corresponding path program 2 times [2023-11-17 13:01:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:01:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539819780] [2023-11-17 13:01:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:01:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:01:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:01:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:01:35,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:01:35,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539819780] [2023-11-17 13:01:35,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539819780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:01:35,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115340133] [2023-11-17 13:01:35,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:01:35,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:01:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:01:35,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:01:35,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 13:01:35,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:01:35,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:01:35,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 13:01:35,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:01:35,866 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:01:35,867 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-17 13:01:36,220 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:01:36,221 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-17 13:01:36,897 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 13:01:36,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 13:01:37,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:01:37,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:01:37,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-11-17 13:01:37,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-17 13:01:38,619 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 13:01:38,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 13:01:39,461 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-17 13:01:39,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-17 13:01:39,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:01:39,859 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 14 treesize of output 14 [2023-11-17 13:01:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-17 13:01:40,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 77 [2023-11-17 13:01:40,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:01:40,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:01:40,563 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 15 treesize of output 7 [2023-11-17 13:01:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:01:40,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:01:41,894 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (let ((.cse1 (not .cse0))) (and (or .cse0 (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13) |c_~#value~0.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or .cse1 (forall ((v_ArrVal_443 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_443) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_443))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse1)))) is different from false [2023-11-17 13:01:43,008 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_441 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_441))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (let ((.cse0 (store .cse1 |c_~#value~0.base| v_ArrVal_443))) (store .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_ArrVal_441 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_441))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (mod (select (select (store (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (and (forall ((v_ArrVal_441 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_441))) (or (= .cse2 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_11 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (< 0 (mod (select (select (store (store (store .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13) |c_~#value~0.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (forall ((v_ArrVal_441 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_441))) (or (not (= .cse2 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (forall ((v_ArrVal_443 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (< 0 (mod (select (select (store (store (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse5 |c_~#value~0.base| v_ArrVal_443) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)))) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0)) is different from false [2023-11-17 13:02:13,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:13,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:13,972 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 1341 treesize of output 1331 [2023-11-17 13:02:13,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2023-11-17 13:02:14,007 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 109 treesize of output 97 [2023-11-17 13:02:14,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-17 13:02:14,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:14,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 302 [2023-11-17 13:02:14,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-17 13:02:14,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:14,231 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 23 treesize of output 27 [2023-11-17 13:02:14,243 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 28 treesize of output 24 [2023-11-17 13:02:14,294 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:14,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:14,352 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 1284 treesize of output 1274 [2023-11-17 13:02:14,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-17 13:02:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2023-11-17 13:02:14,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-17 13:02:14,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:14,583 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 658 treesize of output 606 [2023-11-17 13:02:14,613 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 32 treesize of output 28 [2023-11-17 13:02:14,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:14,655 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 21 treesize of output 25 [2023-11-17 13:02:14,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-17 13:02:14,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-17 13:02:14,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-17 13:02:14,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:14,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:14,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1300 treesize of output 1290 [2023-11-17 13:02:14,829 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 108 treesize of output 100 [2023-11-17 13:02:14,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2023-11-17 13:02:14,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-17 13:02:14,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-17 13:02:14,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-17 13:02:14,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:02:14,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 677 treesize of output 625 [2023-11-17 13:02:15,048 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 34 treesize of output 30 [2023-11-17 13:02:15,059 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 30 treesize of output 28 [2023-11-17 13:02:15,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:02:15,101 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 36 treesize of output 40 [2023-11-17 13:02:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 4 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-17 13:02:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115340133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:02:22,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:02:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 48 [2023-11-17 13:02:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076273340] [2023-11-17 13:02:22,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:02:22,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-17 13:02:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:02:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-17 13:02:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1932, Unknown=31, NotChecked=182, Total=2352 [2023-11-17 13:02:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:02:22,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:02:22,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:02:22,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:02:22,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-17 13:02:22,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:02:22,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:02:22,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:02:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:02:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 13:02:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:02:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:02:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 13:02:52,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 13:02:52,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:02:52,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:02:52,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:02:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1113899621, now seen corresponding path program 2 times [2023-11-17 13:02:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:02:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523486230] [2023-11-17 13:02:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:02:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:02:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:02:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:02:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:02:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523486230] [2023-11-17 13:02:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523486230] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:02:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577705770] [2023-11-17 13:02:55,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:02:55,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:02:55,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:02:55,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:02:55,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 13:02:55,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:02:55,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:02:55,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 13:02:55,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:02:56,065 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:02:56,065 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-17 13:02:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:02:56,515 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:02:56,515 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-17 13:02:56,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:02:57,635 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 13:02:57,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-17 13:02:57,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:02:58,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 13:02:59,335 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 13:02:59,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 13:03:00,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-17 13:03:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-17 13:03:00,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-17 13:03:00,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:03:01,330 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-17 13:03:01,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-11-17 13:03:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:03:01,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:03:03,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= .cse2 (mod (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= .cse2 (mod (select (select (store (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse1)))))))) is different from false [2023-11-17 13:03:03,391 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse1 (mod .cse5 4294967296))) (and (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= .cse2 (mod (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= .cse2 (mod (select (select (store (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse5))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse1))))))))) is different from false [2023-11-17 13:03:15,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse4 (store .cse7 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|))) (let ((.cse5 (store .cse6 |c_~#value~0.base| .cse4))) (let ((.cse2 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (select (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse4) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base|)) (.cse1 (mod .cse3 4294967296))) (or (not (= (mod (select .cse0 |c_~#value~0.offset|) 4294967296) .cse1)) (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)))))))))))) (not (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse8)))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse9 (select .cse15 |c_~#value~0.base|))) (or (not (= (mod (select .cse9 |c_~#value~0.offset|) 4294967296) .cse8)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse14 (store .cse9 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|))) (let ((.cse12 (store .cse15 |c_~#value~0.base| .cse14))) (let ((.cse13 (store (select .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse11 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse14) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527)) (.cse10 (mod (select (select (store .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse13) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= .cse10 (mod (select (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse10))))))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (let ((.cse20 (select (select (store .cse16 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse19 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse17 (select .cse19 |c_~#value~0.base|)) (.cse18 (mod .cse20 4294967296))) (or (not (= (mod (select .cse17 |c_~#value~0.offset|) 4294967296) .cse18)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (not (= (mod (select (select (store (store .cse19 |c_~#value~0.base| (store .cse17 |c_~#value~0.offset| (+ .cse20 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse18))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse21 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_79)) (.cse22 (mod (select (select (store .cse23 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse22) (not (= (mod (select (select (store .cse21 v_prenex_80 v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse22)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) v_prenex_80) 0))))) (= (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8)))))) is different from false [2023-11-17 13:03:16,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse0 (select .cse8 |c_~#value~0.base|))) (or (not (= (mod (select .cse0 |c_~#value~0.offset|) 4294967296) .cse1)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse6 (store .cse0 |c_~#value~0.offset| .cse9))) (let ((.cse7 (store .cse8 |c_~#value~0.base| .cse6))) (let ((.cse2 (store (select .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base|)) (.cse5 (mod .cse4 4294967296))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5))) (not (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) .cse5))))))))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse16 (select .cse15 |c_~#value~0.base|))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse14 (store .cse16 |c_~#value~0.offset| .cse9))) (let ((.cse12 (store .cse15 |c_~#value~0.base| .cse14))) (let ((.cse13 (store (select .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse10 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse14) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527)) (.cse11 (mod (select (select (store .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse13) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= (mod (select (select (store .cse10 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11))))))))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)))) (not (= (mod (select .cse16 |c_~#value~0.offset|) 4294967296) .cse1)))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (let ((.cse21 (select (select (store .cse17 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse18 (select .cse20 |c_~#value~0.base|)) (.cse19 (mod .cse21 4294967296))) (or (not (= (mod (select .cse18 |c_~#value~0.offset|) 4294967296) .cse19)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (not (= (mod (select (select (store (store .cse20 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| (+ .cse21 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse19))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_79)) (.cse23 (mod (select (select (store .cse24 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse23) (not (= (mod (select (select (store .cse22 v_prenex_80 v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse23)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) v_prenex_80) 0))))) (= (mod (select (select .cse24 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)))))) is different from false [2023-11-17 13:03:16,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse8 (+ 1 .cse25)) (.cse9 (mod .cse25 4294967296))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse4 (store .cse7 |c_~#value~0.offset| .cse8))) (let ((.cse5 (store .cse6 |c_~#value~0.base| .cse4))) (let ((.cse2 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (select (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (mod .cse3 4294967296)) (.cse0 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse4) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base|))) (or (not (= (mod (select .cse0 |c_~#value~0.offset|) 4294967296) .cse1)) (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= .cse1 (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))))) (not (= .cse9 (mod (select .cse7 |c_~#value~0.offset|) 4294967296))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= .cse9 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_79)) (.cse12 (mod (select (select (store .cse10 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse12) (not (= (mod (select (select (store .cse11 v_prenex_80 v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse12)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) v_prenex_80) 0)))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse19 (select .cse18 |c_~#value~0.base|))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse17 (store .cse19 |c_~#value~0.offset| .cse8))) (let ((.cse15 (store .cse18 |c_~#value~0.base| .cse17))) (let ((.cse16 (store (select .cse15 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse13 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse17) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527)) (.cse14 (mod (select (select (store .cse15 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= (mod (select (select (store .cse13 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse14))) (= (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse14))))))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)))) (not (= .cse9 (mod (select .cse19 |c_~#value~0.offset|) 4294967296))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= .cse9 (mod (select (select .cse20 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (let ((.cse24 (select (select (store .cse20 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse23 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse21 (select .cse23 |c_~#value~0.base|)) (.cse22 (mod .cse24 4294967296))) (or (not (= (mod (select .cse21 |c_~#value~0.offset|) 4294967296) .cse22)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (not (= (mod (select (select (store (store .cse23 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| (+ .cse24 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse22)))))))))))) is different from false [2023-11-17 13:03:17,035 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_522 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_520) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (let ((.cse4 (select (select (store .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527))) (let ((.cse1 (select .cse3 |c_~#value~0.base|)) (.cse2 (mod .cse4 4294967296))) (or (not (= (mod (select .cse1 |c_~#value~0.offset|) 4294967296) .cse2)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (not (= (mod (select (select (store (store .cse3 |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_522 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_520) |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse11 (select .cse10 |c_~#value~0.base|))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse9 (store .cse11 |c_~#value~0.offset| (+ .cse12 1)))) (let ((.cse7 (store .cse10 |c_~#value~0.base| .cse9))) (let ((.cse8 (store (select .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse9) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse8) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527)) (.cse5 (mod (select (select (store .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_DerPreprocessor_20 (Array Int Int))) (not (= .cse5 (mod (select (select (store .cse6 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5))))))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)))) (not (= (mod .cse12 4294967296) (mod (select .cse11 |c_~#value~0.offset|) 4294967296))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_522 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (or (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_520) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_79)) (.cse15 (mod (select (select (store .cse13 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15) (not (= (mod (select (select (store .cse14 v_prenex_80 v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) v_prenex_80) 0)))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_522 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_522))) (let ((.cse17 (select .cse24 |c_~#value~0.base|)) (.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_520) |c_~#value~0.base|) |c_~#value~0.offset|))) (or (not (= (mod .cse16 4294967296) (mod (select .cse17 |c_~#value~0.offset|) 4294967296))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse22 (store .cse17 |c_~#value~0.offset| (+ .cse16 1)))) (let ((.cse23 (store .cse24 |c_~#value~0.base| .cse22))) (let ((.cse18 (store (select .cse23 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse20 (select (select (store .cse23 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse18) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse22) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base|)) (.cse21 (mod .cse20 4294967296))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_527) |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| (+ 1 .cse20))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse21))) (not (= (mod (select .cse19 |c_~#value~0.offset|) 4294967296) .cse21))))))))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_21| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0))))))))) is different from false [2023-11-17 13:03:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-17 13:03:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577705770] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:03:28,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:03:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 48 [2023-11-17 13:03:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831553638] [2023-11-17 13:03:28,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:03:28,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-17 13:03:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:03:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-17 13:03:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1600, Unknown=29, NotChecked=522, Total=2352 [2023-11-17 13:03:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:03:28,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:03:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 48 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:03:28,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:03:28,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 13:03:28,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:03:28,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:03:28,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-17 13:03:28,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:03:59,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 13:04:04,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 13:04:06,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 13:04:08,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 13:04:10,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 13:04:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:04:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:04:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:04:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:04:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 13:04:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 13:04:18,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-17 13:04:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 13:04:18,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:04:18,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:04:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash -965439207, now seen corresponding path program 3 times [2023-11-17 13:04:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:04:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373913620] [2023-11-17 13:04:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:04:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:04:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:04:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:04:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:04:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373913620] [2023-11-17 13:04:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373913620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:04:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370051326] [2023-11-17 13:04:21,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 13:04:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:04:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:04:21,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:04:21,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 13:04:21,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 13:04:21,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:04:21,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-17 13:04:21,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:04:21,627 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:04:21,628 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-17 13:04:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:04:22,071 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:04:22,072 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-17 13:04:22,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:04:23,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:04:23,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:04:23,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-11-17 13:04:23,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 20 [2023-11-17 13:04:26,082 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-17 13:04:26,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-17 13:04:26,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-17 13:04:26,871 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-17 13:04:26,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-17 13:04:27,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:04:27,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 73 [2023-11-17 13:04:27,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-11-17 13:04:27,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 30 [2023-11-17 13:04:27,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-17 13:04:27,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 13:04:27,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2023-11-17 13:04:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:04:29,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:04:32,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse1 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) .cse4) (or (not .cse4) (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse5 (store .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse5 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= .cse2 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-17 13:04:32,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (or (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse1 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) .cse4) (or (not .cse4) (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse6 (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= .cse2 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) (= 4294967295 .cse0))) is different from false [2023-11-17 13:04:34,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (let ((.cse3 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse2 (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse1 (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3))))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (let ((.cse5 (select .cse8 |c_~#value~0.base|))) (or (not (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0)) (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse7 (store (store .cse8 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ 1 .cse9))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse6 (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse3 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))))))) is different from false [2023-11-17 13:04:34,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) (let ((.cse3 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse2 (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse1 (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3))))) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (let ((.cse5 (select .cse8 |c_~#value~0.base|))) (or (not (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0)) (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse7 (store (store .cse8 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ 1 .cse9))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse6 (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse3 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))))))) is different from false [2023-11-17 13:04:34,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse6 4294967296))) (or (= .cse0 4294967295) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (let ((.cse5 (select .cse4 |c_~#value~0.base|))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse3 (store (store .cse4 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ 1 .cse6))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse1 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0)))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (store .cse9 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse7 (store .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (< .cse0 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2))))) (= (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0))))))))) is different from false [2023-11-17 13:04:34,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse6 4294967296))) (or (= .cse0 4294967295) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (let ((.cse5 (select .cse4 |c_~#value~0.base|))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse3 (store (store .cse4 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ 1 .cse6))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse1 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0)))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (store .cse9 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse7 (store .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (< .cse0 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2))))) (= (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0))))))))) is different from false [2023-11-17 13:04:35,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse5 4294967296))) (or (= .cse0 4294967295) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse5))) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse1 (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (= .cse0 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse0)))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_610))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse7 (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25))) (let ((.cse6 (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)))) (or (= (mod (select (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 4294967296) 0) (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (< .cse0 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) is different from false [2023-11-17 13:04:35,516 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2023-11-17 13:04:35,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 93 [2023-11-17 13:04:36,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:04:36,043 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 27524 treesize of output 25176 [2023-11-17 13:04:36,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1702 treesize of output 1688 [2023-11-17 13:04:36,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:04:36,312 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 1704 treesize of output 1687 [2023-11-17 13:04:36,375 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 1652 treesize of output 1650 [2023-11-17 13:04:36,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:04:36,505 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 1706 treesize of output 1647 [2023-11-17 13:04:36,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-17 13:04:43,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-17 13:04:43,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:04:43,963 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 91 treesize of output 87 [2023-11-17 13:04:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-17 13:04:45,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:04:45,860 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 17 treesize of output 21 [2023-11-17 13:04:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-17 13:04:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-17 13:04:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370051326] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:04:52,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:04:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 20] total 52 [2023-11-17 13:04:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366277136] [2023-11-17 13:04:52,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:04:52,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-17 13:04:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:04:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-17 13:04:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1988, Unknown=23, NotChecked=672, Total=2862 [2023-11-17 13:04:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:04:52,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:04:52,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 53 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-17 13:04:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2023-11-17 13:04:52,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:05:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 13:05:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-17 13:05:44,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 13:05:45,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 13:05:45,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:05:45,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:05:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 136156884, now seen corresponding path program 4 times [2023-11-17 13:05:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:05:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663414529] [2023-11-17 13:05:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:05:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:05:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:05:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:05:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:05:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663414529] [2023-11-17 13:05:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663414529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:05:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403769814] [2023-11-17 13:05:50,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 13:05:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:05:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:05:50,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:05:50,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 13:05:50,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 13:05:50,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:05:50,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-17 13:05:50,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:05:50,976 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 13:05:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 13:05:51,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:05:51,564 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-17 13:05:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-17 13:05:51,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:05:53,028 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 13:05:53,029 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-17 13:05:53,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:05:53,567 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 35 treesize of output 18 [2023-11-17 13:05:56,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-17 13:05:57,655 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-17 13:05:57,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2023-11-17 13:05:58,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:05:58,418 INFO L349 Elim1Store]: treesize reduction 102, result has 25.5 percent of original size [2023-11-17 13:05:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 120 [2023-11-17 13:05:58,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:05:58,938 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-17 13:05:58,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 48 [2023-11-17 13:05:59,369 INFO L349 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2023-11-17 13:05:59,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 140 [2023-11-17 13:06:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 25 treesize of output 38 [2023-11-17 13:06:00,359 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2023-11-17 13:06:00,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2023-11-17 13:06:03,262 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-17 13:06:03,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2023-11-17 13:06:03,358 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 13:06:03,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-17 13:06:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:06:03,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:06:07,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse8 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse0))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (let ((.cse1 (store (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse1))) (let ((.cse2 (select (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< .cse0 (mod (select (select (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse3 4294967296) 4294967295) (= .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (not .cse8)) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse10 (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (or (< .cse0 (mod (select (select (store (store .cse9 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse11 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse4 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse11 4294967296) 4294967295)))))) .cse8)))) is different from false [2023-11-17 13:06:07,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (or (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse4 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse2 (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< .cse0 (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse4 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse3 4294967296) 4294967295)))))) .cse5) (or (not .cse5) (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))))) (let ((.cse8 (store (select .cse10 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse7 (store .cse10 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse9 (select (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (= (mod .cse6 4294967296) 4294967295) (= .cse4 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 (mod (select (select (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))))) (= 4294967295 .cse0))) is different from false [2023-11-17 13:06:12,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse1 (select .cse4 |c_~#value~0.base|))) (or (not (= .cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse8 (store .cse4 |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ 1 .cse9))))) (let ((.cse5 (store (select .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5))) (let ((.cse6 (select (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 (mod (select (select (store (store (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse7 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse7 4294967296) 4294967295)))))))))))) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse11 (store .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse12 (select (store .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse10 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse10 4294967296) 4294967295) (< .cse0 (mod (select (select (store (store .cse11 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ .cse10 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2)))))) (= .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-17 13:06:12,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse1 (select .cse4 |c_~#value~0.base|))) (or (not (= .cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse8 (store .cse4 |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ 1 .cse9))))) (let ((.cse5 (store (select .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5))) (let ((.cse6 (select (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 (mod (select (select (store (store (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse7 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse7 4294967296) 4294967295)))))))))))) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse11 (store .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse12 (select (store .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse10 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse10 4294967296) 4294967295) (< .cse0 (mod (select (select (store (store .cse11 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ .cse10 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2)))))) (= .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-17 13:06:13,544 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse8 (select .cse4 |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse7 (store .cse4 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ 1 .cse9))))) (let ((.cse5 (store (select .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse1 (store .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5))) (let ((.cse6 (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse3 (select .cse6 |c_~#value~0.offset|))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (= 4294967295 (mod .cse3 4294967296)) (< .cse0 (mod (select (select (store (store (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse3 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (not (= .cse0 (mod (select .cse8 |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse11 (store .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse12 (select (store .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse10 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse10 4294967296) 4294967295) (< .cse0 (mod (select (select (store (store .cse11 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ .cse10 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2)))))) (= .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-17 13:06:13,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse9 4294967296))) (or (= .cse0 4294967295) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse8 (select .cse4 |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse7 (store .cse4 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ 1 .cse9))))) (let ((.cse5 (store (select .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse1 (store .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5))) (let ((.cse6 (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse3 (select .cse6 |c_~#value~0.offset|))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (= 4294967295 (mod .cse3 4294967296)) (< .cse0 (mod (select (select (store (store (store .cse4 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse3 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) (not (= .cse0 (mod (select .cse8 |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse11 (store .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse12 (select (store .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse10 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse10 4294967296) 4294967295) (< .cse0 (mod (select (select (store (store .cse11 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ .cse10 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2)))))) (= .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-17 13:06:14,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse8 4294967296))) (or (= .cse0 4294967295) (and (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse7 (select .cse2 |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse6 (store .cse2 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ 1 .cse8))))) (let ((.cse3 (store (select .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse5 (store .cse6 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse3))) (let ((.cse4 (select (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse1 4294967296)) (< .cse0 (mod (select (select (store (store (store .cse2 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ .cse1 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))))))) (not (= .cse0 (mod (select .cse7 |c_~#value~0.offset|) 4294967296))))))) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse10 (store .cse12 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse11 (select (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse9 (select .cse11 |c_~#value~0.offset|))) (or (= (mod .cse9 4294967296) 4294967295) (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (< .cse0 (mod (select (select (store (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse9 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (= .cse0 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) is different from false [2023-11-17 13:06:25,317 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (and (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (or (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (mod (select (select (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse0) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse1 (store .cse2 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse4 (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse3 (select .cse4 |c_~#value~0.offset|))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (= 4294967295 (mod .cse3 4294967296)) (< .cse0 (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ .cse3 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (= (mod (select v_DerPreprocessor_33 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6)))) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse17 (store .cse20 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|))) (let ((.cse18 (store .cse19 |c_~#value~0.base| .cse17))) (let ((.cse16 (store (select .cse18 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse15 (select (select (store .cse18 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse7 (mod .cse15 4294967296))) (or (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse17) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708) |c_~#value~0.base|))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse13 (store .cse8 |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| (+ .cse15 1))))) (let ((.cse9 (store (select .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse12 (store .cse13 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse10 (select (store .cse12 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse12 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (or (< .cse7 (mod (select (select (store (store (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse11 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse7 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod .cse11 4294967296) 4294967295))))))))) (not (= (mod (select .cse14 |c_~#value~0.offset|) 4294967296) .cse7))))) (= .cse7 4294967295)))))))) (not (= (mod (select .cse20 |c_~#value~0.offset|) 4294967296) .cse6)))))) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (let ((.cse30 (select .cse29 |c_~#value~0.base|))) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse27 (store .cse30 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|))) (let ((.cse28 (store .cse29 |c_~#value~0.base| .cse27))) (let ((.cse22 (store (select .cse28 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse21 (mod (select (select (store .cse28 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse22) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse27) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse25 (store .cse26 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse23 (select (store .cse25 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse25 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse24 (select .cse23 |c_~#value~0.offset|))) (or (< .cse21 (mod (select (select (store (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse24 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 4294967295 (mod .cse24 4294967296)) (= .cse21 (mod (select (select .cse25 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (= (mod (select (select .cse26 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse21)))) (= .cse21 4294967295))))))) (not (= (mod (select .cse30 |c_~#value~0.offset|) 4294967296) .cse6)))))) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (or (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse39 (select (select (store .cse40 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse31 (mod .cse39 4294967296))) (or (= 4294967295 .cse31) (forall ((v_prenex_113 Int) (v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_112))) (let ((.cse37 (select .cse32 |c_~#value~0.base|))) (let ((.cse38 (store .cse32 |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| (+ .cse39 1))))) (let ((.cse33 (store (select .cse38 v_prenex_113) 0 1))) (let ((.cse36 (store .cse38 v_prenex_113 .cse33))) (let ((.cse34 (select (store .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0)) |c_~#value~0.base|))) (let ((.cse35 (select .cse34 |c_~#value~0.offset|))) (or (< .cse31 (mod (select (select (store (store (store .cse32 v_prenex_113 .cse33) |c_~#value~0.base| (store .cse34 |c_~#value~0.offset| (+ .cse35 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_prenex_111) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse36 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse31) (= 4294967295 (mod .cse35 4294967296)) (not (= (mod (select .cse37 |c_~#value~0.offset|) 4294967296) .cse31))))))))))) (= (mod (select v_DerPreprocessor_33 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) (= (mod (select (select .cse40 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6)))))) is different from false [2023-11-17 13:07:17,308 WARN L876 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| Int) (v_ArrVal_700 Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_700) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0)) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (or (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (mod (select (select (store .cse0 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= (mod (select v_DerPreprocessor_33 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse4 (store .cse2 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse5 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0 0)) |c_~#value~0.base|))) (let ((.cse1 (select .cse5 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse1 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (= (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< .cse3 (mod (select (select (store (store .cse4 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse1 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (= 4294967295 .cse3))))))))) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0)))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| Int) (v_ArrVal_700 Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_700) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0)) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (let ((.cse7 (select .cse20 |c_~#value~0.base|)) (.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) |c_~#value~0.base|) |c_~#value~0.offset|))) (or (not (= (mod .cse6 4294967296) (mod (select .cse7 |c_~#value~0.offset|) 4294967296))) (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse18 (store .cse7 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse19 (store .cse20 |c_~#value~0.base| .cse18))) (let ((.cse17 (store (select .cse19 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse16 (select (select (store .cse19 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse17) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse9 (mod .cse16 4294967296))) (or (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse18) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708) |c_~#value~0.base|))) (or (not (= (mod (select .cse8 |c_~#value~0.offset|) 4294967296) .cse9)) (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse12 (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (let ((.cse15 (store .cse12 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse16 1))))) (let ((.cse13 (store (select .cse15 |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse10 (store .cse15 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13))) (let ((.cse14 (select (store .cse10 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| (store (select .cse10 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0 0)) |c_~#value~0.base|))) (let ((.cse11 (select .cse14 |c_~#value~0.offset|))) (or (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse9) (= 4294967295 (mod .cse11 4294967296)) (< .cse9 (mod (select (select (store (store (store .cse12 |thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13) |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| (+ .cse11 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))))) (= 4294967295 .cse9)))))))))))))))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| Int) (v_ArrVal_700 Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_700) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0)) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (let ((.cse22 (select .cse31 |c_~#value~0.base|)) (.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) |c_~#value~0.base|) |c_~#value~0.offset|))) (or (not (= (mod .cse21 4294967296) (mod (select .cse22 |c_~#value~0.offset|) 4294967296))) (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse29 (store .cse22 |c_~#value~0.offset| (+ .cse21 1)))) (let ((.cse30 (store .cse31 |c_~#value~0.base| .cse29))) (let ((.cse25 (store (select .cse30 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse23 (mod (select (select (store .cse30 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse25) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= 4294967295 .cse23) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_~#value~0.base| .cse29) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708))) (or (= (mod (select (select .cse24 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse23) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (let ((.cse28 (store .cse24 |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (let ((.cse26 (select (store .cse28 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| (store (select .cse28 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0 0)) |c_~#value~0.base|))) (let ((.cse27 (select .cse26 |c_~#value~0.offset|))) (or (< .cse23 (mod (select (select (store (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| .cse25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_708) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| (+ .cse27 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse28 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse23) (= 4294967295 (mod .cse27 4294967296)))))))))))))))))))))) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0)))) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| Int) (v_ArrVal_700 Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_700) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0)) (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (or (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select .cse32 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse41 (select (select (store .cse32 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse33 (mod .cse41 4294967296))) (or (forall ((v_prenex_113 Int) (v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_112))) (let ((.cse34 (select .cse36 |c_~#value~0.base|))) (let ((.cse40 (store .cse36 |c_~#value~0.base| (store .cse34 |c_~#value~0.offset| (+ .cse41 1))))) (let ((.cse37 (store (select .cse40 v_prenex_113) 0 1))) (let ((.cse39 (store .cse40 v_prenex_113 .cse37))) (let ((.cse38 (select (store .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| (store (select .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25|) 0 0)) |c_~#value~0.base|))) (let ((.cse35 (select .cse38 |c_~#value~0.offset|))) (or (not (= .cse33 (mod (select .cse34 |c_~#value~0.offset|) 4294967296))) (= 4294967295 (mod .cse35 4294967296)) (< .cse33 (mod (select (select (store (store (store .cse36 v_prenex_113 .cse37) |c_~#value~0.base| (store .cse38 |c_~#value~0.offset| (+ .cse35 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_25| v_prenex_111) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse39 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse33)))))))))) (= (mod (select v_DerPreprocessor_33 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= 4294967295 .cse33)))))))))) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0))))) is different from true [2023-11-17 13:07:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 16 not checked. [2023-11-17 13:07:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403769814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:07:19,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:07:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 64 [2023-11-17 13:07:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497511113] [2023-11-17 13:07:19,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:07:19,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-17 13:07:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:07:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-17 13:07:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2916, Unknown=45, NotChecked=1062, Total=4290 [2023-11-17 13:07:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:07:19,544 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:07:19,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 65 states have internal predecessors, (105), 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-17 13:07:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:07:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-17 13:07:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-17 13:07:19,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 13:07:19,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-17 13:07:19,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2023-11-17 13:07:19,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2023-11-17 13:07:19,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:07:24,547 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 139 [2023-11-17 13:07:24,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 13:07:24,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 13:07:24,749 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 53 more [2023-11-17 13:07:24,754 INFO L158 Benchmark]: Toolchain (without parser) took 453820.12ms. Allocated memory was 277.9MB in the beginning and 496.0MB in the end (delta: 218.1MB). Free memory was 230.2MB in the beginning and 186.6MB in the end (delta: 43.5MB). Peak memory consumption was 262.6MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,754 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 188.7MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 13:07:24,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.98ms. Allocated memory is still 277.9MB. Free memory was 230.2MB in the beginning and 210.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.09ms. Allocated memory is still 277.9MB. Free memory was 210.2MB in the beginning and 208.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,755 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 277.9MB. Free memory was 208.1MB in the beginning and 206.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,755 INFO L158 Benchmark]: RCFGBuilder took 457.11ms. Allocated memory is still 277.9MB. Free memory was 206.9MB in the beginning and 183.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,757 INFO L158 Benchmark]: TraceAbstraction took 452867.02ms. Allocated memory was 277.9MB in the beginning and 496.0MB in the end (delta: 218.1MB). Free memory was 183.0MB in the beginning and 186.6MB in the end (delta: -3.7MB). Peak memory consumption was 215.4MB. Max. memory is 8.0GB. [2023-11-17 13:07:24,758 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.18ms. Allocated memory is still 188.7MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.98ms. Allocated memory is still 277.9MB. Free memory was 230.2MB in the beginning and 210.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.09ms. Allocated memory is still 277.9MB. Free memory was 210.2MB in the beginning and 208.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 277.9MB. Free memory was 208.1MB in the beginning and 206.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 457.11ms. Allocated memory is still 277.9MB. Free memory was 206.9MB in the beginning and 183.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 452867.02ms. Allocated memory was 277.9MB in the beginning and 496.0MB in the end (delta: 218.1MB). Free memory was 183.0MB in the beginning and 186.6MB in the end (delta: -3.7MB). Peak memory consumption was 215.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 273, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 67, dependent conditional: 48, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 231, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 121, independent conditional: 3, independent unconditional: 118, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 35, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 83, independent conditional: 11, independent unconditional: 72, dependent: 122, dependent conditional: 13, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 237, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 143, unknown conditional: 5, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 121, Positive conditional cache size: 3, Positive unconditional cache size: 118, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 42 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 32, Number of trivial persistent sets: 28, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 273, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 67, dependent conditional: 48, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 231, independent: 206, independent conditional: 90, independent unconditional: 116, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 121, independent conditional: 3, independent unconditional: 118, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 35, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 83, independent conditional: 11, independent unconditional: 72, dependent: 122, dependent conditional: 13, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 237, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 143, unknown conditional: 5, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 121, Positive conditional cache size: 3, Positive unconditional cache size: 118, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 42 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 85, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 15, dependent conditional: 8, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 80, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 6 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 9, Number of trivial persistent sets: 8, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 85, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 15, dependent conditional: 8, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 80, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1, Independence queries for same thread: 6 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 61, dependent conditional: 29, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 353, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 353, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 271, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 271, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 361, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 271, unknown conditional: 0, unknown unconditional: 271] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 22, Number of trivial persistent sets: 19, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 61, dependent conditional: 29, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 353, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 353, independent: 309, independent conditional: 62, independent unconditional: 247, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 271, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 271, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 361, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 271, unknown conditional: 0, unknown unconditional: 271] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1, Independence queries for same thread: 17 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-17 13:07:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2023-11-17 13:07:24,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2023-11-17 13:07:25,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2023-11-17 13:07:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...