/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 13:08:08,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 13:08:08,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 13:08:08,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 13:08:08,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 13:08:08,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 13:08:08,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 13:08:08,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 13:08:08,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 13:08:08,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 13:08:08,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 13:08:08,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 13:08:08,332 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 13:08:08,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 13:08:08,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 13:08:08,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 13:08:08,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 13:08:08,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 13:08:08,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 13:08:08,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 13:08:08,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 13:08:08,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 13:08:08,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 13:08:08,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 13:08:08,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 13:08:08,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 13:08:08,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 13:08:08,342 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 13:08:08,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 13:08:08,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 13:08:08,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 13:08:08,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 13:08:08,345 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 13:08:08,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-05 13:08:08,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 13:08:08,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 13:08:08,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 13:08:08,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 13:08:08,543 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 13:08:08,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 13:08:09,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 13:08:09,884 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 13:08:09,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 13:08:09,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00a29b11d/c869911554db4badbeb2ff1eb02eae8f/FLAG5f44dc649 [2024-04-05 13:08:09,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00a29b11d/c869911554db4badbeb2ff1eb02eae8f [2024-04-05 13:08:09,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 13:08:09,912 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 13:08:09,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 13:08:09,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 13:08:09,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 13:08:09,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:08:09" (1/1) ... [2024-04-05 13:08:09,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7378a28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:09, skipping insertion in model container [2024-04-05 13:08:09,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:08:09" (1/1) ... [2024-04-05 13:08:09,956 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 13:08:10,157 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] [2024-04-05 13:08:10,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 13:08:10,174 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 13:08:10,221 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] [2024-04-05 13:08:10,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 13:08:10,268 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 13:08:10,268 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 13:08:10,274 INFO L206 MainTranslator]: Completed translation [2024-04-05 13:08:10,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10 WrapperNode [2024-04-05 13:08:10,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 13:08:10,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 13:08:10,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 13:08:10,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 13:08:10,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,314 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-04-05 13:08:10,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 13:08:10,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 13:08:10,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 13:08:10,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 13:08:10,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 13:08:10,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 13:08:10,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 13:08:10,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 13:08:10,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (1/1) ... [2024-04-05 13:08:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 13:08:10,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:10,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 13:08:10,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-05 13:08:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 13:08:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 13:08:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 13:08:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 13:08:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 13:08:10,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 13:08:10,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 13:08:10,434 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 13:08:10,560 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 13:08:10,562 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 13:08:10,705 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 13:08:10,757 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 13:08:10,757 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 13:08:10,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:08:10 BoogieIcfgContainer [2024-04-05 13:08:10,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 13:08:10,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 13:08:10,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 13:08:10,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 13:08:10,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 01:08:09" (1/3) ... [2024-04-05 13:08:10,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1776fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:08:10, skipping insertion in model container [2024-04-05 13:08:10,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:08:10" (2/3) ... [2024-04-05 13:08:10,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1776fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:08:10, skipping insertion in model container [2024-04-05 13:08:10,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:08:10" (3/3) ... [2024-04-05 13:08:10,764 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-04-05 13:08:10,770 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 13:08:10,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 13:08:10,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 13:08:10,778 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 13:08:10,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 13:08:10,844 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 13:08:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 13:08:10,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:10,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 13:08:10,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 13:08:10,875 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 13:08:10,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:10,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 13:08:10,892 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;@4046a95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 13:08:10,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 13:08:10,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 13:08:10,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 790974196, now seen corresponding path program 1 times [2024-04-05 13:08:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805513044] [2024-04-05 13:08:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805513044] [2024-04-05 13:08:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805513044] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 13:08:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311819682] [2024-04-05 13:08:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 13:08:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 13:08:11,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 13:08:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:11,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:11,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 13:08:11,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 13:08:11,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 623441482, now seen corresponding path program 1 times [2024-04-05 13:08:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813031071] [2024-04-05 13:08:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:11,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813031071] [2024-04-05 13:08:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813031071] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 13:08:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105647745] [2024-04-05 13:08:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:11,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 13:08:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 13:08:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-04-05 13:08:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:11,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:11,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 13:08:11,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 13:08:11,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1929615467, now seen corresponding path program 1 times [2024-04-05 13:08:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369433320] [2024-04-05 13:08:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369433320] [2024-04-05 13:08:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369433320] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 13:08:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766804587] [2024-04-05 13:08:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:12,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 13:08:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:12,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 13:08:12,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 13:08:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:12,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:12,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:12,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-05 13:08:12,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 13:08:12,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 13:08:12,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 540436402, now seen corresponding path program 1 times [2024-04-05 13:08:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098559996] [2024-04-05 13:08:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:12,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 13:08:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:12,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 13:08:12,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 13:08:12,545 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-04-05 13:08:12,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-04-05 13:08:12,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-04-05 13:08:12,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 13:08:12,556 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 13:08:12,558 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 13:08:12,558 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 13:08:12,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 13:08:12,592 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 13:08:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 13:08:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:12,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 13:08:12,606 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 13:08:12,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:12,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 13:08:12,607 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;@4046a95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 13:08:12,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 13:08:12,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 13:08:12,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:12,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1856933464, now seen corresponding path program 1 times [2024-04-05 13:08:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935352220] [2024-04-05 13:08:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935352220] [2024-04-05 13:08:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935352220] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:12,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 13:08:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380554782] [2024-04-05 13:08:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:12,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 13:08:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 13:08:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 13:08:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:12,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:12,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 13:08:12,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:12,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442431, now seen corresponding path program 1 times [2024-04-05 13:08:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509803165] [2024-04-05 13:08:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:08:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509803165] [2024-04-05 13:08:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509803165] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 13:08:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397529532] [2024-04-05 13:08:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 13:08:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 13:08:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 13:08:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:12,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:12,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 13:08:12,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:12,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 715489871, now seen corresponding path program 1 times [2024-04-05 13:08:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336399304] [2024-04-05 13:08:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336399304] [2024-04-05 13:08:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336399304] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 13:08:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017339887] [2024-04-05 13:08:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 13:08:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 13:08:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 13:08:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:13,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:13,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:13,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:13,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:13,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 13:08:13,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:13,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -232196713, now seen corresponding path program 1 times [2024-04-05 13:08:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061556831] [2024-04-05 13:08:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:13,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061556831] [2024-04-05 13:08:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061556831] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895476265] [2024-04-05 13:08:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:13,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 13:08:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:14,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2024-04-05 13:08:14,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:14,165 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:08:14,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:08:14,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:14,284 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:08:14,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:08:14,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 13:08:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:14,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:14,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:14,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_120) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 13:08:15,171 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 180 treesize of output 168 [2024-04-05 13:08:15,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-05 13:08:15,186 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 [2024-04-05 13:08:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-05 13:08:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895476265] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:15,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2024-04-05 13:08:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187506705] [2024-04-05 13:08:15,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:15,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 13:08:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 13:08:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=848, Unknown=8, NotChecked=60, Total=1056 [2024-04-05 13:08:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:15,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:15,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:08:15,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 13:08:15,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:15,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:15,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1951612766, now seen corresponding path program 1 times [2024-04-05 13:08:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:15,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167076017] [2024-04-05 13:08:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167076017] [2024-04-05 13:08:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167076017] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091801223] [2024-04-05 13:08:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:16,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:16,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 13:08:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:16,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 13:08:16,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:16,690 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:08:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:08:16,731 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:08:16,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:08:16,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-04-05 13:08:16,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:08:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:08:16,933 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 [2024-04-05 13:08:16,939 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 [2024-04-05 13:08:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:08:17,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:17,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:08:17,267 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:08:17,271 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 53 treesize of output 37 [2024-04-05 13:08:17,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-05 13:08:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:08:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091801223] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:17,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 13:08:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129430968] [2024-04-05 13:08:17,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:17,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 13:08:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 13:08:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=737, Unknown=5, NotChecked=0, Total=870 [2024-04-05 13:08:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:17,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:17,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:17,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:17,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:17,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:17,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:08:17,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:21,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-05 13:08:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:08:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:08:21,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 13:08:22,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:22,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 13:08:22,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1062705217, now seen corresponding path program 1 times [2024-04-05 13:08:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728122880] [2024-04-05 13:08:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:22,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 13:08:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:22,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 13:08:22,212 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 13:08:22,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-05 13:08:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-05 13:08:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-05 13:08:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-05 13:08:22,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 13:08:22,215 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-05 13:08:22,215 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 13:08:22,215 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 13:08:22,242 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 13:08:22,244 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 13:08:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 13:08:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:22,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 13:08:22,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 13:08:22,251 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 13:08:22,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:22,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 13:08:22,252 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;@4046a95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 13:08:22,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 13:08:22,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:22,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash -42688683, now seen corresponding path program 1 times [2024-04-05 13:08:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:22,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440733007] [2024-04-05 13:08:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440733007] [2024-04-05 13:08:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440733007] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 13:08:22,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866786334] [2024-04-05 13:08:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 13:08:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 13:08:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 13:08:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:22,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:22,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 13:08:22,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:22,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash 417728457, now seen corresponding path program 1 times [2024-04-05 13:08:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843795503] [2024-04-05 13:08:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:08:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843795503] [2024-04-05 13:08:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843795503] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 13:08:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601717859] [2024-04-05 13:08:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:22,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 13:08:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 13:08:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 13:08:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:22,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 13:08:22,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:22,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1782599532, now seen corresponding path program 1 times [2024-04-05 13:08:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113137240] [2024-04-05 13:08:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113137240] [2024-04-05 13:08:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113137240] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 13:08:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136180743] [2024-04-05 13:08:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:22,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 13:08:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 13:08:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 13:08:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:22,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:23,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 13:08:23,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:23,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -267004783, now seen corresponding path program 1 times [2024-04-05 13:08:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178820767] [2024-04-05 13:08:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:08:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178820767] [2024-04-05 13:08:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178820767] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084210495] [2024-04-05 13:08:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:23,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:23,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:23,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-05 13:08:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:23,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 13:08:23,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:23,704 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:08:23,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:08:23,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:23,802 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:08:23,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:08:23,922 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 [2024-04-05 13:08:24,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:08:24,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:08:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 13:08:24,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:24,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_293) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 13:08:25,203 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 13:08:25,204 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 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 13:08:25,209 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 13:08:25,210 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 42 treesize of output 30 [2024-04-05 13:08:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2024-04-05 13:08:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084210495] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:25,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2024-04-05 13:08:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670434766] [2024-04-05 13:08:25,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:25,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 13:08:25,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:25,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 13:08:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=833, Unknown=10, NotChecked=60, Total=1056 [2024-04-05 13:08:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:25,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:25,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.363636363636363) internal successors, (177), 33 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:25,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:25,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:25,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:25,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:08:25,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-05 13:08:26,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-04-05 13:08:26,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:26,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -737606014, now seen corresponding path program 1 times [2024-04-05 13:08:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272173246] [2024-04-05 13:08:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:26,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272173246] [2024-04-05 13:08:26,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272173246] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:26,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219906112] [2024-04-05 13:08:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:26,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:26,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-05 13:08:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:26,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2024-04-05 13:08:26,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:26,709 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:08:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:08:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:26,822 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:08:26,822 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 [2024-04-05 13:08:26,998 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 [2024-04-05 13:08:27,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:08:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:08:27,411 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:08:27,411 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 [2024-04-05 13:08:27,560 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 13:08:27,584 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:08:27,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:08:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:27,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:44,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:08:44,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:08:44,099 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 466 treesize of output 442 [2024-04-05 13:08:44,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2024-04-05 13:08:44,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2024-04-05 13:08:44,129 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 116 [2024-04-05 13:08:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219906112] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:47,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-05 13:08:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553315742] [2024-04-05 13:08:47,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:47,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-05 13:08:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-05 13:08:47,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1642, Unknown=47, NotChecked=0, Total=1980 [2024-04-05 13:08:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:47,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.3636363636363638) internal successors, (148), 45 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:08:47,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:08:48,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-04-05 13:08:48,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-04-05 13:08:48,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:48,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash -928964791, now seen corresponding path program 1 times [2024-04-05 13:08:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239259200] [2024-04-05 13:08:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239259200] [2024-04-05 13:08:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239259200] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491586588] [2024-04-05 13:08:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:49,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:49,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-05 13:08:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:49,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-04-05 13:08:49,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:49,891 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:08:49,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:08:49,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:08:50,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:08:50,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:08:50,138 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 [2024-04-05 13:08:50,337 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:08:50,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:08:50,549 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:08:50,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:08:50,760 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:08:50,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 13:08:50,845 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 23 treesize of output 11 [2024-04-05 13:08:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:50,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:50,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 13:08:53,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse3 4294967296) 4294967295))))))) is different from false [2024-04-05 13:08:53,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:08:53,982 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 14785 treesize of output 13947 [2024-04-05 13:08:54,015 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 458 treesize of output 454 [2024-04-05 13:08:54,027 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 [2024-04-05 13:08:54,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:08:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 4 times theorem prover too weak. 0 trivial. 12 not checked. [2024-04-05 13:08:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491586588] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:54,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:54,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2024-04-05 13:08:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569881954] [2024-04-05 13:08:54,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:54,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 13:08:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:54,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 13:08:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2061, Unknown=86, NotChecked=194, Total=2652 [2024-04-05 13:08:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:54,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:54,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.019230769230769) internal successors, (209), 52 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:08:54,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:08:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 13:08:56,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-04-05 13:08:56,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:56,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:56,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1454667501, now seen corresponding path program 1 times [2024-04-05 13:08:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36145019] [2024-04-05 13:08:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 13:08:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36145019] [2024-04-05 13:08:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36145019] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:08:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710026683] [2024-04-05 13:08:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:08:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:57,119 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:08:57,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-04-05 13:08:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:57,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 13:08:57,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:08:57,240 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:08:57,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:08:57,335 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:08:57,336 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 [2024-04-05 13:08:57,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:08:57,572 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:08:57,572 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 [2024-04-05 13:08:57,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:08:57,842 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:08:57,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:08:57,966 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 [2024-04-05 13:08:57,972 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 [2024-04-05 13:08:57,992 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 [2024-04-05 13:08:57,996 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 [2024-04-05 13:08:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:08:58,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:08:58,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:08:58,293 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:08:58,295 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 53 treesize of output 37 [2024-04-05 13:08:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-04-05 13:08:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:08:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710026683] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:08:58,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:08:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2024-04-05 13:08:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297123604] [2024-04-05 13:08:58,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:08:58,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 13:08:58,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:58,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 13:08:58,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=835, Unknown=3, NotChecked=0, Total=992 [2024-04-05 13:08:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:58,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:58,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 6.225806451612903) internal successors, (193), 32 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-05 13:08:58,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:08:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:08:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:08:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:08:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:08:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:08:59,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-04-05 13:08:59,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-04-05 13:08:59,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 13:08:59,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1094034385, now seen corresponding path program 1 times [2024-04-05 13:08:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:59,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620307364] [2024-04-05 13:08:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:59,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:59,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 13:08:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:08:59,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 13:08:59,517 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 13:08:59,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 13:08:59,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 13:08:59,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 13:08:59,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 13:08:59,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 13:08:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-05 13:08:59,518 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 13:08:59,518 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 13:08:59,518 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 13:08:59,536 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 13:08:59,538 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 13:08:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 13:08:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:08:59,539 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 13:08:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-04-05 13:08:59,545 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 13:08:59,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:59,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 13:08:59,546 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;@4046a95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 13:08:59,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-05 13:08:59,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:08:59,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1788341269, now seen corresponding path program 1 times [2024-04-05 13:08:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427680526] [2024-04-05 13:08:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:59,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427680526] [2024-04-05 13:08:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427680526] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 13:08:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589586184] [2024-04-05 13:08:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:59,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 13:08:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:59,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 13:08:59,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 13:08:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:59,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-05 13:08:59,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:08:59,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash -423966927, now seen corresponding path program 1 times [2024-04-05 13:08:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251698065] [2024-04-05 13:08:59,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 13:08:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251698065] [2024-04-05 13:08:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251698065] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 13:08:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656145622] [2024-04-05 13:08:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:59,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 13:08:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 13:08:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 13:08:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,679 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:59,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:59,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:59,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-05 13:08:59,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:08:59,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:08:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1513268162, now seen corresponding path program 1 times [2024-04-05 13:08:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:08:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076948047] [2024-04-05 13:08:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:08:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:08:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:08:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:08:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:08:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076948047] [2024-04-05 13:08:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076948047] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:08:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:08:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 13:08:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459830981] [2024-04-05 13:08:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:08:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 13:08:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:08:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 13:08:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 13:08:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:08:59,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:08:59,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:08:59,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:08:59,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:00,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-05 13:09:00,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:09:00,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:09:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847127, now seen corresponding path program 1 times [2024-04-05 13:09:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:09:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632126608] [2024-04-05 13:09:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:09:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:09:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:09:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632126608] [2024-04-05 13:09:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632126608] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:09:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106264059] [2024-04-05 13:09:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:00,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:09:00,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:09:00,548 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:09:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-04-05 13:09:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:00,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 13:09:00,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:09:00,748 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:09:00,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:09:00,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:09:00,943 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 13:09:00,943 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 [2024-04-05 13:09:01,064 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:09:01,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:09:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:09:01,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:09:06,540 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 13:09:06,541 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 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 13:09:06,546 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 13:09:06,546 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 42 treesize of output 30 [2024-04-05 13:09:06,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-05 13:09:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 3 refuted. 4 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:09:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106264059] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:09:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:09:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 13:09:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005970217] [2024-04-05 13:09:06,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:09:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 13:09:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:09:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 13:09:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=836, Unknown=15, NotChecked=0, Total=992 [2024-04-05 13:09:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:06,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:09:06,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:09:06,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:06,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:06,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:06,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:09:07,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-04-05 13:09:07,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:09:07,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:09:07,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:09:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash -222757182, now seen corresponding path program 1 times [2024-04-05 13:09:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:09:07,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832476364] [2024-04-05 13:09:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:09:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:09:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:09:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832476364] [2024-04-05 13:09:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832476364] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:09:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464368842] [2024-04-05 13:09:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:07,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:09:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:09:07,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:09:07,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-04-05 13:09:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:08,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2024-04-05 13:09:08,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:09:08,094 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:09:08,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:09:08,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:09:08,218 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:09:08,218 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 [2024-04-05 13:09:08,391 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 [2024-04-05 13:09:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:09:08,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:09:08,782 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:09:08,783 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 [2024-04-05 13:09:08,943 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 13:09:08,956 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:09:08,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:09:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:09:08,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:09:09,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_ArrVal_701 Int)) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_17) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_701) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_20|) 0)))) is different from false [2024-04-05 13:09:36,046 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 13:09:36,046 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 3 case distinctions, treesize of input 129 treesize of output 69 [2024-04-05 13:09:36,056 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 13:09:36,056 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 108 treesize of output 88 [2024-04-05 13:09:36,062 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 58 treesize of output 52 [2024-04-05 13:09:36,068 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 [2024-04-05 13:09:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:09:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464368842] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:09:40,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:09:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 43 [2024-04-05 13:09:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523364501] [2024-04-05 13:09:40,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:09:40,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-04-05 13:09:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:09:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-04-05 13:09:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1498, Unknown=37, NotChecked=82, Total=1892 [2024-04-05 13:09:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:40,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:09:40,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.441860465116279) internal successors, (148), 44 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:09:40,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:40,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:40,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:40,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 13:09:40,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:09:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:09:42,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-04-05 13:09:42,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-04-05 13:09:42,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:09:42,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:09:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -759787727, now seen corresponding path program 1 times [2024-04-05 13:09:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:09:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388414518] [2024-04-05 13:09:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:09:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:09:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:09:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388414518] [2024-04-05 13:09:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388414518] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:09:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993475237] [2024-04-05 13:09:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:09:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:09:43,495 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:09:43,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-04-05 13:09:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:43,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-05 13:09:43,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:09:43,767 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:09:43,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:09:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:09:43,909 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:09:43,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:09:44,101 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 [2024-04-05 13:09:44,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:09:44,751 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 13:09:44,751 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 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 13:09:45,049 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 13:09:45,050 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 39 treesize of output 42 [2024-04-05 13:09:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:09:45,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:09:45,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 13:09:45,592 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_793 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2024-04-05 13:09:45,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_19))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) .cse1) (or (not .cse1) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (store .cse3 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 13:09:45,966 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_19))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) .cse2) (or (not .cse2) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (store .cse4 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse4 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) is different from false [2024-04-05 13:09:46,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)))))))) is different from false [2024-04-05 13:09:47,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse7 |c_~#value~0.offset| (+ 1 (select .cse7 |c_~#value~0.offset|))))))) (let ((.cse5 (store (select .cse6 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base| .cse3) |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 13:09:49,451 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:09:50,851 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 13:09:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45081 treesize of output 42543 [2024-04-05 13:09:51,046 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 13:09:51,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 744 treesize of output 690 [2024-04-05 13:09:51,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 13:09:51,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:09:51,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:09:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 127 treesize of output 137 [2024-04-05 13:09:51,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 279 [2024-04-05 13:09:51,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-04-05 13:09:51,176 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 [2024-04-05 13:09:51,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:09:51,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 13:09:51,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:09:51,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:09:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 30 not checked. [2024-04-05 13:09:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993475237] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:09:51,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:09:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 22] total 55 [2024-04-05 13:09:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440882454] [2024-04-05 13:09:51,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:09:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-04-05 13:09:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:09:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-04-05 13:09:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1976, Unknown=55, NotChecked=594, Total=2970 [2024-04-05 13:09:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:51,679 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:09:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.345454545454546) internal successors, (239), 55 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:09:51,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:09:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:09:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:09:55,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-04-05 13:09:55,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-04-05 13:09:55,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:09:55,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:09:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1161605635, now seen corresponding path program 1 times [2024-04-05 13:09:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:09:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196107093] [2024-04-05 13:09:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:09:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 13:09:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:09:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196107093] [2024-04-05 13:09:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196107093] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:09:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383587141] [2024-04-05 13:09:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:56,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:09:56,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:09:56,101 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:09:56,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-04-05 13:09:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:09:56,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 13:09:56,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:09:56,288 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:09:56,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:09:56,436 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:09:56,436 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 [2024-04-05 13:09:56,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:09:56,719 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:09:56,719 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 [2024-04-05 13:09:56,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:09:56,975 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:09:56,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:09:57,131 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 [2024-04-05 13:09:57,138 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 [2024-04-05 13:09:57,158 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 [2024-04-05 13:09:57,162 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 [2024-04-05 13:09:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:09:57,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:09:57,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:09:57,618 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:09:57,621 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 53 treesize of output 37 [2024-04-05 13:09:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-05 13:09:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:09:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383587141] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:09:57,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:09:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-04-05 13:09:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063126380] [2024-04-05 13:09:57,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:09:57,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-05 13:09:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:09:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-05 13:09:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1016, Unknown=5, NotChecked=0, Total=1190 [2024-04-05 13:09:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:57,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:09:57,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.676470588235294) internal successors, (193), 35 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:09:57,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:09:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:09:59,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-04-05 13:09:59,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-04-05 13:09:59,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:09:59,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:09:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -371588503, now seen corresponding path program 1 times [2024-04-05 13:09:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:09:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319503651] [2024-04-05 13:09:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:09:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:09:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:10:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:10:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:10:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319503651] [2024-04-05 13:10:00,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319503651] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:10:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020910602] [2024-04-05 13:10:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:10:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:10:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:10:00,933 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:10:00,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-04-05 13:10:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:10:01,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 13:10:01,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:10:01,193 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:10:01,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:10:01,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:10:01,344 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:10:01,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:10:01,560 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 [2024-04-05 13:10:01,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:10:02,232 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 13:10:02,232 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 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 13:10:02,609 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 13:10:02,610 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 35 [2024-04-05 13:10:03,167 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 13:10:03,168 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 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 13:10:03,483 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 13:10:03,483 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 39 treesize of output 42 [2024-04-05 13:10:03,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-05 13:10:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:10:03,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:10:10,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (+ .cse12 1)) (.cse7 (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse12))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (let ((.cse1 (store (select .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))))) (store .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse3 4294967296) .cse4))))))) (not .cse7)) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (let ((.cse8 (select .cse11 |c_~#value~0.offset|))) (or (< (mod .cse8 4294967296) .cse4) (< (mod (select (select (store (let ((.cse9 (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse8 1))))) (store .cse9 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse9 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) .cse7)))) is different from false [2024-04-05 13:10:10,198 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (+ .cse12 1)) (.cse0 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse12))) (and (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (let ((.cse4 (store (select .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base|))) (let ((.cse1 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse1 4294967296) .cse2) (< (mod (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse1 1))))) (store .cse3 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_24))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (let ((.cse8 (select .cse11 |c_~#value~0.offset|))) (or (< (mod .cse8 4294967296) .cse2) (< (mod (select (select (store (let ((.cse9 (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse8 1))))) (store .cse9 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse9 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) .cse0)))) is different from false [2024-04-05 13:10:23,036 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int)) (v_ArrVal_961 (Array Int Int)) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961))) (let ((.cse7 (select .cse4 |c_~#value~0.base|))) (let ((.cse1 (select .cse7 |c_~#value~0.offset|))) (let ((.cse6 (store .cse4 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse2 (store (select .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse3 (store .cse5 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) is different from false [2024-04-05 13:10:25,269 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_961 (Array Int Int)) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse11 |c_~#value~0.offset| (+ 1 (select .cse11 |c_~#value~0.offset|))))))) (let ((.cse9 (store (select .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store (store .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961) |c_~#value~0.base|)) (.cse0 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961)) (.cse6 (select .cse8 |c_~#value~0.offset|))) (let ((.cse7 (store .cse3 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))))) (let ((.cse1 (store (select .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse5 4294967296) (+ (mod .cse6 4294967296) 1)))))))))))) is different from false [2024-04-05 13:10:27,462 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:11:39,799 WARN L293 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 13:11:39,799 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 13:11:39,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 8184405 treesize of output 7926544 [2024-04-05 13:11:40,405 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 13:11:40,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14338 treesize of output 13482 [2024-04-05 13:11:40,555 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 62 treesize of output 54 [2024-04-05 13:11:40,610 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 498 treesize of output 418 [2024-04-05 13:11:40,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:11:40,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 13:11:40,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:12:00,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:12:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 16 refuted. 8 times theorem prover too weak. 0 trivial. 18 not checked. [2024-04-05 13:12:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020910602] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:12:00,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:12:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2024-04-05 13:12:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870515214] [2024-04-05 13:12:00,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:12:00,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-05 13:12:00,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-05 13:12:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3712, Unknown=100, NotChecked=524, Total=4830 [2024-04-05 13:12:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:00,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:00,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.9714285714285715) internal successors, (278), 70 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:00,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:00,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:00,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:00,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:12:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:12:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:12:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:12:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:12:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 13:12:08,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-04-05 13:12:08,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:12:08,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:12:08,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -325667869, now seen corresponding path program 1 times [2024-04-05 13:12:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744348763] [2024-04-05 13:12:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:12:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744348763] [2024-04-05 13:12:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744348763] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:12:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189697259] [2024-04-05 13:12:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:12:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:12:09,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:12:09,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-04-05 13:12:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:09,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2024-04-05 13:12:09,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:12:09,776 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:12:09,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:12:09,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:12:09,925 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:12:09,926 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 [2024-04-05 13:12:10,171 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 [2024-04-05 13:12:10,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:12:10,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:12:10,632 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:12:10,632 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 [2024-04-05 13:12:10,940 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 13:12:10,958 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:12:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:12:11,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:12:11,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:12:11,375 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-04-05 13:12:11,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2024-04-05 13:12:11,642 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:12:11,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:12:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 13:12:11,874 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:12:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:12:12,060 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-04-05 13:12:12,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2024-04-05 13:12:12,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:12:12,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:12:12,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 13:12:12,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:12:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:12:12,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:12:15,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse3 (store .cse7 |c_~#value~0.offset| (+ .cse5 1)))) (let ((.cse4 (store .cse6 |c_~#value~0.base| .cse3))) (let ((.cse1 (store (select .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1))) (or (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse0))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)))))))))) is different from false [2024-04-05 13:12:15,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse3 (store .cse7 |c_~#value~0.offset| (+ .cse5 1)))) (let ((.cse4 (store .cse6 |c_~#value~0.base| .cse3))) (let ((.cse1 (store (select .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1))) (or (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse0))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)) (not (= (select (store (store |c_#valid| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)))))))))) is different from false [2024-04-05 13:12:16,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse8))) |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_29))) (let ((.cse9 (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse9 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_29)) (.cse6 (store .cse9 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse6))) (let ((.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1))) (or (< (mod (select (select (store .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (let ((.cse5 (select (store (store (store .cse4 |c_~#value~0.base| .cse6) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse3 (select .cse5 |c_~#value~0.offset|))) (< (mod .cse3 4294967296) (mod (select (select (store (store (store (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store (store |c_#valid| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)))))))))))) is different from false [2024-04-05 13:12:18,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse0 |c_~#value~0.base|))) (let ((.cse2 (select .cse12 |c_~#value~0.offset|))) (let ((.cse1 (store .cse12 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse1) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse9 (select .cse11 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse7 (store .cse11 |c_~#value~0.offset| (+ .cse9 1)))) (let ((.cse8 (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse7))) (let ((.cse5 (store (select .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1)) (.cse10 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (< (mod (select (select (store (store .cse0 |c_~#value~0.base| .cse1) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (let ((.cse6 (select (store (store (store .cse4 |c_~#value~0.base| .cse7) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse3 (select .cse6 |c_~#value~0.offset|))) (< (mod .cse3 4294967296) (mod (select (select (store (store (store (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse9 4294967296) 1)) (not (= (select (store (store .cse10 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (not (= (select .cse10 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0))))))))))))) is different from false [2024-04-05 13:12:18,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse30 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_31))) (let ((.cse4 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse14 (select .cse4 |c_~#value~0.base|))) (let ((.cse6 (select .cse14 |c_~#value~0.offset|))) (let ((.cse5 (store .cse14 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse12 (select (store (store (store .cse13 |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse9 (store .cse13 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse11 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse11))) (let ((.cse2 (store (select .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1)) (.cse7 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (< (mod (select (select (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (< (mod (select (select (store (store .cse4 |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (not (= (select (store (store .cse7 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse10 (select (store (store (store .cse9 |c_~#value~0.base| .cse11) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (< (mod .cse8 4294967296) (mod (select (select (store (store (store (store .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse7 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0))))))))))))))) (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (let ((.cse28 (store (select .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse27 (select (store (store .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse25 (select .cse27 |c_~#value~0.offset|))) (let ((.cse23 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28)) (.cse24 (store .cse27 |c_~#value~0.offset| (+ .cse25 1)))) (let ((.cse26 (select (store (store (store .cse23 |c_~#value~0.base| .cse24) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse22 (select .cse26 |c_~#value~0.offset|))) (let ((.cse16 (store .cse23 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse19 (store .cse26 |c_~#value~0.offset| (+ .cse22 1)))) (let ((.cse21 (store (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse19))) (let ((.cse17 (store (select .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1)) (.cse20 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (let ((.cse18 (select (store (store (store .cse16 |c_~#value~0.base| .cse19) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse15 (select .cse18 |c_~#value~0.offset|))) (< (mod .cse15 4294967296) (mod (select (select (store (store (store (store .cse16 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| (+ .cse15 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store (store .cse20 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse17) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse22 4294967296) 1)) (not (= (select .cse20 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0)) (< (mod (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse24) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse25 4294967296) 1)))))))))))))) (not .cse0))))) is different from false [2024-04-05 13:12:19,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse16 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse15 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (let ((.cse13 (store (select .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store (store .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse6 (select .cse12 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse5 (store .cse12 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse11 (select (store (store (store .cse4 |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse3 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse4 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse10))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse2 (store (select .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1))) (or (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0)) (< (mod (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (let ((.cse9 (select (store (store (store .cse8 |c_~#value~0.base| .cse10) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse7 (select .cse9 |c_~#value~0.offset|))) (< (mod .cse7 4294967296) (mod (select (select (store (store (store (store .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) (not .cse16)) (or .cse16 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_31))) (let ((.cse20 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse20 |c_~#value~0.base|))) (let ((.cse22 (select .cse30 |c_~#value~0.offset|))) (let ((.cse21 (store .cse30 |c_~#value~0.offset| (+ .cse22 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse21) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse19 (select .cse28 |c_~#value~0.offset|))) (let ((.cse25 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse27 (store .cse28 |c_~#value~0.offset| (+ .cse19 1)))) (let ((.cse17 (store (store .cse25 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse27))) (let ((.cse18 (store (select .cse17 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1)) (.cse23 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (< (mod (select (select (store .cse17 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse18) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse19 4294967296) 1)) (< (mod (select (select (store (store .cse20 |c_~#value~0.base| .cse21) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse22 4294967296) 1)) (not (= (select (store (store .cse23 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse26 (select (store (store (store .cse25 |c_~#value~0.base| .cse27) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse24 (select .cse26 |c_~#value~0.offset|))) (< (mod .cse24 4294967296) (mod (select (select (store (store (store (store .cse25 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| (+ .cse24 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse23 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0)))))))))))))))))) is different from false [2024-04-05 13:12:19,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_26 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| Int) (v_DerPreprocessor_29 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse15 |c_~#value~0.offset| (+ 1 (select .cse15 |c_~#value~0.offset|))))))) (let ((.cse13 (store (select .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store (store .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse2 (select .cse12 |c_~#value~0.offset|))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse1 (store .cse12 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse11 (select (store (store (store .cse0 |c_~#value~0.base| .cse1) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse6 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse4 (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse10))) (let ((.cse3 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse5 (store (select .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33|) 0 1))) (or (< (mod (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse1) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_DerPreprocessor_29) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (not (= (select (store (store .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (not (= (select .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_40|) 0)) (let ((.cse9 (select (store (store (store .cse8 |c_~#value~0.base| .cse10) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse7 (select .cse9 |c_~#value~0.offset|))) (< (mod .cse7 4294967296) (mod (select (select (store (store (store (store .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_33| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_26) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) is different from false [2024-04-05 13:12:24,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:12:36,567 WARN L293 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 42 DAG size of output: 32 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 13:12:36,567 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 13:12:36,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 792100 treesize of output 750849 [2024-04-05 13:12:37,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:12:37,007 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 10370 treesize of output 10360 [2024-04-05 13:12:37,196 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 2610 treesize of output 2536 [2024-04-05 13:12:37,260 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 3962 treesize of output 3788 [2024-04-05 13:12:37,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2024-04-05 13:12:37,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1094 treesize of output 918 [2024-04-05 13:12:37,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 154 [2024-04-05 13:12:37,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2044 treesize of output 2042 [2024-04-05 13:12:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 22 not checked. [2024-04-05 13:12:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189697259] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:12:42,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:12:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 30] total 70 [2024-04-05 13:12:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997838559] [2024-04-05 13:12:42,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:12:42,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-04-05 13:12:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-04-05 13:12:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=3449, Unknown=84, NotChecked=910, Total=4970 [2024-04-05 13:12:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:42,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.9857142857142858) internal successors, (279), 71 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 13:12:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 13:12:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 13:12:49,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-04-05 13:12:49,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-04-05 13:12:49,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 13:12:49,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash -491038927, now seen corresponding path program 1 times [2024-04-05 13:12:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204993643] [2024-04-05 13:12:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:12:49,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 13:12:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 13:12:49,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 13:12:49,748 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-05 13:12:49,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-05 13:12:49,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-04-05 13:12:49,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 13:12:49,751 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 13:12:49,751 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 13:12:49,775 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 13:12:49,777 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 13:12:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 13:12:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:12:49,778 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 13:12:49,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-04-05 13:12:49,797 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 13:12:49,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:49,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 13:12:49,798 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;@4046a95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 13:12:49,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 13:12:49,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:49,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1616899814, now seen corresponding path program 1 times [2024-04-05 13:12:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:49,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091019018] [2024-04-05 13:12:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:49,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:12:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091019018] [2024-04-05 13:12:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091019018] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:12:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:12:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 13:12:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740954668] [2024-04-05 13:12:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:12:49,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 13:12:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:49,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 13:12:49,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 13:12:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,816 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:49,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:49,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-04-05 13:12:49,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:49,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash -970814200, now seen corresponding path program 1 times [2024-04-05 13:12:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:49,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384649740] [2024-04-05 13:12:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-04-05 13:12:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384649740] [2024-04-05 13:12:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384649740] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:12:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:12:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 13:12:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303611167] [2024-04-05 13:12:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:12:49,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 13:12:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 13:12:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 13:12:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:49,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:49,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:12:50,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-04-05 13:12:50,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:50,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1108440751, now seen corresponding path program 1 times [2024-04-05 13:12:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:50,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605885373] [2024-04-05 13:12:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:12:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605885373] [2024-04-05 13:12:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605885373] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 13:12:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 13:12:50,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 13:12:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498627249] [2024-04-05 13:12:50,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 13:12:50,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 13:12:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 13:12:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 13:12:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:50,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:50,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 13:12:50,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:50,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-04-05 13:12:50,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:50,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1386114128, now seen corresponding path program 1 times [2024-04-05 13:12:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014748575] [2024-04-05 13:12:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 13:12:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014748575] [2024-04-05 13:12:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014748575] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:12:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500484421] [2024-04-05 13:12:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:51,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:12:51,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:12:51,138 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:12:51,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-04-05 13:12:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:51,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 13:12:51,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:12:51,383 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:12:51,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:12:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:12:51,620 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 13:12:51,621 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 [2024-04-05 13:12:51,759 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:12:51,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:12:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 13:12:51,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:12:51,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1262) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 13:12:55,451 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 13:12:55,451 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 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 13:12:55,458 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 13:12:55,458 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 42 treesize of output 30 [2024-04-05 13:12:55,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-05 13:12:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 4 not checked. [2024-04-05 13:12:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500484421] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:12:55,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:12:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 13:12:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414470849] [2024-04-05 13:12:55,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:12:55,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 13:12:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 13:12:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=796, Unknown=8, NotChecked=58, Total=992 [2024-04-05 13:12:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:55,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:55,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.46875) internal successors, (175), 32 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:12:56,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-04-05 13:12:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-04-05 13:12:56,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:56,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -755467422, now seen corresponding path program 1 times [2024-04-05 13:12:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670782318] [2024-04-05 13:12:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:12:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:12:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670782318] [2024-04-05 13:12:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670782318] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:12:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930224783] [2024-04-05 13:12:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:57,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:12:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:12:57,035 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:12:57,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-04-05 13:12:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:12:57,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 13:12:57,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:12:57,213 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:12:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:12:57,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:12:57,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:12:57,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-04-05 13:12:57,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:12:57,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:12:57,539 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 [2024-04-05 13:12:57,553 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 [2024-04-05 13:12:57,566 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 [2024-04-05 13:12:57,569 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 [2024-04-05 13:12:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:12:57,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:12:57,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:12:57,999 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:12:58,001 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 53 treesize of output 37 [2024-04-05 13:12:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-05 13:12:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:12:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930224783] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:12:58,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:12:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 13:12:58,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747487579] [2024-04-05 13:12:58,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:12:58,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 13:12:58,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:12:58,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 13:12:58,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=742, Unknown=2, NotChecked=0, Total=870 [2024-04-05 13:12:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:58,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:12:58,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:12:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:12:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:12:59,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-04-05 13:12:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:12:59,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:12:59,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:12:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 435043912, now seen corresponding path program 1 times [2024-04-05 13:12:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:12:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588249769] [2024-04-05 13:12:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:12:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:12:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:13:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:13:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588249769] [2024-04-05 13:13:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588249769] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:13:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970650331] [2024-04-05 13:13:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:13:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:13:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:13:00,147 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:13:00,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-04-05 13:13:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:00,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-05 13:13:00,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:13:00,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:13:00,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:13:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:13:00,691 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 13:13:00,691 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 [2024-04-05 13:13:00,874 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:13:00,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:13:01,112 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:13:01,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:13:01,328 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:13:01,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 13:13:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 13:13:01,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:13:04,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse0 4294967296)) (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse5) (or (not .cse5) (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| |c_thr1Thread1of5ForFork0_~vn~0#1|)))) (let ((.cse10 (store (select .cse11 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse6 4294967296)) (< (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse6 1)))) (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))) is different from false [2024-04-05 13:13:04,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of5ForFork0_~v~0#1| 1))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse3 4294967296)))))))) (not .cse7)) (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse8 4294967296)) (< (mod (select (select (store (let ((.cse10 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse7)))) is different from false [2024-04-05 13:13:04,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= (mod .cse0 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) is different from false [2024-04-05 13:13:05,338 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 13:13:05,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 20027 treesize of output 19048 [2024-04-05 13:13:05,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:13:05,405 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 592 treesize of output 608 [2024-04-05 13:13:05,430 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 [2024-04-05 13:13:05,444 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 62 treesize of output 54 [2024-04-05 13:13:05,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:13:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 12 refuted. 32 times theorem prover too weak. 15 trivial. 8 not checked. [2024-04-05 13:13:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970650331] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:13:07,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:13:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 53 [2024-04-05 13:13:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759855000] [2024-04-05 13:13:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:13:07,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-05 13:13:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:13:07,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-05 13:13:07,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2032, Unknown=84, NotChecked=294, Total=2756 [2024-04-05 13:13:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:07,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:13:07,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.867924528301887) internal successors, (258), 53 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:13:07,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:13:10,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-04-05 13:13:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-04-05 13:13:10,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:13:10,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:13:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1686100594, now seen corresponding path program 1 times [2024-04-05 13:13:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:13:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106124463] [2024-04-05 13:13:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:13:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:13:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 13:13:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:13:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106124463] [2024-04-05 13:13:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106124463] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:13:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020681575] [2024-04-05 13:13:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:13:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:13:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:13:10,972 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:13:10,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-04-05 13:13:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:11,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 13:13:11,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:13:11,173 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:13:11,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:13:11,280 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:13:11,281 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 [2024-04-05 13:13:11,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:13:11,563 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 13:13:11,563 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 [2024-04-05 13:13:11,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2024-04-05 13:13:11,859 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:13:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:13:12,008 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 [2024-04-05 13:13:12,019 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 [2024-04-05 13:13:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:13:12,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:13:12,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:13:12,446 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:13:12,448 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 53 treesize of output 37 [2024-04-05 13:13:12,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 17 treesize of output 15 [2024-04-05 13:13:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 13:13:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020681575] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:13:12,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:13:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-04-05 13:13:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123182583] [2024-04-05 13:13:12,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:13:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 13:13:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:13:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 13:13:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2024-04-05 13:13:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:12,838 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:13:12,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.571428571428571) internal successors, (195), 36 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:13:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:13:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:13:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:13:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:13:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:13:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:13:19,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-04-05 13:13:19,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:13:19,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:13:19,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:13:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1793026736, now seen corresponding path program 1 times [2024-04-05 13:13:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:13:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771496247] [2024-04-05 13:13:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:13:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:13:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:13:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:13:21,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771496247] [2024-04-05 13:13:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771496247] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:13:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672943174] [2024-04-05 13:13:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:13:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:13:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:13:21,117 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:13:21,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-04-05 13:13:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:13:21,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 13:13:21,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:13:21,443 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 13:13:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 13:13:21,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:13:21,592 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 13:13:21,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 13:13:21,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 13:13:22,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 13:13:22,492 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 13:13:22,492 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 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 13:13:22,850 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 13:13:22,850 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 35 [2024-04-05 13:13:23,296 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 13:13:23,297 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 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 13:13:23,588 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 13:13:23,589 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 39 treesize of output 42 [2024-04-05 13:13:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 13:13:23,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:13:24,315 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_1600 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2024-04-05 13:13:24,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread3of5ForFork0_~v~0#1| 1))))) (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (not .cse0))))) is different from false [2024-04-05 13:13:25,089 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (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 |c_#memory_int| |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) is different from false [2024-04-05 13:13:25,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|)) (.cse15 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (+ .cse15 1)) (.cse0 (= (mod (select .cse9 |c_~#value~0.offset|) 4294967296) .cse15))) (and (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse7 (store (select .cse8 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store .cse8 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7))) (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7)) (.cse5 (let ((.cse6 (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (or (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (let ((.cse11 (let ((.cse13 (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (store .cse14 |c_~#value~0.offset| (+ (select .cse14 |c_~#value~0.offset|) 1))))) (store (store .cse10 |c_~#value~0.base| .cse12) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| .cse12) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) .cse0)))) is different from false [2024-04-05 13:13:33,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ 1 (select .cse12 |c_~#value~0.offset|))))))) (let ((.cse10 (store (select .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse8))) (let ((.cse2 (store (select .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (let ((.cse4 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2)) (.cse5 (let ((.cse6 (select (store (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)))))))))))) is different from false [2024-04-05 13:13:38,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:13:53,858 WARN L293 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 13:13:53,858 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 13:13:53,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 12370520 treesize of output 12164719 [2024-04-05 13:13:55,087 INFO L349 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2024-04-05 13:13:55,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 16249 treesize of output 15535 [2024-04-05 13:13:55,450 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 2560 treesize of output 2556 [2024-04-05 13:13:55,548 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 498 treesize of output 418 [2024-04-05 13:13:55,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 13:13:55,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:13:55,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 78 [2024-04-05 13:13:55,915 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 4498 treesize of output 4266 [2024-04-05 13:13:56,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:13:56,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 13:13:56,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:13:57,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-04-05 13:13:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 20 refuted. 11 times theorem prover too weak. 0 trivial. 36 not checked. [2024-04-05 13:13:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672943174] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:13:58,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:13:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 27] total 74 [2024-04-05 13:13:58,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99759833] [2024-04-05 13:13:58,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:13:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-04-05 13:13:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:13:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-04-05 13:13:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=3954, Unknown=124, NotChecked=690, Total=5402 [2024-04-05 13:13:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:58,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:13:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.162162162162162) internal successors, (308), 74 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:13:58,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:08,004 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse71 (select .cse70 |c_~#value~0.offset|))) (let ((.cse8 (mod .cse71 4294967296))) (let ((.cse1 (+ .cse8 1)) (.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse70 |c_~#value~0.offset| (+ 1 .cse71))))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse6 (store (select .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse0 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse6))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse6)) (.cse4 (let ((.cse5 (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse5 |c_~#value~0.offset| (+ (select .cse5 |c_~#value~0.offset|) 1))))) (store (store .cse3 |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) (= (select |c_#valid| 3) 1) (or (< .cse8 (+ (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296) 1)) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse10 (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ (select .cse12 |c_~#value~0.offset|) 1))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590))) (let ((.cse22 (select .cse21 |c_~#value~0.base|))) (let ((.cse15 (select .cse22 |c_~#value~0.offset|))) (let ((.cse20 (store .cse22 |c_~#value~0.offset| (+ .cse15 1)))) (let ((.cse13 (store .cse21 |c_~#value~0.base| .cse20))) (let ((.cse14 (store (select .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse16 (let ((.cse17 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse14)) (.cse18 (let ((.cse19 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse20) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse14) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse19 |c_~#value~0.offset| (+ (select .cse19 |c_~#value~0.offset|) 1))))) (store (store .cse17 |c_~#value~0.base| .cse18) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse18) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse15 4294967296) 1)) (< (mod (select (select (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) (<= 0 (div |c_thr1Thread4of5ForFork0_~v~0#1| 4294967296)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (< .cse8 4294967295) (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|v_ULTIMATE.start_main_~#t~0#1.base_171| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1585))) (let ((.cse34 (let ((.cse36 (select .cse35 |c_~#value~0.base|))) (store .cse36 |c_~#value~0.offset| (+ (select .cse36 |c_~#value~0.offset|) 1))))) (let ((.cse33 (store (select (store .cse35 |c_~#value~0.base| .cse34) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse34) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse33) |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse26 (select .cse32 |c_~#value~0.offset|))) (let ((.cse30 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse33)) (.cse31 (store .cse32 |c_~#value~0.offset| (+ .cse26 1)))) (let ((.cse24 (store (store .cse30 |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1590) |c_~#value~0.base| .cse31))) (let ((.cse25 (store (select .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse23 (let ((.cse27 (store .cse30 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25)) (.cse28 (let ((.cse29 (select (store (store (store .cse30 |c_~#value~0.base| .cse31) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse29 |c_~#value~0.offset| (+ (select .cse29 |c_~#value~0.offset|) 1))))) (store (store .cse27 |c_~#value~0.base| .cse28) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse27 |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1595) |c_~#value~0.base| .cse28) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_171| 1) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) 0)) (< (mod (select (select (store .cse23 |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_171|) 0)) (< (mod (select (select (store .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse26 4294967296) 1)) (< (mod (select (select (store .cse23 |v_ULTIMATE.start_main_~#t~0#1.base_171| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1585))) (let ((.cse48 (let ((.cse50 (select .cse49 |c_~#value~0.base|))) (store .cse50 |c_~#value~0.offset| (+ (select .cse50 |c_~#value~0.offset|) 1))))) (let ((.cse47 (store (select (store .cse49 |c_~#value~0.base| .cse48) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse48) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse47) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse39 (select .cse46 |c_~#value~0.offset|))) (let ((.cse44 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse47)) (.cse45 (store .cse46 |c_~#value~0.offset| (+ .cse39 1)))) (let ((.cse37 (store (store .cse44 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse45))) (let ((.cse38 (store (select .cse37 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse40 (let ((.cse41 (store .cse44 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse38)) (.cse42 (let ((.cse43 (select (store (store (store .cse44 |c_~#value~0.base| .cse45) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse38) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse43 |c_~#value~0.offset| (+ (select .cse43 |c_~#value~0.offset|) 1))))) (store (store .cse41 |c_~#value~0.base| .cse42) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse41 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse42) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse37 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse38) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse39 4294967296) 1)) (< (mod (select (select (store .cse40 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) 0)) (< (mod (select (select (store .cse40 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse51 (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1)))) (or (< (mod (select (select (store .cse51 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse51 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (forall ((|v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| Int)) (or (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse62 (store (select .cse7 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse61 (select (store (store .cse7 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse62) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse55 (select .cse61 |c_~#value~0.offset|))) (let ((.cse59 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse62)) (.cse60 (store .cse61 |c_~#value~0.offset| (+ .cse55 1)))) (let ((.cse53 (store (store .cse59 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse60))) (let ((.cse54 (store (select .cse53 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse52 (let ((.cse56 (store .cse59 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse54)) (.cse57 (let ((.cse58 (select (store (store (store .cse59 |c_~#value~0.base| .cse60) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse54) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse58 |c_~#value~0.offset| (+ (select .cse58 |c_~#value~0.offset|) 1))))) (store (store .cse56 |c_~#value~0.base| .cse57) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse56 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse57) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse52 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse52 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse53 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse54) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse55 4294967296) 1))))))))))) (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) 0)))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (<= |c_thr1Thread4of5ForFork0_~v~0#1| 3) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse68 (store (select .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse64 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse68))) (let ((.cse63 (let ((.cse65 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse68)) (.cse66 (let ((.cse67 (select (store .cse64 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse67 |c_~#value~0.offset| (+ (select .cse67 |c_~#value~0.offset|) 1))))) (store (store .cse65 |c_~#value~0.base| .cse66) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse65 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse66) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse63 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse63 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse64 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse69 (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))) (or (< (mod (select (select (store .cse69 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse69 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))) is different from true [2024-04-05 13:14:08,210 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590))) (let ((.cse9 (select .cse8 |c_~#value~0.base|))) (let ((.cse2 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store .cse9 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store .cse8 |c_~#value~0.base| .cse7))) (let ((.cse1 (store (select .cse0 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse1)) (.cse5 (let ((.cse6 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse7) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1585))) (let ((.cse21 (let ((.cse23 (select .cse22 |c_~#value~0.base|))) (store .cse23 |c_~#value~0.offset| (+ (select .cse23 |c_~#value~0.offset|) 1))))) (let ((.cse20 (store (select (store .cse22 |c_~#value~0.base| .cse21) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse21) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse12 (select .cse19 |c_~#value~0.offset|))) (let ((.cse17 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40| .cse20)) (.cse18 (store .cse19 |c_~#value~0.offset| (+ .cse12 1)))) (let ((.cse10 (store (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse18))) (let ((.cse11 (store (select .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse13 (let ((.cse14 (store .cse17 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11)) (.cse15 (let ((.cse16 (select (store (store (store .cse17 |c_~#value~0.base| .cse18) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse16 |c_~#value~0.offset| (+ (select .cse16 |c_~#value~0.offset|) 1))))) (store (store .cse14 |c_~#value~0.base| .cse15) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse15) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse12 4294967296) 1)) (< (mod (select (select (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_40|) 0)) (< (mod (select (select (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))))) is different from false [2024-04-05 13:14:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:14:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:14:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:14:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:14:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:14:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:14:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 13:14:08,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-04-05 13:14:08,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-04-05 13:14:08,438 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:14:08,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:14:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1163445853, now seen corresponding path program 1 times [2024-04-05 13:14:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:14:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787763521] [2024-04-05 13:14:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:14:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:14:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:14:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 13:14:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:14:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787763521] [2024-04-05 13:14:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787763521] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:14:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858397213] [2024-04-05 13:14:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:14:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:14:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:14:08,949 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:14:08,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-04-05 13:14:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:14:09,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 13:14:09,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:14:09,221 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:14:09,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:14:09,259 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:14:09,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:14:09,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-04-05 13:14:09,373 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:14:09,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:14:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-04-05 13:14:09,487 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:14:09,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:14:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-04-05 13:14:09,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:14:09,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:14:09,723 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 [2024-04-05 13:14:09,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 13:14:09,737 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 26 treesize of output 21 [2024-04-05 13:14:09,741 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 18 treesize of output 13 [2024-04-05 13:14:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 13:14:09,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:14:10,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 13:14:10,086 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 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 13:14:10,089 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 53 treesize of output 37 [2024-04-05 13:14:10,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-04-05 13:14:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 13:14:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858397213] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 13:14:10,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 13:14:10,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-04-05 13:14:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845225384] [2024-04-05 13:14:10,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 13:14:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-05 13:14:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 13:14:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-05 13:14:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2024-04-05 13:14:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:10,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 13:14:10,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 8.066666666666666) internal successors, (242), 31 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 13:14:10,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 13:14:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 13:14:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-05 13:14:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 13:14:11,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-04-05 13:14:12,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-04-05 13:14:12,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 13:14:12,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 13:14:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 614498696, now seen corresponding path program 1 times [2024-04-05 13:14:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 13:14:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155578256] [2024-04-05 13:14:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:14:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 13:14:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:14:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:14:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 13:14:13,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155578256] [2024-04-05 13:14:13,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155578256] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 13:14:13,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139845708] [2024-04-05 13:14:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 13:14:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 13:14:13,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 13:14:13,921 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 13:14:13,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-04-05 13:14:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 13:14:14,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-05 13:14:14,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 13:14:14,244 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 13:14:14,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 13:14:14,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 13:14:14,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 13:14:14,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 13:14:14,551 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 [2024-04-05 13:14:14,789 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 13:14:14,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:14:15,067 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:14:15,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:14:15,311 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:14:15,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:14:15,610 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:14:15,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:14:15,867 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:14:15,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 13:14:16,175 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 13:14:16,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 13:14:16,397 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 13:14:16,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 13:14:16,510 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 23 treesize of output 11 [2024-04-05 13:14:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 13:14:16,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 13:14:24,336 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse2 (+ .cse12 1))) (and (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |c_thr1Thread3of5ForFork0_~vn~0#1|)))) (let ((.cse4 (store (select .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base|))) (let ((.cse1 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse1 4294967296) .cse2) (< (mod (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse1 1))))) (store .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (let ((.cse8 (select .cse11 |c_~#value~0.offset|))) (or (< (mod .cse8 4294967296) .cse2) (< (mod (select (select (store (let ((.cse9 (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse8 1))))) (store .cse9 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse9 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) is different from false [2024-04-05 13:14:30,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (+ .cse24 1)) (.cse14 (= (mod (select .cse13 |c_~#value~0.offset|) 4294967296) .cse24))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse7 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse5 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse8 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base|))) (let ((.cse0 (select .cse8 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))) (not .cse14)) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_50 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_50))) (let ((.cse20 (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse23 (select .cse20 |c_~#value~0.base|))) (let ((.cse16 (select .cse23 |c_~#value~0.offset|))) (let ((.cse22 (store .cse20 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse16 1))))) (let ((.cse18 (store (select .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse21 (select (store .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse18) |c_~#value~0.base|))) (let ((.cse15 (select .cse21 |c_~#value~0.offset|))) (or (< (mod .cse15 4294967296) (+ (mod .cse16 4294967296) 1)) (< (mod (select (select (store (let ((.cse19 (store .cse21 |c_~#value~0.offset| (+ .cse15 1)))) (store (store (store .cse17 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse18) |c_~#value~0.base| .cse19) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse20 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse18) |c_~#value~0.base| .cse19) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3))))))))))) .cse14)))) is different from false [2024-04-05 13:14:30,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse10 (= (mod (select .cse23 |c_~#value~0.offset|) 4294967296) .cse24)) (.cse7 (+ .cse24 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_50 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_50))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse9 (select .cse5 |c_~#value~0.base|))) (let ((.cse1 (select .cse9 |c_~#value~0.offset|))) (let ((.cse8 (store .cse5 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse3 (store (select .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse0 (select .cse6 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7))))))))))) .cse10) (or (not .cse10) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse21 (store (select .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse18 (store .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse20 (select (store .cse18 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse13 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse12 (select .cse20 |c_~#value~0.offset|))) (let ((.cse19 (store .cse16 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| (+ .cse12 1))))) (let ((.cse14 (store (select .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse17 (select (store .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base|))) (let ((.cse11 (select .cse17 |c_~#value~0.offset|))) (or (< (mod .cse11 4294967296) (+ (mod .cse12 4294967296) 1)) (< (mod (select (select (store (let ((.cse15 (store .cse17 |c_~#value~0.offset| (+ .cse11 1)))) (store (store (store .cse13 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse16 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7)))))))))))))))) is different from false [2024-04-05 13:14:30,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (or (let ((.cse23 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse10 (= (mod (select .cse23 |c_~#value~0.offset|) 4294967296) .cse24)) (.cse7 (+ .cse24 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_50 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_50))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse9 (select .cse5 |c_~#value~0.base|))) (let ((.cse1 (select .cse9 |c_~#value~0.offset|))) (let ((.cse8 (store .cse5 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse3 (store (select .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse0 (select .cse6 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7))))))))))) .cse10) (or (not .cse10) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse21 (store (select .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse18 (store .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse20 (select (store .cse18 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse13 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse12 (select .cse20 |c_~#value~0.offset|))) (let ((.cse19 (store .cse16 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| (+ .cse12 1))))) (let ((.cse14 (store (select .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse17 (select (store .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base|))) (let ((.cse11 (select .cse17 |c_~#value~0.offset|))) (or (< (mod .cse11 4294967296) (+ (mod .cse12 4294967296) 1)) (< (mod (select (select (store (let ((.cse15 (store .cse17 |c_~#value~0.offset| (+ .cse11 1)))) (store (store (store .cse13 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse16 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7)))))))))))))))) (= 4294967295 .cse24))) is different from false [2024-04-05 13:14:30,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse14 4294967296))) (or (= .cse0 4294967295) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse14))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse5 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse3 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ .cse0 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse7 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse7 4294967296) (+ (mod .cse8 4294967296) 1))))))))))))))))) is different from false [2024-04-05 13:14:32,507 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse4 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse4 1)))) (let ((.cse2 (store .cse13 |c_~#value~0.base| .cse12))) (let ((.cse3 (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse5 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse8 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse6 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (< (mod (select (select (store (let ((.cse7 (store .cse9 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))))))) is different from false [2024-04-05 13:14:37,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse17 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ 1 (select .cse17 |c_~#value~0.offset|))))))) (let ((.cse15 (store (select .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse14 (select (store (store .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base|))) (let ((.cse8 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15)) (.cse13 (store .cse14 |c_~#value~0.offset| (+ .cse8 1)))) (let ((.cse6 (store (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base| .cse13))) (let ((.cse7 (store (select .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store .cse12 |c_~#value~0.base| .cse13) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse9 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse3 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse9 1))))) (let ((.cse1 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)) (< (mod .cse5 4294967296) (+ (mod .cse9 4294967296) 1))))))))))))))))) is different from false