/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:33:45,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:33:45,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:33:45,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:33:45,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:33:45,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:33:45,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:33:45,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:33:45,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:33:45,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:33:45,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:33:45,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:33:45,661 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:33:45,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:33:45,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:33:45,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:33:45,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:33:45,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:33:45,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:33:45,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:33:45,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:33:45,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:33:45,665 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:33:45,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:33:45,665 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:33:45,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:33:45,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:33:45,666 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:33:45,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:33:45,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:33:45,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:33:45,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:33:45,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:33:45,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:33:45,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:33:45,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:33:45,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:33:45,669 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:33:45,669 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:33:45,669 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:33:45,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP [2023-11-17 18:33:45,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:33:45,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:33:45,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:33:45,898 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:33:45,901 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:33:45,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-17 18:33:47,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:33:47,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:33:47,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-17 18:33:47,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a98d249/d64d72c63443400ea6c04fa151f7fb80/FLAG49aec8008 [2023-11-17 18:33:47,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a98d249/d64d72c63443400ea6c04fa151f7fb80 [2023-11-17 18:33:47,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:33:47,280 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:33:47,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:33:47,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:33:47,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:33:47,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bb224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47, skipping insertion in model container [2023-11-17 18:33:47,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,316 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:33:47,505 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2023-11-17 18:33:47,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:33:47,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:33:47,562 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2023-11-17 18:33:47,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:33:47,577 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:33:47,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47 WrapperNode [2023-11-17 18:33:47,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:33:47,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:33:47,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:33:47,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:33:47,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,610 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 18:33:47,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:33:47,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:33:47,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:33:47,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:33:47,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:33:47,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:33:47,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:33:47,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:33:47,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (1/1) ... [2023-11-17 18:33:47,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:33:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:47,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 18:33:47,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 18:33:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:33:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:33:47,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:33:47,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:33:47,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:33:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:33:47,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:33:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:33:47,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:33:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:33:47,724 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 18:33:47,844 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:33:47,846 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:33:48,138 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:33:48,148 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:33:48,149 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 18:33:48,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:33:48 BoogieIcfgContainer [2023-11-17 18:33:48,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:33:48,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:33:48,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:33:48,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:33:48,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:33:47" (1/3) ... [2023-11-17 18:33:48,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:33:48, skipping insertion in model container [2023-11-17 18:33:48,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:33:47" (2/3) ... [2023-11-17 18:33:48,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:33:48, skipping insertion in model container [2023-11-17 18:33:48,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:33:48" (3/3) ... [2023-11-17 18:33:48,157 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-11-17 18:33:48,165 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:33:48,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:33:48,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:33:48,174 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:33:48,264 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:33:48,300 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:33:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:33:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:48,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 18:33:48,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 18:33:48,345 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:33:48,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:33:48,374 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;@9a20ef3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:33:48,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:33:48,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:33:48,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1146503672, now seen corresponding path program 1 times [2023-11-17 18:33:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748897980] [2023-11-17 18:33:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:33:48,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:48,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748897980] [2023-11-17 18:33:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748897980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:33:48,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:33:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:33:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703421145] [2023-11-17 18:33:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:33:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:33:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:48,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:33:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:33:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:48,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:48,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:33:48,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:33:49,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:33:49,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash 215508343, now seen corresponding path program 1 times [2023-11-17 18:33:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884265561] [2023-11-17 18:33:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-17 18:33:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884265561] [2023-11-17 18:33:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884265561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:33:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:33:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:33:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880247913] [2023-11-17 18:33:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:33:49,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:33:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:33:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:33:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:49,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:33:49,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:33:49,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:33:49,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1722369126, now seen corresponding path program 1 times [2023-11-17 18:33:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141258039] [2023-11-17 18:33:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141258039] [2023-11-17 18:33:50,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141258039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:33:50,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842329393] [2023-11-17 18:33:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:50,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:33:50,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 18:33:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:50,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:33:50,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:33:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:50,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842329393] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:33:50,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:33:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-17 18:33:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593238244] [2023-11-17 18:33:50,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:33:50,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 18:33:50,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 18:33:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-17 18:33:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:50,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:50,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.875) internal successors, (213), 24 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:33:50,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:50,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:50,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:51,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 18:33:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-17 18:33:51,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:33:51,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 175783613, now seen corresponding path program 2 times [2023-11-17 18:33:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081918349] [2023-11-17 18:33:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 18:33:51,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081918349] [2023-11-17 18:33:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081918349] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:33:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903531588] [2023-11-17 18:33:51,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:33:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:51,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:51,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:33:51,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 18:33:51,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:33:51,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:33:51,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:33:51,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:33:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:33:52,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:33:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903531588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:33:52,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:33:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2023-11-17 18:33:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888457396] [2023-11-17 18:33:52,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:33:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 18:33:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 18:33:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2023-11-17 18:33:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:52,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:52,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.52) internal successors, (263), 25 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:33:52,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:52,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:52,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:52,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:33:52,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 18:33:53,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:53,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:33:53,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1401702355, now seen corresponding path program 3 times [2023-11-17 18:33:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009816092] [2023-11-17 18:33:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009816092] [2023-11-17 18:33:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009816092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:33:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913457090] [2023-11-17 18:33:56,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:33:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:56,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:33:56,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 18:33:57,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 18:33:57,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:33:57,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-17 18:33:57,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:33:58,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:58,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 18:33:59,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:59,018 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 30 treesize of output 21 [2023-11-17 18:33:59,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:59,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-17 18:33:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:33:59,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:59,980 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4))) c_~sum3~0 c_~sum2~0) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0) 4294967296))) is different from false [2023-11-17 18:34:00,008 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4))) c_~sum3~0 |c_thread2Thread1of1ForFork2_#t~mem4| c_~sum2~0) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0) 4294967296))) is different from false [2023-11-17 18:34:00,148 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (= (mod (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4 .cse0)) c_~sum3~0 c_~sum2~0 (select .cse1 (+ c_~A~0.offset .cse0)))) 4294967296) (mod (+ (select .cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296)))) is different from false [2023-11-17 18:34:00,188 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (= (mod (+ (select .cse0 c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4)) c_~sum3~0 c_~sum2~0) 4294967296) (mod (+ (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296)))) is different from false [2023-11-17 18:34:00,360 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (= (mod (+ (select .cse0 c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4)) c_~sum3~0 c_~sum2~0) 4294967296) (mod (+ c_~sum1~0 (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) 4294967296)))) is different from false [2023-11-17 18:34:00,516 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133))) (let ((.cse0 (select .cse1 c_~A~0.base))) (= (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0 (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) 4294967296) (mod (+ (select .cse0 c_~A~0.offset) c_~sum3~0 c_~sum2~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_134) c_~A~0.base) (+ c_~A~0.offset 4))) 4294967296))))) is different from false [2023-11-17 18:34:00,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:00,576 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 370 treesize of output 276 [2023-11-17 18:34:00,583 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 116 treesize of output 108 [2023-11-17 18:34:00,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:00,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 61 [2023-11-17 18:34:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2023-11-17 18:34:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913457090] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:34:31,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:34:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 30, 30] total 86 [2023-11-17 18:34:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402504419] [2023-11-17 18:34:31,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:34:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-11-17 18:34:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:34:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-11-17 18:34:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=5776, Unknown=40, NotChecked=966, Total=7310 [2023-11-17 18:34:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:31,266 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:34:31,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 4.709302325581396) internal successors, (405), 86 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:34:31,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:31,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:31,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:31,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:34:31,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:34:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:34:40,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 18:34:40,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:40,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:34:40,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:34:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1707417572, now seen corresponding path program 4 times [2023-11-17 18:34:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:34:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560309446] [2023-11-17 18:34:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:34:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:34:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:34:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 18:34:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:34:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560309446] [2023-11-17 18:34:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560309446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:34:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511002916] [2023-11-17 18:34:40,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 18:34:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:34:40,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:34:40,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 18:34:41,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 18:34:41,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:34:41,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 18:34:41,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:34:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 18:34:41,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:34:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 18:34:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511002916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:34:41,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:34:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2023-11-17 18:34:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637037897] [2023-11-17 18:34:41,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:34:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 18:34:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:34:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 18:34:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2023-11-17 18:34:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:41,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:34:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.2631578947368425) internal successors, (276), 38 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:34:41,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:34:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:34:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:34:42,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 18:34:42,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:42,562 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:34:42,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:34:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1287658700, now seen corresponding path program 5 times [2023-11-17 18:34:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:34:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937573992] [2023-11-17 18:34:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:34:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:34:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:34:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:34:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:34:46,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937573992] [2023-11-17 18:34:46,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937573992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:34:46,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628300273] [2023-11-17 18:34:46,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 18:34:46,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:46,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:34:46,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:34:46,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 18:34:47,022 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 18:34:47,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:34:47,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-17 18:34:47,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:34:47,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-17 18:34:47,115 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 18:34:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-17 18:34:47,381 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 18:34:47,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 18:34:48,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 18:34:48,904 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 30 treesize of output 21 [2023-11-17 18:34:49,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:49,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 [2023-11-17 18:34:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:34:50,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:34:51,349 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8 .cse1)) c_~sum2~0)) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0 (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) 4294967296)))) is different from false [2023-11-17 18:34:51,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) c_~sum3~0 |c_thread2Thread1of1ForFork2_#t~mem4| (select .cse0 (+ c_~A~0.offset 8 .cse1)) c_~sum2~0)) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0 (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) 4294967296)))) is different from false [2023-11-17 18:34:51,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) c_~sum3~0 |c_thread2Thread1of1ForFork2_#t~mem4| (select .cse0 (+ c_~A~0.offset 8 .cse1)) c_~sum2~0)) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 4)))) 4294967296)))) is different from false [2023-11-17 18:34:51,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) c_~sum3~0 c_~sum2~0 (select .cse0 (+ c_~A~0.offset 4))) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse1 (+ c_~A~0.offset .cse2)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 4)))) 4294967296)))) is different from false [2023-11-17 18:34:52,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse1 (+ c_~A~0.offset .cse2 4)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 8)))) 4294967296))))) is different from false [2023-11-17 18:34:52,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_218) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 (+ c_~A~0.offset .cse2 4)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 8)))) 4294967296))))) is different from false [2023-11-17 18:34:52,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:52,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 482 treesize of output 402 [2023-11-17 18:34:52,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:52,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 145 [2023-11-17 18:34:52,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:34:52,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 101 [2023-11-17 18:35:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 6 not checked. [2023-11-17 18:35:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628300273] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:05,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 38, 37] total 114 [2023-11-17 18:35:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820350965] [2023-11-17 18:35:05,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2023-11-17 18:35:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2023-11-17 18:35:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=10885, Unknown=54, NotChecked=1302, Total=12882 [2023-11-17 18:35:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:05,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:05,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 114 states have (on average 4.087719298245614) internal successors, (466), 114 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:05,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:11,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 18:35:11,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:11,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:35:11,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash 220973571, now seen corresponding path program 6 times [2023-11-17 18:35:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276389700] [2023-11-17 18:35:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 31 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:35:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:35:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276389700] [2023-11-17 18:35:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276389700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:35:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219769739] [2023-11-17 18:35:11,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 18:35:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:11,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:35:11,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:35:11,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 18:35:12,431 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-17 18:35:12,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:35:12,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-17 18:35:12,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 46 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:35:13,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 52 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-17 18:35:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219769739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:13,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2023-11-17 18:35:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447095532] [2023-11-17 18:35:13,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:13,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-17 18:35:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-17 18:35:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2023-11-17 18:35:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:13,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:13,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.541666666666667) internal successors, (314), 48 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:13,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:35:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:35:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 18:35:14,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 18:35:14,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:14,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:35:14,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1029004851, now seen corresponding path program 7 times [2023-11-17 18:35:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541317222] [2023-11-17 18:35:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:35:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:35:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541317222] [2023-11-17 18:35:19,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541317222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:35:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075617663] [2023-11-17 18:35:19,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 18:35:19,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:35:19,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:35:19,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 18:35:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:19,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-17 18:35:19,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:19,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-17 18:35:19,501 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 18:35:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-17 18:35:19,774 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 18:35:19,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 18:35:21,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 18:35:21,817 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 30 treesize of output 21 [2023-11-17 18:35:23,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:23,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 17 [2023-11-17 18:35:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 18:35:23,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:26,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8 .cse1)) c_~sum2~0 (select .cse0 (+ c_~A~0.offset 12 .cse1)) (select .cse0 (+ c_~A~0.offset 4 .cse1)))) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse2 4)) |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset .cse2 8)) c_~sum1~0)) 4294967296)))) is different from false [2023-11-17 18:35:26,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset .cse1 8)) c_~sum1~0)) 4294967296) (mod (let ((.cse2 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ c_~sum3~0 |c_thread2Thread1of1ForFork2_#t~mem4| (select .cse0 (+ c_~A~0.offset 8 .cse2)) c_~sum2~0 (select .cse0 (+ c_~A~0.offset 12 .cse2)) (select .cse0 (+ c_~A~0.offset 4 .cse2)))) 4294967296)))) is different from false [2023-11-17 18:35:26,267 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse2 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset .cse1 8)) c_~sum1~0)) 4294967296) (mod (let ((.cse3 (* c_thread2Thread1of1ForFork2_~i~1 4))) (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8 .cse3)) c_~sum2~0 (select .cse2 (+ c_~A~0.offset .cse3)) (select .cse0 (+ c_~A~0.offset 12 .cse3)) (select .cse0 (+ c_~A~0.offset 4 .cse3)))) 4294967296)))) is different from false [2023-11-17 18:35:26,295 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse2 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset .cse1 8)) c_~sum1~0)) 4294967296) (mod (+ (select .cse2 c_~A~0.offset) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) c_~sum2~0) 4294967296)))) is different from false [2023-11-17 18:35:26,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (let ((.cse1 (* |c_thread1Thread1of1ForFork1_#t~post1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) (select .cse2 (+ c_~A~0.offset .cse1 12)) c_~sum1~0 (select .cse2 (+ c_~A~0.offset .cse1 8)))) 4294967296) (mod (+ (select .cse0 c_~A~0.offset) c_~sum3~0 (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) c_~sum2~0) 4294967296)))) is different from false [2023-11-17 18:35:26,575 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309))) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base)) (.cse2 (select .cse3 c_~A~0.base))) (= (mod (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 8)) (select .cse2 (+ c_~A~0.offset .cse1 4)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse1 12)))) 4294967296) (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) c_~sum2~0 (select .cse2 c_~A~0.offset)) 4294967296))))) is different from false [2023-11-17 18:35:26,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) c_~sum2~0 (select .cse1 c_~A~0.offset)) 4294967296) (mod (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (+ |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset .cse2 8)) (select .cse1 (+ c_~A~0.offset .cse2 4)) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 12)))) 4294967296))))) is different from false [2023-11-17 18:35:26,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:26,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 594 treesize of output 546 [2023-11-17 18:35:26,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 198 treesize of output 200 [2023-11-17 18:35:26,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 159 [2023-11-17 18:36:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 52 trivial. 23 not checked. [2023-11-17 18:36:15,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075617663] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:36:15,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:36:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 52, 45] total 146 [2023-11-17 18:36:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307957318] [2023-11-17 18:36:15,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:36:15,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-11-17 18:36:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:36:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-11-17 18:36:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=18328, Unknown=55, NotChecked=1960, Total=21170 [2023-11-17 18:36:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:15,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:36:15,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 3.691780821917808) internal successors, (539), 146 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:36:15,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:15,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-17 18:36:15,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 18:36:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-17 18:36:23,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 18:36:24,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-17 18:36:24,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:36:24,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:36:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2057742038, now seen corresponding path program 8 times [2023-11-17 18:36:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:36:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282357861] [2023-11-17 18:36:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:36:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:36:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:36:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-17 18:36:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:36:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282357861] [2023-11-17 18:36:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282357861] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:36:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585636994] [2023-11-17 18:36:24,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:36:24,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:36:24,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:36:24,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:36:24,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 18:36:24,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:36:24,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:36:24,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 18:36:24,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:36:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 77 proven. 79 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-17 18:36:25,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:36:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 85 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-17 18:36:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585636994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:36:25,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:36:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 58 [2023-11-17 18:36:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231255276] [2023-11-17 18:36:25,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:36:25,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-17 18:36:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:36:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-17 18:36:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2816, Unknown=0, NotChecked=0, Total=3306 [2023-11-17 18:36:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:25,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:36:25,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.068965517241379) internal successors, (352), 58 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:36:25,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2023-11-17 18:36:25,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-17 18:36:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 18:36:26,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 18:36:27,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 18:36:27,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:36:27,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:36:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -918812474, now seen corresponding path program 9 times [2023-11-17 18:36:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:36:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671576341] [2023-11-17 18:36:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:36:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:36:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:36:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:36:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:36:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671576341] [2023-11-17 18:36:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671576341] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:36:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215396991] [2023-11-17 18:36:32,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:36:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:36:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:36:32,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:36:32,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 18:36:32,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-17 18:36:32,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:36:32,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 144 conjunts are in the unsatisfiable core [2023-11-17 18:36:32,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:36:34,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 18:36:35,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 18:36:35,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:36:35,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 18:36:36,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:36:36,422 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 32 treesize of output 23 [2023-11-17 18:36:40,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:40,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 19 [2023-11-17 18:36:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:36:41,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:36:49,151 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 16)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ c_~A~0.offset (- 16) .cse2)) (select .cse0 (+ c_~A~0.offset .cse2 (- 4))) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 (- 8))) (select .cse0 (+ c_~A~0.offset .cse2 (- 12))))) 4294967296))))) is different from false [2023-11-17 18:36:49,162 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 16)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ c_~A~0.offset (- 16) .cse2)) |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset .cse2 (- 4))) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 (- 8))) (select .cse0 (+ c_~A~0.offset .cse2 (- 12))))) 4294967296))))) is different from false [2023-11-17 18:36:49,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 16)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ c_~A~0.offset (- 16) .cse2)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) (select .cse0 (+ c_~A~0.offset .cse2 (- 4))) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 (- 8))) (select .cse0 (+ c_~A~0.offset .cse2 (- 12))))) 4294967296))))) is different from false [2023-11-17 18:36:49,207 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 16)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) c_~sum2~0) 4294967296) (mod (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ c_~A~0.offset (- 16) .cse2)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select .cse0 (+ c_~A~0.offset .cse2 (- 4))) c_~sum1~0 (select .cse0 (+ c_~A~0.offset .cse2 (- 8))) (select .cse0 (+ c_~A~0.offset .cse2 (- 12))))) 4294967296))))) is different from false [2023-11-17 18:36:49,236 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse0 (select .cse4 c_~A~0.base)) (.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base))) (= (mod (+ (select .cse0 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) c_~sum3~0 (select .cse1 (+ c_~A~0.offset 16)) c_~sum2~0 (select .cse1 (+ c_~A~0.offset 12))) 4294967296) (mod (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ c_~A~0.offset .cse2 (- 4))) c_~sum1~0 (select .cse0 (+ c_~A~0.offset (- 16) .cse2)) (select .cse1 (+ c_~A~0.offset .cse2 (- 8))) (select .cse1 (+ c_~A~0.offset .cse2 (- 12))) (select (select .cse3 c_~A~0.base) c_~A~0.offset))) 4294967296)))))) is different from false [2023-11-17 18:36:49,334 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_#t~ret9#1.base|)) (.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (= (mod (let ((.cse1 (* c_~N~0 4))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret9#1.offset| (- 8))) (select .cse2 (+ (- 16) .cse1 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) c_~sum1~0 (select (select .cse3 |c_ULTIMATE.start_main_#t~ret9#1.base|) |c_ULTIMATE.start_main_#t~ret9#1.offset|) (select .cse0 (+ .cse1 (- 12) |c_ULTIMATE.start_main_#t~ret9#1.offset|)))) 4294967296) (mod (+ (select .cse2 |c_ULTIMATE.start_main_#t~ret9#1.offset|) (select .cse0 (+ 16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) c_~sum3~0 (select .cse0 (+ 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) c_~sum2~0 (select .cse0 (+ 12 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret9#1.offset| 4))) 4294967296)))))) is different from false [2023-11-17 18:36:53,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:53,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 179 [2023-11-17 18:36:54,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:54,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 5222 treesize of output 4638 [2023-11-17 18:36:54,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:54,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 551 treesize of output 499 [2023-11-17 18:36:54,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 403 treesize of output 453 [2023-11-17 18:36:54,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 177 treesize of output 275 Received shutdown request... [2023-11-17 18:42:21,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:42:21,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:42:21,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:42:22,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 18:42:22,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-17 18:42:22,837 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 18:42:22,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-17 18:42:22,893 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 18:42:22,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 18:42:22,893 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-11-17 18:42:22,895 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 18:42:22,895 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 18:42:22,895 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 18:42:22,898 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1] [2023-11-17 18:42:22,901 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 18:42:22,901 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 18:42:22,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:42:22 BasicIcfg [2023-11-17 18:42:22,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 18:42:22,906 INFO L158 Benchmark]: Toolchain (without parser) took 515626.06ms. Allocated memory was 238.0MB in the beginning and 715.1MB in the end (delta: 477.1MB). Free memory was 190.7MB in the beginning and 374.4MB in the end (delta: -183.7MB). Peak memory consumption was 478.4MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,908 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:42:22,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.54ms. Allocated memory is still 238.0MB. Free memory was 190.3MB in the beginning and 178.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.60ms. Allocated memory is still 238.0MB. Free memory was 178.9MB in the beginning and 176.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,909 INFO L158 Benchmark]: Boogie Preprocessor took 26.45ms. Allocated memory is still 238.0MB. Free memory was 176.8MB in the beginning and 175.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,909 INFO L158 Benchmark]: RCFGBuilder took 511.49ms. Allocated memory is still 238.0MB. Free memory was 175.5MB in the beginning and 158.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,909 INFO L158 Benchmark]: TraceAbstraction took 514753.61ms. Allocated memory was 238.0MB in the beginning and 715.1MB in the end (delta: 477.1MB). Free memory was 158.0MB in the beginning and 374.4MB in the end (delta: -216.4MB). Peak memory consumption was 445.9MB. Max. memory is 8.0GB. [2023-11-17 18:42:22,910 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.54ms. Allocated memory is still 238.0MB. Free memory was 190.3MB in the beginning and 178.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.60ms. Allocated memory is still 238.0MB. Free memory was 178.9MB in the beginning and 176.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.45ms. Allocated memory is still 238.0MB. Free memory was 176.8MB in the beginning and 175.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 511.49ms. Allocated memory is still 238.0MB. Free memory was 175.5MB in the beginning and 158.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 514753.61ms. Allocated memory was 238.0MB in the beginning and 715.1MB in the end (delta: 477.1MB). Free memory was 158.0MB in the beginning and 374.4MB in the end (delta: -216.4MB). Peak memory consumption was 445.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7636, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 629, dependent conditional: 616, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7025, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7025, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 7, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1991, independent: 1977, independent conditional: 3, independent unconditional: 1974, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1991, independent: 1972, independent conditional: 0, independent unconditional: 1972, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 56, independent conditional: 13, independent unconditional: 43, dependent: 60, dependent conditional: 5, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7038, independent: 5030, independent conditional: 3, independent unconditional: 5027, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1991, unknown conditional: 4, unknown unconditional: 1987] , Statistics on independence cache: Total cache size (in pairs): 1991, Positive cache size: 1977, Positive conditional cache size: 3, Positive unconditional cache size: 1974, Negative cache size: 14, Negative conditional cache size: 1, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 611 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 154, Number of trivial persistent sets: 122, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2297, independent: 2284, independent conditional: 0, independent unconditional: 2284, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7636, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 629, dependent conditional: 616, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7025, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7025, independent: 7007, independent conditional: 4723, independent unconditional: 2284, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 7, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7038, independent: 7007, independent conditional: 6, independent unconditional: 7001, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1991, independent: 1977, independent conditional: 3, independent unconditional: 1974, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1991, independent: 1972, independent conditional: 0, independent unconditional: 1972, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 56, independent conditional: 13, independent unconditional: 43, dependent: 60, dependent conditional: 5, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7038, independent: 5030, independent conditional: 3, independent unconditional: 5027, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1991, unknown conditional: 4, unknown unconditional: 1987] , Statistics on independence cache: Total cache size (in pairs): 1991, Positive cache size: 1977, Positive conditional cache size: 3, Positive unconditional cache size: 1974, Negative cache size: 14, Negative conditional cache size: 1, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 611 - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 197 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 514.6s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 27.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 357, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 127.3s InterpolantComputationTime, 3058 NumberOfCodeBlocks, 3045 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4427 ConstructedInterpolants, 250 QuantifiedInterpolants, 75940 SizeOfPredicates, 189 NumberOfNonLiveVariables, 3037 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 883/2018 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown