/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -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-03 21:33:44,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-03 21:33:44,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-03 21:33:44,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-03 21:33:44,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-03 21:33:44,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-03 21:33:44,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-03 21:33:44,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-03 21:33:44,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-03 21:33:44,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-03 21:33:44,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-03 21:33:44,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-03 21:33:44,275 INFO L153 SettingsManager]: * Use SBE=true [2024-04-03 21:33:44,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-03 21:33:44,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-03 21:33:44,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-03 21:33:44,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-03 21:33:44,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-03 21:33:44,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-03 21:33:44,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-03 21:33:44,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-03 21:33:44,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-03 21:33:44,279 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-03 21:33:44,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-03 21:33:44,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-03 21:33:44,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-03 21:33:44,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-03 21:33:44,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-03 21:33:44,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-03 21:33:44,280 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-03 21:33:44,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-03 21:33:44,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-03 21:33:44,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-03 21:33:44,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-03 21:33:44,281 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-04-03 21:33:44,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-03 21:33:44,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-03 21:33:44,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-03 21:33:44,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-03 21:33:44,569 INFO L274 PluginConnector]: CDTParser initialized [2024-04-03 21:33:44,570 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-03 21:33:45,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-03 21:33:45,881 INFO L384 CDTParser]: Found 1 translation units. [2024-04-03 21:33:45,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-03 21:33:45,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0fedcc8c3/63d2fb295e0949928b42fe4b9da57f3c/FLAG99740671b [2024-04-03 21:33:45,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0fedcc8c3/63d2fb295e0949928b42fe4b9da57f3c [2024-04-03 21:33:45,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-03 21:33:45,912 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-03 21:33:45,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-03 21:33:45,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-03 21:33:45,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-03 21:33:45,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 09:33:45" (1/1) ... [2024-04-03 21:33:45,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76db625b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:45, skipping insertion in model container [2024-04-03 21:33:45,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 09:33:45" (1/1) ... [2024-04-03 21:33:45,960 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-03 21:33:46,217 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-03 21:33:46,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-03 21:33:46,231 INFO L202 MainTranslator]: Completed pre-run [2024-04-03 21:33:46,259 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-03 21:33:46,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-03 21:33:46,279 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-03 21:33:46,280 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-03 21:33:46,286 INFO L206 MainTranslator]: Completed translation [2024-04-03 21:33:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46 WrapperNode [2024-04-03 21:33:46,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-03 21:33:46,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-03 21:33:46,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-03 21:33:46,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-03 21:33:46,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,317 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-04-03 21:33:46,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-03 21:33:46,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-03 21:33:46,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-03 21:33:46,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-03 21:33:46,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-03 21:33:46,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-03 21:33:46,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-03 21:33:46,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-03 21:33:46,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (1/1) ... [2024-04-03 21:33:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-03 21:33:46,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:46,389 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-03 21:33:46,414 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-03 21:33:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-03 21:33:46,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-03 21:33:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-03 21:33:46,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-03 21:33:46,439 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-03 21:33:46,589 INFO L241 CfgBuilder]: Building ICFG [2024-04-03 21:33:46,591 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-03 21:33:46,763 INFO L282 CfgBuilder]: Performing block encoding [2024-04-03 21:33:46,826 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-03 21:33:46,826 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-03 21:33:46,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 09:33:46 BoogieIcfgContainer [2024-04-03 21:33:46,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-03 21:33:46,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-03 21:33:46,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-03 21:33:46,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-03 21:33:46,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 09:33:45" (1/3) ... [2024-04-03 21:33:46,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f0e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 09:33:46, skipping insertion in model container [2024-04-03 21:33:46,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 09:33:46" (2/3) ... [2024-04-03 21:33:46,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f0e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 09:33:46, skipping insertion in model container [2024-04-03 21:33:46,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 09:33:46" (3/3) ... [2024-04-03 21:33:46,836 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-04-03 21:33:46,842 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-03 21:33:46,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-03 21:33:46,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-03 21:33:46,850 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-03 21:33:46,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-03 21:33:46,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 21:33:46,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 21:33:46,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:46,934 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-03 21:33:46,941 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-03 21:33:46,964 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 21:33:46,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:46,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 21:33:46,980 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;@5d56366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 21:33:46,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-03 21:33:47,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-03 21:33:47,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 790974196, now seen corresponding path program 1 times [2024-04-03 21:33:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424990805] [2024-04-03 21:33:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:47,148 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-03 21:33:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424990805] [2024-04-03 21:33:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424990805] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:47,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 21:33:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852249164] [2024-04-03 21:33:47,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:47,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 21:33:47,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 21:33:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 21:33:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:47,206 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-03 21:33:47,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-03 21:33:47,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-03 21:33:47,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 623441482, now seen corresponding path program 1 times [2024-04-03 21:33:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954493243] [2024-04-03 21:33:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:47,498 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-03 21:33:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954493243] [2024-04-03 21:33:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954493243] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-03 21:33:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506444452] [2024-04-03 21:33:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-03 21:33:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-03 21:33:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-04-03 21:33:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:47,513 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-03 21:33:47,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:47,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-03 21:33:47,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-03 21:33:47,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1929615467, now seen corresponding path program 1 times [2024-04-03 21:33:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678749666] [2024-04-03 21:33:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:48,279 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-03 21:33:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678749666] [2024-04-03 21:33:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678749666] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:48,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:48,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-03 21:33:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697656895] [2024-04-03 21:33:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:48,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-03 21:33:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-03 21:33:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-03 21:33:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:48,298 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-03 21:33:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-03 21:33:48,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-03 21:33:48,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-03 21:33:48,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 540436402, now seen corresponding path program 1 times [2024-04-03 21:33:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234347136] [2024-04-03 21:33:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:33:48,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-03 21:33:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:33:48,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-03 21:33:48,633 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-03 21:33:48,634 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-04-03 21:33:48,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-04-03 21:33:48,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-04-03 21:33:48,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-03 21:33:48,644 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-03 21:33:48,646 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-03 21:33:48,646 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-03 21:33:48,678 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-03 21:33:48,683 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 21:33:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 21:33:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:48,686 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-03 21:33:48,691 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 21:33:48,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:48,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 21:33:48,692 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;@5d56366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 21:33:48,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-03 21:33:48,697 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-03 21:33:48,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1856933464, now seen corresponding path program 1 times [2024-04-03 21:33:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147873053] [2024-04-03 21:33:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:48,702 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-03 21:33:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:48,711 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-03 21:33:48,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147873053] [2024-04-03 21:33:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147873053] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 21:33:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021976118] [2024-04-03 21:33:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 21:33:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 21:33:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 21:33:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:48,727 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-03 21:33:48,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-03 21:33:48,754 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-03 21:33:48,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442431, now seen corresponding path program 1 times [2024-04-03 21:33:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106955893] [2024-04-03 21:33:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:48,898 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-03 21:33:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106955893] [2024-04-03 21:33:48,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106955893] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:48,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-03 21:33:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661956966] [2024-04-03 21:33:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:48,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-03 21:33:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-03 21:33:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-03 21:33:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:48,912 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-03 21:33:48,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:48,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-03 21:33:48,977 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-03 21:33:48,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 715489871, now seen corresponding path program 1 times [2024-04-03 21:33:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251942069] [2024-04-03 21:33:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:49,375 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-03 21:33:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251942069] [2024-04-03 21:33:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251942069] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-03 21:33:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320542665] [2024-04-03 21:33:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:49,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-03 21:33:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-03 21:33:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-03 21:33:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:49,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:49,384 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-03 21:33:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:49,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-03 21:33:49,622 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-03 21:33:49,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -232196713, now seen corresponding path program 1 times [2024-04-03 21:33:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969292540] [2024-04-03 21:33:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:50,163 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-03 21:33:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969292540] [2024-04-03 21:33:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969292540] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:33:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835239153] [2024-04-03 21:33:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:33:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:50,166 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-03 21:33:50,168 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-03 21:33:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:50,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2024-04-03 21:33:50,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:33:50,328 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:33:50,329 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-03 21:33:50,388 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-03 21:33:50,448 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:33:50,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-03 21:33:50,573 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-03 21:33:50,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-03 21:33:50,653 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-03 21:33:50,696 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-03 21:33:50,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:33:50,740 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-03 21:33:51,335 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-03 21:33:51,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-03 21:33:51,346 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-03 21:33:51,464 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-03 21:33:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835239153] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:33:51,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:33:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2024-04-03 21:33:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765279069] [2024-04-03 21:33:51,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:33:51,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-03 21:33:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-03 21:33:51,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=848, Unknown=9, NotChecked=60, Total=1056 [2024-04-03 21:33:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:51,489 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:51,489 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-03 21:33:51,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:51,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:51,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:51,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-03 21:33:51,947 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-03 21:33:52,131 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-03 21:33:52,131 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-03 21:33:52,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1951612766, now seen corresponding path program 1 times [2024-04-03 21:33:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222217694] [2024-04-03 21:33:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:52,676 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-03 21:33:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222217694] [2024-04-03 21:33:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222217694] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:33:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243395357] [2024-04-03 21:33:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:33:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:52,678 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-03 21:33:52,681 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-03 21:33:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:52,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-03 21:33:52,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:33:52,785 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:33:52,785 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-03 21:33:52,830 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:33:52,831 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-03 21:33:52,895 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-03 21:33:52,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:33:52,935 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-03 21:33:53,080 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-03 21:33:53,086 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-03 21:33:53,184 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-03 21:33:53,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:33:53,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:33:53,433 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-03 21:33:53,436 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-03 21:33:53,449 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-03 21:33:53,617 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-03 21:33:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243395357] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:33:53,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:33:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-03 21:33:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378466049] [2024-04-03 21:33:53,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:33:53,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-03 21:33:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-03 21:33:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=738, Unknown=4, NotChecked=0, Total=870 [2024-04-03 21:33:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:53,629 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:53,629 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-03 21:33:53,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:53,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:53,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-03 21:33:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-03 21:33:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 21:33:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 21:33:57,197 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-03 21:33:57,386 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-03 21:33:57,387 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-03 21:33:57,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1062705217, now seen corresponding path program 1 times [2024-04-03 21:33:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010370797] [2024-04-03 21:33:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:33:57,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-03 21:33:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:33:57,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-03 21:33:57,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-03 21:33:57,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-03 21:33:57,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-03 21:33:57,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-03 21:33:57,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-03 21:33:57,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-03 21:33:57,435 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-03 21:33:57,436 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-03 21:33:57,436 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-03 21:33:57,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-03 21:33:57,457 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 21:33:57,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 21:33:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:57,458 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-03 21:33:57,462 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 21:33:57,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:57,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 21:33:57,463 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;@5d56366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 21:33:57,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-03 21:33:57,466 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-03 21:33:57,466 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-03 21:33:57,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -42688683, now seen corresponding path program 1 times [2024-04-03 21:33:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549728756] [2024-04-03 21:33:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:57,477 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-03 21:33:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549728756] [2024-04-03 21:33:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549728756] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 21:33:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542083944] [2024-04-03 21:33:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:57,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 21:33:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 21:33:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 21:33:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:57,485 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-03 21:33:57,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-03 21:33:57,501 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-03 21:33:57,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 417728457, now seen corresponding path program 1 times [2024-04-03 21:33:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589832391] [2024-04-03 21:33:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:57,624 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-03 21:33:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589832391] [2024-04-03 21:33:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589832391] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-03 21:33:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033550149] [2024-04-03 21:33:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:57,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-03 21:33:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:57,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-03 21:33:57,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-03 21:33:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:57,631 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-03 21:33:57,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-03 21:33:57,680 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-03 21:33:57,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1782599532, now seen corresponding path program 1 times [2024-04-03 21:33:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073516377] [2024-04-03 21:33:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:57,960 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-03 21:33:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073516377] [2024-04-03 21:33:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073516377] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:33:57,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:33:57,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-03 21:33:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617711056] [2024-04-03 21:33:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:33:57,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-03 21:33:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:33:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-03 21:33:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-03 21:33:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:33:57,967 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-03 21:33:57,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:57,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:33:57,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:33:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:33:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:33:58,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-03 21:33:58,213 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-03 21:33:58,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:33:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -267004783, now seen corresponding path program 1 times [2024-04-03 21:33:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:33:58,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791015358] [2024-04-03 21:33:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:58,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:33:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:58,779 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-03 21:33:58,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:33:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791015358] [2024-04-03 21:33:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791015358] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:33:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81302010] [2024-04-03 21:33:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:33:58,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:33:58,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:33:58,782 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-03 21:33:58,785 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-03 21:33:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:33:58,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-03 21:33:58,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:33:58,925 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:33:58,925 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-03 21:33:58,977 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-03 21:33:59,025 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:33:59,026 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-03 21:33:59,155 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-03 21:33:59,349 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-03 21:33:59,541 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-03 21:33:59,654 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-03 21:33:59,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:00,373 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-03 21:34:00,373 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-03 21:34:00,380 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-03 21:34:00,380 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-03 21:34:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 6 refuted. 11 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-03 21:34:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81302010] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:00,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2024-04-03 21:34:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907922959] [2024-04-03 21:34:00,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:00,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-03 21:34:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-03 21:34:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=875, Unknown=17, NotChecked=0, Total=1056 [2024-04-03 21:34:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:00,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:00,457 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-03 21:34:00,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:00,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:00,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:00,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-03 21:34:01,015 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-03 21:34:01,207 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-03 21:34:01,208 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-03 21:34:01,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -737606014, now seen corresponding path program 1 times [2024-04-03 21:34:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732384929] [2024-04-03 21:34:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:01,720 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-03 21:34:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732384929] [2024-04-03 21:34:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732384929] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:34:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555017702] [2024-04-03 21:34:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:34:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:01,722 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-03 21:34:01,736 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-03 21:34:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:01,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2024-04-03 21:34:01,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:34:01,861 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:34:01,862 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-03 21:34:01,916 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-03 21:34:01,967 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:34:01,967 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-03 21:34:02,134 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-03 21:34:02,280 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-03 21:34:02,416 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-03 21:34:02,528 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:34:02,528 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-03 21:34:02,678 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-03 21:34:02,689 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:34:02,689 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-03 21:34:02,729 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-03 21:34:02,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:03,172 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_347 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_9 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_347))) (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_thr1Thread2of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_346) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_20|) 0)))) is different from false [2024-04-03 21:34:15,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:34:15,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:34:15,432 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 934 treesize of output 880 [2024-04-03 21:34:15,447 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-03 21:34:15,455 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-03 21:34:15,474 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 115 treesize of output 113 [2024-04-03 21:34:16,489 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-03 21:34:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555017702] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:16,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-03 21:34:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072679458] [2024-04-03 21:34:16,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-03 21:34:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-03 21:34:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1576, Unknown=32, NotChecked=84, Total=1980 [2024-04-03 21:34:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:16,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:16,497 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-03 21:34:16,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:16,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:16,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:16,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-03 21:34:16,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:34:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-03 21:34:17,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-03 21:34:17,849 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-03 21:34:17,849 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-03 21:34:17,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash -928964791, now seen corresponding path program 1 times [2024-04-03 21:34:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276212072] [2024-04-03 21:34:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:18,603 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-03 21:34:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276212072] [2024-04-03 21:34:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276212072] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:34:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111781825] [2024-04-03 21:34:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:18,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:34:18,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:18,605 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-03 21:34:18,607 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-03 21:34:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:18,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-04-03 21:34:18,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:34:18,809 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:34:18,809 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-03 21:34:18,899 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-03 21:34:18,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:34:18,958 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-03 21:34:19,085 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-03 21:34:19,283 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:34:19,284 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-03 21:34:19,490 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:34:19,490 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-03 21:34:19,687 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:34:19,687 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-03 21:34:19,769 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-03 21:34:19,796 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-03 21:34:19,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:22,519 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-03 21:34:23,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:34:23,261 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 6601 treesize of output 6319 [2024-04-03 21:34:23,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2024-04-03 21:34:23,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-04-03 21:34:23,502 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-03 21:34:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-03 21:34:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111781825] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:23,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:23,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2024-04-03 21:34:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450723438] [2024-04-03 21:34:23,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:23,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-03 21:34:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-03 21:34:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2152, Unknown=73, NotChecked=98, Total=2652 [2024-04-03 21:34:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:23,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:23,623 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-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-03 21:34:23,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:34:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:34:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:34:25,987 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-03 21:34:26,184 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-03 21:34:26,184 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-03 21:34:26,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1454667501, now seen corresponding path program 1 times [2024-04-03 21:34:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912735964] [2024-04-03 21:34:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:26,625 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-03 21:34:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912735964] [2024-04-03 21:34:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912735964] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:34:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821951712] [2024-04-03 21:34:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:34:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:26,627 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-03 21:34:26,652 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-03 21:34:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:26,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-03 21:34:26,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:34:26,763 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:34:26,763 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-03 21:34:26,869 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:34:26,869 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-03 21:34:27,033 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-03 21:34:27,137 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:34:27,137 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-03 21:34:27,271 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-03 21:34:27,365 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:34:27,365 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-03 21:34:27,480 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-03 21:34:27,485 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-03 21:34:27,499 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-03 21:34:27,502 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-03 21:34:27,543 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-03 21:34:27,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:27,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:34:27,801 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-03 21:34:27,803 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-03 21:34:27,811 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-03 21:34:28,079 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-03 21:34:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821951712] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:28,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2024-04-03 21:34:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788189514] [2024-04-03 21:34:28,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:28,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-03 21:34:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-03 21:34:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=836, Unknown=2, NotChecked=0, Total=992 [2024-04-03 21:34:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:28,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:28,106 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-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:34:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-03 21:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-03 21:34:28,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-04-03 21:34:28,976 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-03 21:34:28,979 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-03 21:34:28,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1094034385, now seen corresponding path program 1 times [2024-04-03 21:34:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143173223] [2024-04-03 21:34:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:34:29,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-03 21:34:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:34:29,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-03 21:34:29,075 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-03 21:34:29,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-03 21:34:29,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-03 21:34:29,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-03 21:34:29,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-03 21:34:29,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-03 21:34:29,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-03 21:34:29,079 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-03 21:34:29,079 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-03 21:34:29,080 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-03 21:34:29,097 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-03 21:34:29,101 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 21:34:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 21:34:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:29,102 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-03 21:34:29,108 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-03 21:34:29,110 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 21:34:29,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:29,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 21:34:29,111 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;@5d56366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 21:34:29,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-03 21:34:29,112 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-03 21:34:29,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1788341269, now seen corresponding path program 1 times [2024-04-03 21:34:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858798080] [2024-04-03 21:34:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:29,122 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-03 21:34:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858798080] [2024-04-03 21:34:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858798080] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:34:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:34:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 21:34:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389496644] [2024-04-03 21:34:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:34:29,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 21:34:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 21:34:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 21:34:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,137 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:29,137 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-03 21:34:29,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-03 21:34:29,152 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-03 21:34:29,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -423966927, now seen corresponding path program 1 times [2024-04-03 21:34:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207065544] [2024-04-03 21:34:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:29,253 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-03 21:34:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:29,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207065544] [2024-04-03 21:34:29,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207065544] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:34:29,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:34:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-03 21:34:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536353562] [2024-04-03 21:34:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:34:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-03 21:34:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-03 21:34:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-03 21:34:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:29,257 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-03 21:34:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:34:29,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-03 21:34:29,321 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-03 21:34:29,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1513268162, now seen corresponding path program 1 times [2024-04-03 21:34:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864289722] [2024-04-03 21:34:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:29,543 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-03 21:34:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864289722] [2024-04-03 21:34:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864289722] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:34:29,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:34:29,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-03 21:34:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639100586] [2024-04-03 21:34:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:34:29,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-03 21:34:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-03 21:34:29,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-03 21:34:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:29,546 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-03 21:34:29,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:34:29,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:29,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-03 21:34:29,779 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-03 21:34:29,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847127, now seen corresponding path program 1 times [2024-04-03 21:34:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030738070] [2024-04-03 21:34:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:30,151 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-03 21:34:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030738070] [2024-04-03 21:34:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030738070] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:34:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760041791] [2024-04-03 21:34:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:34:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:30,152 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-03 21:34:30,153 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-03 21:34:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:30,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-03 21:34:30,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:34:30,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:34:30,328 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-03 21:34:30,368 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-03 21:34:30,509 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-03 21:34:30,509 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-03 21:34:30,654 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:34:30,655 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-03 21:34:30,741 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-03 21:34:30,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:30,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_645) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-03 21:34:33,802 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-03 21:34:33,803 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-03 21:34:33,808 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-03 21:34:33,808 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-03 21:34:33,812 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-03 21:34:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 4 not checked. [2024-04-03 21:34:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760041791] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:33,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-03 21:34:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66783031] [2024-04-03 21:34:33,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-03 21:34:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-03 21:34:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=787, Unknown=17, NotChecked=58, Total=992 [2024-04-03 21:34:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:33,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:33,858 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-03 21:34:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:34:34,478 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-03 21:34:34,674 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-03 21:34:34,674 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-03 21:34:34,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash -222757182, now seen corresponding path program 1 times [2024-04-03 21:34:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489127709] [2024-04-03 21:34:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:35,086 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-03 21:34:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:34:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489127709] [2024-04-03 21:34:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489127709] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:34:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042935574] [2024-04-03 21:34:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:34:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:34:35,088 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-03 21:34:35,102 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-03 21:34:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:34:35,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2024-04-03 21:34:35,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:34:35,265 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:34:35,266 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-03 21:34:35,323 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-03 21:34:35,380 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:34:35,381 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-03 21:34:35,561 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-03 21:34:35,706 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-03 21:34:35,823 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-03 21:34:35,935 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:34:35,936 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-03 21:34:36,083 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-03 21:34:36,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:34:36,101 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-03 21:34:36,138 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-03 21:34:36,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:34:55,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:34:55,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:34:55,607 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 934 treesize of output 880 [2024-04-03 21:34:55,618 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-03 21:34:55,623 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-03 21:34:55,633 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 115 treesize of output 113 [2024-04-03 21:34:58,132 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-03 21:34:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042935574] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:34:58,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:34:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-03 21:34:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354723455] [2024-04-03 21:34:58,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:34:58,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-03 21:34:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:34:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-03 21:34:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1644, Unknown=40, NotChecked=0, Total=1980 [2024-04-03 21:34:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:58,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:34:58,138 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-03 21:34:58,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:58,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:58,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:58,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:34:58,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:34:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:34:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:34:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:34:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-03 21:34:59,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-04-03 21:34:59,412 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-03 21:34:59,413 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-03 21:34:59,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:34:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash -759787727, now seen corresponding path program 1 times [2024-04-03 21:34:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:34:59,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293179651] [2024-04-03 21:34:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:34:59,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:34:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:00,203 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-03 21:35:00,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:35:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293179651] [2024-04-03 21:35:00,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293179651] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:35:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039780102] [2024-04-03 21:35:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:35:00,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:35:00,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:35:00,205 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-03 21:35:00,208 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-03 21:35:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:00,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-03 21:35:00,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:35:00,442 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:35:00,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-03 21:35:00,504 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-03 21:35:00,567 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:35:00,567 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-03 21:35:00,717 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-03 21:35:00,914 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-03 21:35:01,233 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-03 21:35:01,233 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-03 21:35:01,482 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-03 21:35:01,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-03 21:35:01,700 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-03 21:35:01,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:35:01,931 WARN L854 $PredicateComparison]: unable to prove that (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)) is different from false [2024-04-03 21:35:02,132 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |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-03 21:35:02,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (or (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) .cse3))) (and (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) (= 4294967295 .cse3))) is different from false [2024-04-03 21:35:03,544 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (|thr1Thread2of4ForFork0_~#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 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store (store .cse5 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse0 4294967296)) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |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-03 21:35:04,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:35:04,422 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-03 21:35:04,422 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 18248 treesize of output 17730 [2024-04-03 21:35:04,527 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-03 21:35:04,527 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 465 treesize of output 435 [2024-04-03 21:35:04,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:35:04,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:35:04,609 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 582 treesize of output 578 [2024-04-03 21:35:04,631 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 283 treesize of output 275 [2024-04-03 21:35:04,646 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-03 21:35:04,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:35:04,677 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-03 21:35:04,695 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-03 21:35:04,756 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-03 21:35:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 13 refuted. 8 times theorem prover too weak. 3 trivial. 18 not checked. [2024-04-03 21:35:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039780102] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:35:04,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:35:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 20] total 53 [2024-04-03 21:35:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340173743] [2024-04-03 21:35:04,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:35:04,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-03 21:35:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:35:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-03 21:35:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1983, Unknown=46, NotChecked=388, Total=2756 [2024-04-03 21:35:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:04,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:35:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.471698113207547) internal successors, (237), 53 states have internal predecessors, (237), 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-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-03 21:35:04,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:35:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:35:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:35:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:35:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-03 21:35:07,276 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-03 21:35:07,471 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-03 21:35:07,471 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-03 21:35:07,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:35:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1161605635, now seen corresponding path program 1 times [2024-04-03 21:35:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:35:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562876504] [2024-04-03 21:35:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:35:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:35:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:08,035 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-03 21:35:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:35:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562876504] [2024-04-03 21:35:08,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562876504] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:35:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824133927] [2024-04-03 21:35:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:35:08,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:35:08,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:35:08,037 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-03 21:35:08,052 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-03 21:35:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:08,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-03 21:35:08,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:35:08,194 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:35:08,194 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-03 21:35:08,289 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:35:08,290 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-03 21:35:08,425 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-03 21:35:08,500 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:35:08,500 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-03 21:35:08,628 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-03 21:35:08,697 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:35:08,697 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-03 21:35:08,818 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-03 21:35:08,824 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-03 21:35:08,906 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-03 21:35:08,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:35:08,962 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread3of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_24 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse1) (or (not .cse1) (forall ((v_DerPreprocessor_23 (Array Int Int))) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread3of4ForFork0_~vn~0#1|)) |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-04-03 21:35:09,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:35:09,113 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-03 21:35:09,115 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-03 21:35:09,120 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-03 21:35:09,408 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-03 21:35:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824133927] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:35:09,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:35:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-04-03 21:35:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589923177] [2024-04-03 21:35:09,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:35:09,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-03 21:35:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:35:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-03 21:35:09,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=957, Unknown=3, NotChecked=64, Total=1190 [2024-04-03 21:35:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:09,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:35:09,421 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-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-03 21:35:09,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:18,216 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-03 21:35:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-03 21:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:35:18,463 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-03 21:35:18,656 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-03 21:35:18,659 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-03 21:35:18,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:35:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -371588503, now seen corresponding path program 1 times [2024-04-03 21:35:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:35:18,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200331629] [2024-04-03 21:35:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:35:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:35:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:19,835 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-03 21:35:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:35:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200331629] [2024-04-03 21:35:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200331629] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:35:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636941723] [2024-04-03 21:35:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:35:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:35:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:35:19,837 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-03 21:35:19,838 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-03 21:35:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:35:19,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-03 21:35:19,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:35:20,065 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:35:20,066 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-03 21:35:20,139 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-03 21:35:20,200 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:35:20,200 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-03 21:35:20,355 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-03 21:35:20,573 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-03 21:35:20,886 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-03 21:35:20,887 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-03 21:35:21,195 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-03 21:35:21,196 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-03 21:35:21,568 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-03 21:35:21,568 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-03 21:35:21,836 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-03 21:35:21,836 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-03 21:35:21,981 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-03 21:35:22,018 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-03 21:35:22,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:35:29,512 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 ((.cse7 (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse4 (+ .cse12 1))) (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 .cse7 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_26))) (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)))))))))) is different from false [2024-04-03 21:35:29,544 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 ((.cse0 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse2 (+ .cse12 1))) (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 .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_26))) (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)))))))))) is different from false [2024-04-03 21:35:45,263 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-03 21:35:47,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:35:52,535 WARN L293 SmtUtils]: Spent 5.15s 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-03 21:35:52,535 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-03 21:35:52,537 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 2000045 treesize of output 1790008 [2024-04-03 21:35:53,088 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-03 21:35:53,088 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 7582 treesize of output 7022 [2024-04-03 21:35:53,298 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 5100 treesize of output 5096 [2024-04-03 21:35:53,360 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 922 treesize of output 842 [2024-04-03 21:35:53,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:35:53,509 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-03 21:35:53,536 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-03 21:36:29,130 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-03 21:36:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 20 refuted. 16 times theorem prover too weak. 0 trivial. 6 not checked. [2024-04-03 21:36:29,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636941723] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:36:29,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:36:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2024-04-03 21:36:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984408740] [2024-04-03 21:36:29,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:36:29,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-03 21:36:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:36:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-03 21:36:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=3820, Unknown=92, NotChecked=396, Total=4830 [2024-04-03 21:36:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:36:29,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:36:29,364 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-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:36:29,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:36:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:36:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-03 21:36:35,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-04-03 21:36:35,503 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-03 21:36:35,503 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-03 21:36:35,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:36:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -325667869, now seen corresponding path program 1 times [2024-04-03 21:36:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:36:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843429988] [2024-04-03 21:36:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:36:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:36:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:36:36,019 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-03 21:36:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:36:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843429988] [2024-04-03 21:36:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843429988] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:36:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953808409] [2024-04-03 21:36:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:36:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:36:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:36:36,021 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-03 21:36:36,022 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-03 21:36:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:36:36,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2024-04-03 21:36:36,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:36:36,256 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:36:36,256 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-03 21:36:36,315 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-03 21:36:36,370 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:36:36,371 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-03 21:36:36,542 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-03 21:36:36,690 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-03 21:36:36,825 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-03 21:36:36,934 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:36:36,934 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-03 21:36:37,176 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-03 21:36:37,188 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:36:37,188 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-03 21:36:37,342 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-03 21:36:37,424 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-03 21:36:37,486 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-04-03 21:36:37,486 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-03 21:36:37,700 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:36:37,701 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-03 21:36:37,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 21:36:37,895 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:36:37,896 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-03 21:36:38,030 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-04-03 21:36:38,031 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-03 21:36:38,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:36:38,108 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-03 21:36:38,229 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-03 21:36:38,231 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-03 21:36:38,275 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-03 21:36:38,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:36:40,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| 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_31|) 0 1))) (or (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .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_31| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)))))))))) is different from false [2024-04-03 21:36:47,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| 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_32))) (let ((.cse9 (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_32)) (.cse4 (store .cse9 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse4))) (let ((.cse2 (store (select .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (let ((.cse3 (select (store (store (store .cse1 |c_~#value~0.base| .cse4) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_28) |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_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (< (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)))))))))))) is different from false [2024-04-03 21:36:48,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 0)) (< (mod (select (select (store (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= 0 (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))) (< (mod (select (select (store .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1))))))))))))) is different from false [2024-04-03 21:36:49,167 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_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_DerPreprocessor_28 (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_~vn~0#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 ((.cse10 (select .cse12 |c_~#value~0.offset|))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse9 (store .cse12 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse11 (select (store (store (store .cse8 |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store .cse8 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse7 (store .cse11 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse7))) (let ((.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1)) (.cse3 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (< (mod (select (select (store .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (not (= (select .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 0)) (let ((.cse6 (select (store (store (store .cse5 |c_~#value~0.base| .cse7) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse6 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= 0 (select (store (store .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))) (< (mod (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1)))))))))))))) (not .cse16)) (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_33 (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_33))) (let ((.cse18 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse18 |c_~#value~0.base|))) (let ((.cse20 (select .cse30 |c_~#value~0.offset|))) (let ((.cse19 (store .cse30 |c_~#value~0.offset| (+ .cse20 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse19) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse23 (select .cse28 |c_~#value~0.offset|))) (let ((.cse25 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse27 (store .cse28 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse27))) (let ((.cse22 (store (select .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1)) (.cse17 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (not (= (select .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 0)) (< (mod (select (select (store (store .cse18 |c_~#value~0.base| .cse19) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse20 4294967296) 1)) (< (mod (select (select (store .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse22) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (let ((.cse26 (select (store (store (store .cse25 |c_~#value~0.base| .cse27) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse22) |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_31| .cse22) |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_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= 0 (select (store (store .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))))))))))))))) .cse16)))) is different from false [2024-04-03 21:36:49,284 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_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_DerPreprocessor_28 (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 ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 0)) (not (= 0 (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))) (< (mod (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1)))))))))))))) (not .cse16)) (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_33 (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_33))) (let ((.cse18 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse18 |c_~#value~0.base|))) (let ((.cse20 (select .cse30 |c_~#value~0.offset|))) (let ((.cse19 (store .cse30 |c_~#value~0.offset| (+ .cse20 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse19) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse23 (select .cse28 |c_~#value~0.offset|))) (let ((.cse25 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse27 (store .cse28 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse27))) (let ((.cse22 (store (select .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1)) (.cse17 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (not (= (select .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 0)) (< (mod (select (select (store (store .cse18 |c_~#value~0.base| .cse19) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse20 4294967296) 1)) (< (mod (select (select (store .cse21 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse22) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (let ((.cse26 (select (store (store (store .cse25 |c_~#value~0.base| .cse27) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse22) |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_31| .cse22) |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_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= 0 (select (store (store .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))))))))))))))) .cse16)))) is different from false [2024-04-03 21:36:49,470 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_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| Int) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1078 Int) (v_DerPreprocessor_28 (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 ((.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_38| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse4 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_DerPreprocessor_32)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (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)) (.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (< (mod (select (select (store .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (not (= (select .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38|) 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_38| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (not (= 0 (select (store (store .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_38| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|))) (let ((.cse9 (select (store (store (store .cse8 |c_~#value~0.base| .cse10) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |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_31| .cse1) |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_28) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) is different from false [2024-04-03 21:36:54,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:37:12,491 WARN L293 SmtUtils]: Spent 17.07s 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-03 21:37:12,491 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-03 21:37:12,495 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 988788 treesize of output 931153 [2024-04-03 21:37:13,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:37:13,006 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 8602 treesize of output 8592 [2024-04-03 21:37:13,258 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 1075 treesize of output 1005 [2024-04-03 21:37:13,327 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 4320 treesize of output 4050 [2024-04-03 21:37:13,418 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 2225 treesize of output 2201 [2024-04-03 21:37:13,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2024-04-03 21:37:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1370 treesize of output 1146 [2024-04-03 21:37:13,815 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 2492 treesize of output 2490 [2024-04-03 21:37:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 5 refuted. 15 times theorem prover too weak. 0 trivial. 22 not checked. [2024-04-03 21:37:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953808409] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:37:19,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:37:19,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 30] total 70 [2024-04-03 21:37:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779865114] [2024-04-03 21:37:19,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:37:19,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-04-03 21:37:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-04-03 21:37:19,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=3547, Unknown=102, NotChecked=786, Total=4970 [2024-04-03 21:37:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:19,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:19,109 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-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-03 21:37:19,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-03 21:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-03 21:37:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-03 21:37:25,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-04-03 21:37:25,314 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-03 21:37:25,315 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-03 21:37:25,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -491038927, now seen corresponding path program 1 times [2024-04-03 21:37:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625708119] [2024-04-03 21:37:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:37:25,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-03 21:37:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-03 21:37:25,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-03 21:37:25,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-03 21:37:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-03 21:37:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-04-03 21:37:25,382 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-03 21:37:25,382 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-03 21:37:25,382 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-03 21:37:25,405 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-03 21:37:25,408 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 21:37:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 21:37:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:25,425 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-03 21:37:25,426 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-03 21:37:25,445 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 21:37:25,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:25,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 21:37:25,446 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;@5d56366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 21:37:25,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-03 21:37:25,447 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-03 21:37:25,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1616899814, now seen corresponding path program 1 times [2024-04-03 21:37:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278929293] [2024-04-03 21:37:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:25,455 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-03 21:37:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278929293] [2024-04-03 21:37:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278929293] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:37:25,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:37:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 21:37:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021484365] [2024-04-03 21:37:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:37:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 21:37:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 21:37:25,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 21:37:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:25,466 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-03 21:37:25,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-04-03 21:37:25,480 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-03 21:37:25,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -970814200, now seen corresponding path program 1 times [2024-04-03 21:37:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22188973] [2024-04-03 21:37:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:25,585 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-03 21:37:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22188973] [2024-04-03 21:37:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22188973] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:37:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:37:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-03 21:37:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280555544] [2024-04-03 21:37:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:37:25,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-03 21:37:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-03 21:37:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-03 21:37:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,592 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:25,592 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-03 21:37:25,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:37:25,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-04-03 21:37:25,650 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-03 21:37:25,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1108440751, now seen corresponding path program 1 times [2024-04-03 21:37:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616610855] [2024-04-03 21:37:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:25,843 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-03 21:37:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:25,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616610855] [2024-04-03 21:37:25,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616610855] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 21:37:25,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 21:37:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-03 21:37:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641353232] [2024-04-03 21:37:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 21:37:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-03 21:37:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:25,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-03 21:37:25,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-03 21:37:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:25,846 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-03 21:37:25,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:25,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-03 21:37:25,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:26,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-04-03 21:37:26,097 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-03 21:37:26,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1386114128, now seen corresponding path program 1 times [2024-04-03 21:37:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933983381] [2024-04-03 21:37:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:26,444 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-03 21:37:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933983381] [2024-04-03 21:37:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933983381] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:37:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741261656] [2024-04-03 21:37:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:37:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:26,447 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-03 21:37:26,448 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-03 21:37:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:26,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-03 21:37:26,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:37:26,665 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:37:26,665 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-03 21:37:26,702 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-03 21:37:26,852 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-03 21:37:26,852 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-03 21:37:26,963 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:37:26,963 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-03 21:37:27,038 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-03 21:37:27,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:37:27,087 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-03 21:37:30,032 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-03 21:37:30,032 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-03 21:37:30,038 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-03 21:37:30,038 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-03 21:37:30,040 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-03 21:37:30,083 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-03 21:37:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741261656] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:37:30,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:37:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-03 21:37:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640112850] [2024-04-03 21:37:30,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:37:30,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-03 21:37:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-03 21:37:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=786, Unknown=18, NotChecked=58, Total=992 [2024-04-03 21:37:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:30,090 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:30,090 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-03 21:37:30,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:30,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:30,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:30,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:30,731 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-03 21:37:30,925 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-03 21:37:30,925 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-03 21:37:30,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -755467422, now seen corresponding path program 1 times [2024-04-03 21:37:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222831509] [2024-04-03 21:37:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:31,346 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-03 21:37:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222831509] [2024-04-03 21:37:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222831509] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:37:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785606106] [2024-04-03 21:37:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:37:31,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:31,348 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-03 21:37:31,351 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-03 21:37:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:31,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-03 21:37:31,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:37:31,513 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:37:31,514 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-03 21:37:31,544 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:37:31,545 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-03 21:37:31,620 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-03 21:37:31,649 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:37:31,650 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-03 21:37:31,765 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-03 21:37:31,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 21:37:31,777 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-03 21:37:31,779 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-03 21:37:31,827 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-03 21:37:31,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:37:32,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:37:32,097 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-03 21:37:32,099 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-03 21:37:32,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-04-03 21:37:32,257 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-03 21:37:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785606106] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:37:32,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:37:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-03 21:37:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150010250] [2024-04-03 21:37:32,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:37:32,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-03 21:37:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-03 21:37:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=740, Unknown=4, NotChecked=0, Total=870 [2024-04-03 21:37:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:32,266 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:32,266 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-03 21:37:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:32,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-04-03 21:37:33,094 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-03 21:37:33,095 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-03 21:37:33,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash 435043912, now seen corresponding path program 1 times [2024-04-03 21:37:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:33,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483632660] [2024-04-03 21:37:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:33,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:33,831 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-03 21:37:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483632660] [2024-04-03 21:37:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483632660] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:37:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903826015] [2024-04-03 21:37:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:37:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:33,832 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-03 21:37:33,833 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-03 21:37:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:33,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-03 21:37:33,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:37:34,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:37:34,063 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-03 21:37:34,104 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-03 21:37:34,258 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-03 21:37:34,259 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-03 21:37:34,405 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:37:34,405 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-03 21:37:34,629 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:37:34,630 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-03 21:37:34,783 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:37:34,783 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-03 21:37:34,906 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-03 21:37:34,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:37:34,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1412 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |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-03 21:37:35,414 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |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_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (forall ((v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_39))) (or (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) .cse0)))) is different from false [2024-04-03 21:37:36,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (= (mod (select .cse7 |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) (v_ArrVal_1410 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread1of5ForFork0_~v~0#1| 1))))) (let ((.cse5 (store (select .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |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_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (not .cse8)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse13 (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse9 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse9 1)))) (store (store .cse11 |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (= (mod .cse9 4294967296) 4294967295) (< (mod (select (select (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) .cse8)))) is different from false [2024-04-03 21:37:36,951 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) (v_ArrVal_1410 (Array Int 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 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse1 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-03 21:37:37,008 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) (v_ArrVal_1410 (Array Int 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 |thr1Thread1of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store (store .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse1 4294967296) 4294967295) (< (mod (select (select (store .cse0 |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-03 21:37:37,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (v_ArrVal_1400 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1400))) (let ((.cse6 (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (store .cse8 |c_~#value~0.offset| (+ (select .cse8 |c_~#value~0.offset|) 1))))) (let ((.cse5 (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread1of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |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_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))) is different from false [2024-04-03 21:37:40,925 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-03 21:37:40,926 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 84946 treesize of output 82333 [2024-04-03 21:37:41,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:37:41,102 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 2023 treesize of output 2035 [2024-04-03 21:37:41,171 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 1016 treesize of output 952 [2024-04-03 21:37:41,197 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 664 treesize of output 656 [2024-04-03 21:37:41,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 73 treesize of output 69 [2024-04-03 21:37:41,701 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-03 21:37:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 6 refuted. 4 times theorem prover too weak. 4 trivial. 53 not checked. [2024-04-03 21:37:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903826015] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:37:41,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:37:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 22] total 56 [2024-04-03 21:37:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698775141] [2024-04-03 21:37:41,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:37:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-04-03 21:37:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-04-03 21:37:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2018, Unknown=103, NotChecked=606, Total=3080 [2024-04-03 21:37:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:41,817 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:41,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.714285714285714) internal successors, (264), 56 states have internal predecessors, (264), 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-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:41,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:37:43,970 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-03 21:37:44,165 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-03 21:37:44,166 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-03 21:37:44,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1686100594, now seen corresponding path program 1 times [2024-04-03 21:37:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059392078] [2024-04-03 21:37:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:44,706 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-03 21:37:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059392078] [2024-04-03 21:37:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059392078] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:37:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533791924] [2024-04-03 21:37:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:37:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:44,707 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-03 21:37:44,709 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-03 21:37:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:44,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-03 21:37:44,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:37:44,896 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:37:44,896 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-03 21:37:44,987 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:37:44,987 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-03 21:37:45,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-03 21:37:45,206 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-03 21:37:45,207 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-03 21:37:45,332 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-03 21:37:45,396 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:37:45,397 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-03 21:37:45,509 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-03 21:37:45,513 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-03 21:37:45,592 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-03 21:37:45,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:37:45,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:37:45,851 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-03 21:37:45,853 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-03 21:37:45,858 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-03 21:37:46,155 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-03 21:37:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533791924] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:37:46,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:37:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-04-03 21:37:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517452226] [2024-04-03 21:37:46,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:37:46,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-03 21:37:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:37:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-03 21:37:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2024-04-03 21:37:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:46,161 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:37:46,162 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-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:37:46,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:55,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:37:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-03 21:37:55,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:37:55,380 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-03 21:37:55,579 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-03 21:37:55,580 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-03 21:37:55,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:37:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1793026736, now seen corresponding path program 1 times [2024-04-03 21:37:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:37:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537986865] [2024-04-03 21:37:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:37:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:56,767 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-03 21:37:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:37:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537986865] [2024-04-03 21:37:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537986865] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:37:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326144489] [2024-04-03 21:37:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:37:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:37:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:37:56,769 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-03 21:37:56,769 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-03 21:37:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:37:56,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-03 21:37:56,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:37:57,043 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-03 21:37:57,043 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-03 21:37:57,113 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-03 21:37:57,162 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-03 21:37:57,162 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-03 21:37:57,322 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-03 21:37:57,540 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-03 21:37:57,833 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-03 21:37:57,834 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-03 21:37:58,106 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-03 21:37:58,106 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-03 21:37:58,459 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-03 21:37:58,459 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-03 21:37:58,702 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-03 21:37:58,702 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-03 21:37:58,945 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-03 21:37:58,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:37:59,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread3of5ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_45) |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-03 21:38:01,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse5 (+ .cse12 1))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_46 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse1 (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))))) (store .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse4 4294967296) .cse5))))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse8 (store (select .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse6 4294967296) .cse5) (< (mod (select (select (store (let ((.cse7 (store (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |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-03 21:38:11,320 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1590 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590))) (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 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse5 (select (store .cse6 |thr1Thread2of5ForFork0_~#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| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |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-03 21:38:12,702 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)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1590 (Array Int Int)) (|thr1Thread3of5ForFork0_~#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_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store (store .cse10 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|)) (.cse0 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590)) (.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 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse7 |thr1Thread2of5ForFork0_~#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 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse5 4294967296) (+ (mod .cse6 4294967296) 1)))))))))))) is different from false [2024-04-03 21:38:16,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-03 21:38:23,824 WARN L293 SmtUtils]: Spent 7.38s 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-03 21:38:23,824 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-03 21:38:23,826 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 573855 treesize of output 509642 [2024-04-03 21:38:24,375 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-03 21:38:24,376 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 7945 treesize of output 7385 [2024-04-03 21:38:24,604 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-03 21:38:24,654 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 922 treesize of output 842 [2024-04-03 21:38:24,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:38:24,769 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-03 21:38:24,796 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-03 21:38:45,481 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-03 21:38:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 23 refuted. 16 times theorem prover too weak. 7 trivial. 24 not checked. [2024-04-03 21:38:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326144489] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:38:45,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:38:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 25] total 72 [2024-04-03 21:38:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390272985] [2024-04-03 21:38:45,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:38:45,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-04-03 21:38:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:38:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-04-03 21:38:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3871, Unknown=128, NotChecked=540, Total=5112 [2024-04-03 21:38:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:45,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:38:45,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.194444444444445) internal successors, (302), 72 states have internal predecessors, (302), 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-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:38:45,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-03 21:38:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:38:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-03 21:38:50,994 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-03 21:38:51,187 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-03 21:38:51,188 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-03 21:38:51,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:38:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1163445853, now seen corresponding path program 1 times [2024-04-03 21:38:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:38:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221439389] [2024-04-03 21:38:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:38:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:38:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:38:51,682 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-03 21:38:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:38:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221439389] [2024-04-03 21:38:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221439389] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:38:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300307471] [2024-04-03 21:38:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:38:51,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:38:51,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:38:51,684 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-03 21:38:51,688 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-03 21:38:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:38:51,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-03 21:38:51,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:38:51,962 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:38:51,963 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-03 21:38:51,996 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:38:51,996 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-03 21:38:52,057 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-03 21:38:52,095 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:38:52,095 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-03 21:38:52,158 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-03 21:38:52,197 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:38:52,198 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-03 21:38:52,262 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-03 21:38:52,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:38:52,295 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-03 21:38:52,400 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-03 21:38:52,404 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-03 21:38:52,489 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-03 21:38:52,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:38:52,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 21:38:52,719 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-03 21:38:52,721 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-03 21:38:52,726 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-03 21:38:53,014 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-03 21:38:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300307471] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 21:38:53,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 21:38:53,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-04-03 21:38:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659255489] [2024-04-03 21:38:53,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 21:38:53,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-03 21:38:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 21:38:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-03 21:38:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=788, Unknown=4, NotChecked=0, Total=930 [2024-04-03 21:38:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:53,023 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 21:38:53,024 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-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-03 21:38:53,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:57,637 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-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-03 21:38:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-03 21:38:57,918 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-03 21:38:58,118 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-03 21:38:58,119 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-03 21:38:58,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 21:38:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 614498696, now seen corresponding path program 1 times [2024-04-03 21:38:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 21:38:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527573108] [2024-04-03 21:38:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:38:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 21:38:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:38:59,710 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-03 21:38:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 21:38:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527573108] [2024-04-03 21:38:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527573108] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 21:38:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77377432] [2024-04-03 21:38:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 21:38:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 21:38:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 21:38:59,712 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-03 21:38:59,719 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-03 21:38:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 21:38:59,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-03 21:38:59,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 21:38:59,997 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 21:38:59,997 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-03 21:39:00,066 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-03 21:39:00,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 21:39:00,109 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-03 21:39:00,251 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-03 21:39:00,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-03 21:39:00,447 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-03 21:39:00,674 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:39:00,675 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-03 21:39:00,873 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:39:00,874 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-03 21:39:01,112 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:39: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-03 21:39:01,320 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:39:01,321 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-03 21:39:01,569 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-03 21:39:01,569 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-03 21:39:01,748 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-03 21:39:01,748 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-03 21:39:01,838 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-03 21:39:01,879 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-03 21:39:01,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 21:39:01,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |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-03 21:39:07,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse2 (+ .cse12 1))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_53 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_53))) (let ((.cse5 (select .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 .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 (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 ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ |c_thr1Thread3of5ForFork0_~v~0#1| 1))))) (let ((.cse8 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse6 4294967296) .cse2) (< (mod (select (select (store (let ((.cse7 (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse7 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .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-03 21:39:12,616 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#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 ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse7 (select .cse2 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse6 (store .cse2 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))))) (let ((.cse0 (store (select .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse3 (select (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse1 (store .cse3 |c_~#value~0.offset| (+ .cse4 1)))) (store (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |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 .cse4 4294967296) (+ (mod .cse5 4294967296) 1))))))))))) is different from false [2024-04-03 21:39:14,993 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) (v_DerPreprocessor_54 (Array Int 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 ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_54))) (let ((.cse18 (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse23 (select .cse18 |c_~#value~0.base|))) (let ((.cse21 (select .cse23 |c_~#value~0.offset|))) (let ((.cse22 (store .cse18 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse21 1))))) (let ((.cse16 (store (select .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse19 (select (store .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base|))) (let ((.cse20 (select .cse19 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse17 (store .cse19 |c_~#value~0.offset| (+ .cse20 1)))) (store (store (store .cse15 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse18 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |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 .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< (mod .cse20 4294967296) (+ (mod .cse21 4294967296) 1)))))))))))) .cse14)))) is different from false [2024-04-03 21:39:15,069 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)) (.cse6 (+ .cse24 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_54 (Array Int 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 ((.cse0 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_54))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse9 (select .cse3 |c_~#value~0.base|))) (let ((.cse7 (select .cse9 |c_~#value~0.offset|))) (let ((.cse8 (store .cse3 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse7 1))))) (let ((.cse1 (store (select .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse8 |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 .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< (mod .cse5 4294967296) (+ (mod .cse7 4294967296) 1)))))))))))) .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) .cse6)))))))))))))))) is different from false [2024-04-03 21:39:15,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse24 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse11 (= (mod (select .cse24 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse7 (+ .cse0 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_54 (Array Int 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 ((.cse1 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_54))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse10 (select .cse4 |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse4 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse2 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse5 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|))) (let ((.cse6 (select .cse5 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse3 (store .cse5 |c_~#value~0.offset| (+ .cse6 1)))) (store (store (store .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .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) (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7) (< (mod .cse6 4294967296) (+ (mod .cse8 4294967296) 1)))))))))))) .cse11) (or (not .cse11) (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 ((.cse23 (store |c_#memory_int| |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse22 (store (select .cse23 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store .cse23 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse21 (select (store .cse19 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse14 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse17 (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse13 (select .cse21 |c_~#value~0.offset|))) (let ((.cse20 (store .cse17 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| (+ .cse13 1))))) (let ((.cse15 (store (select .cse20 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse18 (select (store .cse20 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base|))) (let ((.cse12 (select .cse18 |c_~#value~0.offset|))) (or (< (mod .cse12 4294967296) (+ (mod .cse13 4294967296) 1)) (< (mod (select (select (store (let ((.cse16 (store .cse18 |c_~#value~0.offset| (+ .cse12 1)))) (store (store (store .cse14 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| .cse16) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse17 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| .cse16) |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 .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7)))))))))))))))))) is different from false [2024-04-03 21:39:15,203 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-03 21:39:15,309 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 ((.cse1 (mod .cse14 4294967296))) (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| (+ 1 .cse14))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse0 |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 .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ .cse1 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))))))))))))) (= .cse1 4294967295))))) is different from false [2024-04-03 21:39:15,497 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-03 21:39:20,082 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