/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 13:35:37,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 13:35:37,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 13:35:37,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 13:35:37,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 13:35:37,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 13:35:37,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 13:35:37,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 13:35:37,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 13:35:37,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 13:35:37,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 13:35:37,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 13:35:37,669 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 13:35:37,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 13:35:37,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 13:35:37,670 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 13:35:37,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 13:35:37,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 13:35:37,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 13:35:37,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 13:35:37,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 13:35:37,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 13:35:37,672 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 13:35:37,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 13:35:37,672 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 13:35:37,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 13:35:37,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 13:35:37,673 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 13:35:37,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 13:35:37,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:35:37,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 13:35:37,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 13:35:37,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 13:35:37,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 13:35:37,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 13:35:37,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 13:35:37,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 13:35:37,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 13:35:37,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 13:35:37,869 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 13:35:37,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-11-17 13:35:38,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 13:35:39,042 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 13:35:39,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-11-17 13:35:39,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fbe9f1a/b27013e9a4ed4b7c83130fc002475d89/FLAG34990d6a7 [2023-11-17 13:35:39,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fbe9f1a/b27013e9a4ed4b7c83130fc002475d89 [2023-11-17 13:35:39,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 13:35:39,068 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 13:35:39,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 13:35:39,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 13:35:39,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 13:35:39,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9b6e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39, skipping insertion in model container [2023-11-17 13:35:39,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,113 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 13:35:39,440 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-11-17 13:35:39,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:35:39,487 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 13:35:39,522 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-11-17 13:35:39,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:35:39,585 INFO L206 MainTranslator]: Completed translation [2023-11-17 13:35:39,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39 WrapperNode [2023-11-17 13:35:39,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 13:35:39,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 13:35:39,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 13:35:39,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 13:35:39,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,628 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 288 [2023-11-17 13:35:39,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 13:35:39,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 13:35:39,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 13:35:39,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 13:35:39,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 13:35:39,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 13:35:39,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 13:35:39,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 13:35:39,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (1/1) ... [2023-11-17 13:35:39,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:35:39,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:39,687 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 13:35:39,696 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 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 13:35:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-17 13:35:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-17 13:35:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 13:35:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 13:35:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 13:35:39,713 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 13:35:39,844 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 13:35:39,845 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 13:35:40,084 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 13:35:40,225 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 13:35:40,225 INFO L307 CfgBuilder]: Removed 35 assume(true) statements. [2023-11-17 13:35:40,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:35:40 BoogieIcfgContainer [2023-11-17 13:35:40,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 13:35:40,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 13:35:40,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 13:35:40,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 13:35:40,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:35:39" (1/3) ... [2023-11-17 13:35:40,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e4f7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:35:40, skipping insertion in model container [2023-11-17 13:35:40,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:35:39" (2/3) ... [2023-11-17 13:35:40,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e4f7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:35:40, skipping insertion in model container [2023-11-17 13:35:40,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:35:40" (3/3) ... [2023-11-17 13:35:40,233 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-11-17 13:35:40,241 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 13:35:40,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 13:35:40,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 13:35:40,247 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 13:35:40,285 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-17 13:35:40,320 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:35:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:35:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:40,323 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 13:35:40,326 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 13:35:40,349 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:35:40,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-11-17 13:35:40,360 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;@731ec9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:35:40,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 13:35:40,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:35:40,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:35:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash 860769476, now seen corresponding path program 1 times [2023-11-17 13:35:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:35:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011631035] [2023-11-17 13:35:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:35:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 13:35:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:35:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011631035] [2023-11-17 13:35:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011631035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:35:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:35:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:35:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785072411] [2023-11-17 13:35:40,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:35:40,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:35:40,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:35:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:35:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:35:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:40,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:35:40,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:35:40,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:40,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 13:35:40,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:35:40,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:35:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1670970868, now seen corresponding path program 1 times [2023-11-17 13:35:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:35:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612845060] [2023-11-17 13:35:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:35:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:35:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612845060] [2023-11-17 13:35:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612845060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:35:40,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204977456] [2023-11-17 13:35:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:40,872 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 13:35:40,873 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 13:35:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:40,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:35:40,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:35:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:41,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:35:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204977456] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:35:41,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:35:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:35:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124761520] [2023-11-17 13:35:41,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:35:41,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:35:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:35:41,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:35:41,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:35:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:41,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:35:41,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:35:41,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:41,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:35:41,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 13:35:41,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-17 13:35:41,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:35:41,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:35:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -746133236, now seen corresponding path program 2 times [2023-11-17 13:35:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:35:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082541320] [2023-11-17 13:35:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:35:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:35:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082541320] [2023-11-17 13:35:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082541320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:35:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570113553] [2023-11-17 13:35:41,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:35:41,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:41,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:41,405 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 13:35:41,424 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 13:35:41,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:35:41,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:35:41,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:35:41,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:35:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:41,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:35:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:35:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570113553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:35:41,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:35:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:35:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592745389] [2023-11-17 13:35:41,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:35:41,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:35:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:35:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:35:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:35:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:41,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:35:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:35:41,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:41,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:35:41,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:35:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:35:41,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 13:35:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:41,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:35:41,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:35:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1604302580, now seen corresponding path program 3 times [2023-11-17 13:35:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:35:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978643778] [2023-11-17 13:35:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:35:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:35:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:35:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978643778] [2023-11-17 13:35:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978643778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:35:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152668203] [2023-11-17 13:35:42,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 13:35:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:42,134 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 13:35:42,152 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 13:35:42,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 13:35:42,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:35:42,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 13:35:42,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:35:42,247 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 7 treesize of output 6 [2023-11-17 13:35:42,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:35:42,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:35:42,349 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 15 treesize of output 10 [2023-11-17 13:35:42,392 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 15 treesize of output 10 [2023-11-17 13:35:42,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-17 13:35:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:35:42,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:35:50,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_144 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_144) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-11-17 13:35:50,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_144 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_144) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-11-17 13:35:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-11-17 13:35:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152668203] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:35:50,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:35:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 13:35:50,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422168889] [2023-11-17 13:35:50,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:35:50,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 13:35:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:35:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 13:35:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2023-11-17 13:35:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:50,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:35:50,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:35:50,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:50,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:35:50,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:35:50,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:35:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:35:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:35:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:35:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:35:50,810 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 13:35:51,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:51,004 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:35:51,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:35:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash -865950165, now seen corresponding path program 1 times [2023-11-17 13:35:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:35:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084391655] [2023-11-17 13:35:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:35:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:35:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:35:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084391655] [2023-11-17 13:35:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084391655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:35:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147757977] [2023-11-17 13:35:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:35:52,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:35:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:35:52,285 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 13:35:52,313 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 13:35:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:35:52,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-17 13:35:52,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:35:52,391 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 7 treesize of output 6 [2023-11-17 13:35:52,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:35:52,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:35:52,464 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 15 treesize of output 10 [2023-11-17 13:35:52,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:35:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-17 13:35:52,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-17 13:35:52,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-17 13:35:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:35:52,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:36:06,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2023-11-17 13:36:12,907 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_241 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_241) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-11-17 13:36:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-11-17 13:36:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147757977] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:36:13,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:36:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 26 [2023-11-17 13:36:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077379768] [2023-11-17 13:36:13,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:36:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 13:36:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:36:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 13:36:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=5, NotChecked=94, Total=702 [2023-11-17 13:36:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:36:13,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:36:13,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.111111111111111) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:36:13,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:36:13,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:36:13,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:36:13,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:36:13,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:36:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:36:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:36:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:36:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:36:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 13:36:13,877 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 13:36:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:36:14,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:36:14,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:36:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 592597339, now seen corresponding path program 1 times [2023-11-17 13:36:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:36:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552763458] [2023-11-17 13:36:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:36:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:36:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:36:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:36:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:36:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552763458] [2023-11-17 13:36:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552763458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:36:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679843433] [2023-11-17 13:36:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:36:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:36:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:36:15,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:36:15,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 13:36:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:36:15,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-17 13:36:15,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:36:15,557 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 7 treesize of output 6 [2023-11-17 13:36:15,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:36:15,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:36:15,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:36:15,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-17 13:36:15,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-17 13:36:15,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-17 13:36:18,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-11-17 13:36:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-17 13:36:18,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:36:38,112 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2023-11-17 13:36:39,869 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_361 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_361) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2023-11-17 13:36:41,633 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_361 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_361) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2023-11-17 13:36:43,694 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_359 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_359 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_361) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2023-11-17 13:36:45,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_359 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| (+ v_ArrVal_359 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_361) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| 28)))) is different from false [2023-11-17 13:36:47,822 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_359 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_357) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| (+ v_ArrVal_359 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_361) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| 28)))) is different from false [2023-11-17 13:36:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 22 not checked. [2023-11-17 13:36:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679843433] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:36:47,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:36:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 32 [2023-11-17 13:36:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325479403] [2023-11-17 13:36:47,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:36:47,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 13:36:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:36:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 13:36:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=604, Unknown=10, NotChecked=330, Total=1056 [2023-11-17 13:36:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:36:47,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:36:47,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.545454545454546) internal successors, (150), 32 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-17 13:36:47,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:36:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:36:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:36:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:36:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:36:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 13:36:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 13:36:50,067 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 13:36:50,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:36:50,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:36:50,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:36:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1061445434, now seen corresponding path program 2 times [2023-11-17 13:36:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:36:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671571194] [2023-11-17 13:36:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:36:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:36:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:36:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:36:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:36:54,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671571194] [2023-11-17 13:36:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671571194] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:36:54,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876120809] [2023-11-17 13:36:54,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:36:54,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:36:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:36:54,933 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:36:54,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 13:36:55,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:36:55,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:36:55,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 13:36:55,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:36:55,079 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 7 treesize of output 6 [2023-11-17 13:36:55,147 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:36:55,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:36:55,177 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 15 treesize of output 10 [2023-11-17 13:36:55,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-17 13:36:55,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-17 13:37:00,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-17 13:37:03,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2023-11-17 13:37:13,046 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 70 treesize of output 57 [2023-11-17 13:37:34,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2023-11-17 13:37:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-17 13:37:34,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:09,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0))) is different from false [2023-11-17 13:38:11,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0))) is different from false [2023-11-17 13:38:13,064 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 13:38:15,100 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_509 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0))) is different from false [2023-11-17 13:38:17,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0)))) is different from false [2023-11-17 13:38:19,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_30| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_30| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_30| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2023-11-17 13:38:21,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (|v_t_funThread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_30| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_30| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 13:38:23,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (|v_t_funThread1of1ForFork0_~i~0#1_30| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_506 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_30| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_30| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_506 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 13:38:25,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_512 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_509 Int) (v_ArrVal_506 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ v_ArrVal_506 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0))) is different from false [2023-11-17 13:38:25,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_512 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_509 Int) (v_ArrVal_506 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ v_ArrVal_506 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_509 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_512) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))) is different from false [2023-11-17 13:38:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 49 not checked. [2023-11-17 13:38:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876120809] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:26,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 49 [2023-11-17 13:38:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067841158] [2023-11-17 13:38:26,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:26,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 13:38:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 13:38:26,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1354, Unknown=51, NotChecked=850, Total=2450 [2023-11-17 13:38:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:26,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:26,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.2) internal successors, (210), 49 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-17 13:38:26,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:33,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 13:38:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:38:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 13:38:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 13:38:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-17 13:38:37,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:38,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:38,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:38,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 102097875, now seen corresponding path program 3 times [2023-11-17 13:38:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380356604] [2023-11-17 13:38:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:44:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:44:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:44:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380356604] [2023-11-17 13:44:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380356604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:44:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825690575] [2023-11-17 13:44:37,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 13:44:37,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:44:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:44:37,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:44:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 13:44:38,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 13:44:38,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:44:38,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-17 13:44:38,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:44:38,089 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 7 treesize of output 6 [2023-11-17 13:44:38,292 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-17 13:44:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-17 13:44:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:44:38,680 INFO L349 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-11-17 13:44:38,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2023-11-17 13:44:38,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2023-11-17 13:44:38,985 INFO L349 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-11-17 13:44:38,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2023-11-17 13:44:39,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2023-11-17 13:44:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-17 13:44:39,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-17 13:44:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-17 13:44:49,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 Received shutdown request... [2023-11-17 13:44:55,887 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:44:55,918 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 13:44:55,918 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 13:44:56,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 13:44:56,926 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 13:44:57,119 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 13:44:57,135 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 13:44:57,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 13:44:57,136 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 118 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-11-17 13:44:57,139 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2023-11-17 13:44:57,140 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-11-17 13:44:57,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 13:44:57,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 13:44:57,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 01:44:57 BasicIcfg [2023-11-17 13:44:57,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 13:44:57,144 INFO L158 Benchmark]: Toolchain (without parser) took 558075.68ms. Allocated memory was 198.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 152.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 13:44:57,144 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 13:44:57,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.74ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 122.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 13:44:57,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 198.2MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 13:44:57,144 INFO L158 Benchmark]: Boogie Preprocessor took 30.59ms. Allocated memory is still 198.2MB. Free memory was 119.4MB in the beginning and 117.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 13:44:57,144 INFO L158 Benchmark]: RCFGBuilder took 566.92ms. Allocated memory is still 198.2MB. Free memory was 117.3MB in the beginning and 154.8MB in the end (delta: -37.5MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2023-11-17 13:44:57,145 INFO L158 Benchmark]: TraceAbstraction took 556915.61ms. Allocated memory was 198.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 154.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 13:44:57,145 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-11-17 13:44:57,148 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 Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.74ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 122.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 198.2MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.59ms. Allocated memory is still 198.2MB. Free memory was 119.4MB in the beginning and 117.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 566.92ms. Allocated memory is still 198.2MB. Free memory was 117.3MB in the beginning and 154.8MB in the end (delta: -37.5MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. * TraceAbstraction took 556915.61ms. Allocated memory was 198.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 154.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4935, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 694, dependent conditional: 659, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4279, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 38, dependent conditional: 3, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4279, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 38, dependent conditional: 3, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2902, independent: 2863, independent conditional: 19, independent unconditional: 2844, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2902, independent: 2823, independent conditional: 0, independent unconditional: 2823, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 40, independent conditional: 19, independent unconditional: 21, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 40, independent conditional: 19, independent unconditional: 21, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 127, independent conditional: 70, independent unconditional: 56, dependent: 96, dependent conditional: 19, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4303, independent: 1378, independent conditional: 0, independent unconditional: 1378, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 2902, unknown conditional: 23, unknown unconditional: 2879] , Statistics on independence cache: Total cache size (in pairs): 2902, Positive cache size: 2863, Positive conditional cache size: 19, Positive unconditional cache size: 2844, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2, Independence queries for same thread: 656 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 89, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2914, independent: 2879, independent conditional: 0, independent unconditional: 2879, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4935, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 694, dependent conditional: 659, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4279, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 38, dependent conditional: 3, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4279, independent: 4241, independent conditional: 1362, independent unconditional: 2879, dependent: 38, dependent conditional: 3, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4303, independent: 4241, independent conditional: 19, independent unconditional: 4222, dependent: 62, dependent conditional: 5, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2902, independent: 2863, independent conditional: 19, independent unconditional: 2844, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2902, independent: 2823, independent conditional: 0, independent unconditional: 2823, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 40, independent conditional: 19, independent unconditional: 21, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 40, independent conditional: 19, independent unconditional: 21, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 127, independent conditional: 70, independent unconditional: 56, dependent: 96, dependent conditional: 19, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4303, independent: 1378, independent conditional: 0, independent unconditional: 1378, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 2902, unknown conditional: 23, unknown unconditional: 2879] , Statistics on independence cache: Total cache size (in pairs): 2902, Positive cache size: 2863, Positive conditional cache size: 19, Positive unconditional cache size: 2844, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2, Independence queries for same thread: 656 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 118 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 129 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 556.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 15.2s, 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: 103, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 160.5s InterpolantComputationTime, 537 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 775 ConstructedInterpolants, 260 QuantifiedInterpolants, 32933 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1461 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 691/975 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