/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 17:37:17,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 17:37:17,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 17:37:17,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 17:37:17,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 17:37:17,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 17:37:17,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 17:37:17,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 17:37:17,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 17:37:17,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 17:37:17,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 17:37:17,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 17:37:17,885 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 17:37:17,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 17:37:17,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 17:37:17,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 17:37:17,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 17:37:17,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 17:37:17,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 17:37:17,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 17:37:17,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 17:37:17,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 17:37:17,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 17:37:17,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 17:37:17,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 17:37:17,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 17:37:17,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 17:37:17,889 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 17:37:17,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 17:37:17,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 17:37:17,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 17:37:17,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 17:37:17,891 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 17:37:17,891 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 17:37:17,891 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 17:37:17,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP [2023-11-17 17:37:18,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 17:37:18,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 17:37:18,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 17:37:18,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 17:37:18,101 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 17:37:18,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-11-17 17:37:19,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 17:37:19,698 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 17:37:19,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-11-17 17:37:19,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27292639a/6a17a4d432ec454985204d723bbd612c/FLAG17070deac [2023-11-17 17:37:19,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27292639a/6a17a4d432ec454985204d723bbd612c [2023-11-17 17:37:19,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 17:37:19,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 17:37:19,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 17:37:19,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 17:37:19,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 17:37:19,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:37:19" (1/1) ... [2023-11-17 17:37:19,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c609c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:19, skipping insertion in model container [2023-11-17 17:37:19,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:37:19" (1/1) ... [2023-11-17 17:37:19,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 17:37:20,253 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_73-funloop_hard_racefree.i[41323,41336] [2023-11-17 17:37:20,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 17:37:20,319 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 17:37:20,350 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_73-funloop_hard_racefree.i[41323,41336] [2023-11-17 17:37:20,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 17:37:20,424 INFO L206 MainTranslator]: Completed translation [2023-11-17 17:37:20,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20 WrapperNode [2023-11-17 17:37:20,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 17:37:20,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 17:37:20,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 17:37:20,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 17:37:20,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,498 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 288 [2023-11-17 17:37:20,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 17:37:20,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 17:37:20,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 17:37:20,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 17:37:20,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 17:37:20,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 17:37:20,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 17:37:20,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 17:37:20,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (1/1) ... [2023-11-17 17:37:20,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 17:37:20,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:37:20,589 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 17:37:20,609 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 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 17:37:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 17:37:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-17 17:37:20,639 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-17 17:37:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 17:37:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 17:37:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 17:37:20,644 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 17:37:20,839 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 17:37:20,841 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 17:37:21,233 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 17:37:21,316 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 17:37:21,316 INFO L307 CfgBuilder]: Removed 35 assume(true) statements. [2023-11-17 17:37:21,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 05:37:21 BoogieIcfgContainer [2023-11-17 17:37:21,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 17:37:21,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 17:37:21,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 17:37:21,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 17:37:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:37:19" (1/3) ... [2023-11-17 17:37:21,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77649846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:37:21, skipping insertion in model container [2023-11-17 17:37:21,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:37:20" (2/3) ... [2023-11-17 17:37:21,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77649846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:37:21, skipping insertion in model container [2023-11-17 17:37:21,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 05:37:21" (3/3) ... [2023-11-17 17:37:21,328 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-11-17 17:37:21,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 17:37:21,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 17:37:21,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 17:37:21,344 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 17:37:21,420 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-17 17:37:21,464 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 17:37:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 17:37:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:37:21,491 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 17:37:21,491 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 17:37:21,517 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 17:37:21,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-11-17 17:37:21,533 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;@72a99a14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 17:37:21,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 17:37:21,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:37:21,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:37:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash 951077958, now seen corresponding path program 1 times [2023-11-17 17:37:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:37:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477018447] [2023-11-17 17:37:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:37:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:37:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:37:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-17 17:37:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:37:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477018447] [2023-11-17 17:37:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477018447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 17:37:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 17:37:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 17:37:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926228812] [2023-11-17 17:37:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 17:37:22,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 17:37:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:37:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 17:37:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 17:37:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:22,210 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:37:22,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 17:37:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 17:37:22,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:37:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:37:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -580020877, now seen corresponding path program 1 times [2023-11-17 17:37:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:37:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402976984] [2023-11-17 17:37:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:37:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:37:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:37:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:37:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402976984] [2023-11-17 17:37:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402976984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 17:37:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242581483] [2023-11-17 17:37:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:37:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 17:37:22,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:37:22,639 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 17:37:22,652 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 17:37:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:37:22,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-17 17:37:22,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 17:37:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:22,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 17:37:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242581483] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 17:37:22,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 17:37:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-17 17:37:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744773018] [2023-11-17 17:37:22,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 17:37:22,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 17:37:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:37:22,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 17:37:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-17 17:37:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:22,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:37:22,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 17:37:22,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:22,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:37:23,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 17:37:23,231 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 17:37:23,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:37:23,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:37:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1320197165, now seen corresponding path program 2 times [2023-11-17 17:37:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:37:23,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914617856] [2023-11-17 17:37:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:37:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:37:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:37:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:37:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914617856] [2023-11-17 17:37:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914617856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 17:37:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311758301] [2023-11-17 17:37:23,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 17:37:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 17:37:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:37:23,579 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 17:37:23,605 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 17:37:23,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 17:37:23,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 17:37:23,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 17:37:23,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 17:37:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:23,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 17:37:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311758301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 17:37:23,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 17:37:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-17 17:37:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586526273] [2023-11-17 17:37:23,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 17:37:23,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 17:37:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:37:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 17:37:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-17 17:37:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:23,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:37:23,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 18 states have internal predecessors, (125), 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 17:37:23,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:23,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:37:23,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:37:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:37:24,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 17:37:24,329 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 17:37:24,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:37:24,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:37:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1512728429, now seen corresponding path program 3 times [2023-11-17 17:37:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:37:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529566421] [2023-11-17 17:37:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:37:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:37:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:37:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-17 17:37:24,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:37:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529566421] [2023-11-17 17:37:24,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529566421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 17:37:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806739844] [2023-11-17 17:37:24,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 17:37:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 17:37:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:37:24,707 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 17:37:24,717 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 17:37:24,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 17:37:24,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 17:37:24,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 17:37:24,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 17:37:24,935 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 17:37:25,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 17:37:25,228 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 17:37:25,277 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 17:37:25,617 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 17:37:25,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-17 17:37:25,831 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 17:37:29,957 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 21 treesize of output 15 [2023-11-17 17:37:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-17 17:37:30,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 17:37:40,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_#t~post45#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)))) is different from false [2023-11-17 17:37:41,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:37:43,854 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (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| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:37:43,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_234 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:37:43,974 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (v_ArrVal_232 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_234 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (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_232)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:37:44,127 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (v_ArrVal_232 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_234 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| v_ArrVal_232)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:37:44,152 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (v_ArrVal_232 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_234 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 28)) (= (select (store (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_39| v_ArrVal_232)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2023-11-17 17:37:44,202 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (v_ArrVal_232 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 28)) (= (select (store (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_231) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| v_ArrVal_232)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_234) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2023-11-17 17:37:44,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 17:37:44,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-17 17:37:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 14 not checked. [2023-11-17 17:37:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806739844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 17:37:45,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 17:37:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 50 [2023-11-17 17:37:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209703007] [2023-11-17 17:37:45,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 17:37:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 17:37:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:37:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 17:37:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1554, Unknown=13, NotChecked=696, Total=2450 [2023-11-17 17:37:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:45,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:37:45,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.1) internal successors, (305), 50 states have internal predecessors, (305), 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 17:37:45,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:37:45,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:37:45,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:37:45,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:37:47,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:38:52,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:39:03,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:39:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:39:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:39:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:39:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 17:39:57,166 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 17:39:57,358 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 17:39:57,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:39:57,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:39:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1407053467, now seen corresponding path program 4 times [2023-11-17 17:39:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:39:57,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743129350] [2023-11-17 17:39:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:39:57,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:39:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:39:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-17 17:39:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:39:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743129350] [2023-11-17 17:39:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743129350] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 17:39:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512661933] [2023-11-17 17:39:57,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 17:39:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 17:39:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:39:57,874 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 17:39:57,876 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 17:39:58,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 17:39:58,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 17:39:58,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 17:39:58,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 17:39:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-17 17:39:58,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 17:39:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-17 17:39:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512661933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 17:39:58,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 17:39:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2023-11-17 17:39:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780556944] [2023-11-17 17:39:58,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 17:39:58,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 17:39:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:39:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 17:39:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-11-17 17:39:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:39:58,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:39:58,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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 17:39:58,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:39:58,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:39:58,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:39:58,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 17:39:58,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:39:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:39:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:39:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:39:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 17:39:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-17 17:39:58,570 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 17:39:58,767 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 17:39:58,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 17:39:58,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 17:39:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -258972613, now seen corresponding path program 5 times [2023-11-17 17:39:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 17:39:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637001648] [2023-11-17 17:39:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 17:39:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 17:39:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 17:40:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-17 17:40:01,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 17:40:01,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637001648] [2023-11-17 17:40:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637001648] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 17:40:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325425696] [2023-11-17 17:40:01,551 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 17:40:01,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 17:40:01,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 17:40:01,557 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 17:40:01,562 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 17:40:01,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-11-17 17:40:01,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 17:40:01,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-17 17:40:01,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 17:40:02,013 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 17:40:02,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 17:40:02,309 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 17:40:02,336 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 17:40:02,606 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 17:40:02,712 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 17:40:02,805 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 17:40:09,092 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 17:40:14,341 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 70 treesize of output 57 [2023-11-17 17:40:56,553 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 63 treesize of output 51 [2023-11-17 17:40:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-17 17:40:56,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 17:41:59,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_#t~post45#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-17 17:42:01,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |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_54|) 0))) is different from false [2023-11-17 17:42:03,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (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| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2023-11-17 17:42:05,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-11-17 17:42:07,314 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) is different from false [2023-11-17 17:42:09,362 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_#t~post45#1| 1)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2023-11-17 17:42:11,394 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 17:42:12,526 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (= (select (store (select (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| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 17:42:14,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_484 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 17:42:14,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_483 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_484 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (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_483)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 17:42:15,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_483 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_484 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60|) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| v_ArrVal_483)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-17 17:42:15,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_483 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60|)) (= (select (store (store (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_60| v_ArrVal_483)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28)))) is different from false [2023-11-17 17:42:15,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28)) (= 0 (select (store (store (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_481) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| v_ArrVal_483)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_484) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_48|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)))) is different from false [2023-11-17 17:42:16,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 17:42:16,666 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 17:42:16,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-17 17:42:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 63 not checked. [2023-11-17 17:42:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325425696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 17:42:16,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 17:42:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 60 [2023-11-17 17:42:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125542774] [2023-11-17 17:42:16,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 17:42:16,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-17 17:42:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:42:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-17 17:42:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1853, Unknown=68, NotChecked=1326, Total=3540 [2023-11-17 17:42:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:42:16,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:42:16,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.183333333333334) internal successors, (371), 60 states have internal predecessors, (371), 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 17:42:16,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:42:16,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:42:16,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:42:16,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 17:42:16,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-17 17:42:16,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:42:19,025 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 17:42:21,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:23,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:25,092 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 17:42:27,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:28,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:30,673 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 17:42:32,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:34,684 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 17:42:36,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:39,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:41,928 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 17:42:43,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:45,456 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 17:42:47,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:49,292 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 17:42:50,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:52,894 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 17:42:54,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:42:56,694 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 17:42:58,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:00,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:02,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:04,320 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 17:43:05,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:07,839 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 17:43:09,844 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 17:43:11,849 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 17:43:13,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:15,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:17,171 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 17:43:19,175 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 17:43:20,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:22,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:24,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:26,470 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 17:43:27,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:29,952 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 17:43:31,956 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 17:43:33,962 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 17:43:35,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:37,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:39,457 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 17:43:41,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:42,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:44,935 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 17:43:46,939 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 17:43:48,952 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 17:43:50,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:43:52,710 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 17:43:54,716 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 17:44:04,608 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 17:44:05,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:07,988 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 17:44:09,992 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 17:44:11,996 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 17:44:13,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:15,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:17,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:19,312 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 17:44:20,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:22,768 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 17:44:24,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:26,558 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 17:44:28,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:30,009 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 17:44:32,013 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 17:44:34,026 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 17:44:36,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:38,126 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 17:44:40,142 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 17:44:50,079 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 17:44:51,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:53,664 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 17:44:55,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:57,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:44:59,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:01,197 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 17:45:03,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:05,207 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 17:45:07,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:08,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:10,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:12,862 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 17:45:14,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:16,707 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 17:45:18,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:20,757 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 17:45:24,823 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 17:45:26,831 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 17:45:28,836 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 17:45:30,851 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 17:45:34,919 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 17:45:36,924 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 17:45:38,947 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 17:45:43,002 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 17:45:45,014 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 17:45:47,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:49,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:51,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:53,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:55,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:45:57,057 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 17:46:01,085 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 17:46:03,091 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 17:46:05,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:46:07,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:46:09,124 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 17:46:11,129 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 17:46:13,133 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 17:46:15,139 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 17:46:17,150 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 17:46:19,155 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 17:46:21,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 17:46:23,283 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] Received shutdown request... [2023-11-17 17:46:50,053 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 17:46:50,053 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 17:46:50,053 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 17:46:50,805 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 17:46:50,999 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 17:46:51,000 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 75 known predicates. [2023-11-17 17:46:51,002 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 17:46:51,006 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1] [2023-11-17 17:46:51,007 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-11-17 17:46:51,008 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 17:46:51,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 17:46:51,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:46:51 BasicIcfg [2023-11-17 17:46:51,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 17:46:51,010 INFO L158 Benchmark]: Toolchain (without parser) took 571270.36ms. Allocated memory was 288.4MB in the beginning and 371.2MB in the end (delta: 82.8MB). Free memory was 250.4MB in the beginning and 214.7MB in the end (delta: 35.7MB). Peak memory consumption was 119.0MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,010 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 17:46:51,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 683.81ms. Allocated memory is still 288.4MB. Free memory was 249.9MB in the beginning and 220.0MB in the end (delta: 30.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.53ms. Allocated memory is still 288.4MB. Free memory was 220.0MB in the beginning and 217.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,011 INFO L158 Benchmark]: Boogie Preprocessor took 47.73ms. Allocated memory is still 288.4MB. Free memory was 217.3MB in the beginning and 214.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,011 INFO L158 Benchmark]: RCFGBuilder took 770.51ms. Allocated memory is still 288.4MB. Free memory was 214.7MB in the beginning and 187.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,011 INFO L158 Benchmark]: TraceAbstraction took 569690.29ms. Allocated memory was 288.4MB in the beginning and 371.2MB in the end (delta: 82.8MB). Free memory was 186.9MB in the beginning and 214.7MB in the end (delta: -27.8MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2023-11-17 17:46:51,012 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 683.81ms. Allocated memory is still 288.4MB. Free memory was 249.9MB in the beginning and 220.0MB in the end (delta: 30.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.53ms. Allocated memory is still 288.4MB. Free memory was 220.0MB in the beginning and 217.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.73ms. Allocated memory is still 288.4MB. Free memory was 217.3MB in the beginning and 214.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 770.51ms. Allocated memory is still 288.4MB. Free memory was 214.7MB in the beginning and 187.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 569690.29ms. Allocated memory was 288.4MB in the beginning and 371.2MB in the end (delta: 82.8MB). Free memory was 186.9MB in the beginning and 214.7MB in the end (delta: -27.8MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8328, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 439, dependent conditional: 416, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6277, independent: 6254, independent conditional: 0, independent unconditional: 6254, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6277, independent: 6238, independent conditional: 0, independent unconditional: 6238, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7912, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6277, unknown conditional: 0, unknown unconditional: 6277] , Statistics on independence cache: Total cache size (in pairs): 6277, Positive cache size: 6254, Positive conditional cache size: 0, Positive unconditional cache size: 6254, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 416 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 161, Number of trivial persistent sets: 116, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7488, independent: 7465, independent conditional: 0, independent unconditional: 7465, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8328, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 439, dependent conditional: 416, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 424, independent unconditional: 7465, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7912, independent: 7889, independent conditional: 0, independent unconditional: 7889, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6277, independent: 6254, independent conditional: 0, independent unconditional: 6254, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6277, independent: 6238, independent conditional: 0, independent unconditional: 6238, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7912, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6277, unknown conditional: 0, unknown unconditional: 6277] , Statistics on independence cache: Total cache size (in pairs): 6277, Positive cache size: 6254, Positive conditional cache size: 0, Positive unconditional cache size: 6254, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 416 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 288 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 569.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 406.8s, 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: 122, 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.7s SatisfiabilityAnalysisTime, 160.1s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1499 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2261 ConstructedInterpolants, 360 QuantifiedInterpolants, 30333 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 1288/2114 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