/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 23:39:16,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 23:39:16,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 23:39:16,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 23:39:16,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 23:39:16,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 23:39:16,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 23:39:16,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 23:39:16,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 23:39:16,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 23:39:16,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 23:39:16,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 23:39:16,176 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 23:39:16,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 23:39:16,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 23:39:16,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 23:39:16,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 23:39:16,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 23:39:16,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 23:39:16,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 23:39:16,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 23:39:16,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 23:39:16,180 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 23:39:16,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 23:39:16,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 23:39:16,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 23:39:16,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 23:39:16,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-05-30 23:39:16,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 23:39:16,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 23:39:16,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 23:39:16,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 23:39:16,402 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 23:39:16,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-30 23:39:17,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 23:39:17,522 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 23:39:17,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-30 23:39:17,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdc64638c/a924072f96ee4d2a85a175b512a1764a/FLAGe933a77f3 [2024-05-30 23:39:17,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdc64638c/a924072f96ee4d2a85a175b512a1764a [2024-05-30 23:39:17,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 23:39:17,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 23:39:17,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 23:39:17,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 23:39:17,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 23:39:17,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a517a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17, skipping insertion in model container [2024-05-30 23:39:17,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 23:39:17,704 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-30 23:39:17,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 23:39:17,722 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 23:39:17,751 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-30 23:39:17,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 23:39:17,781 INFO L206 MainTranslator]: Completed translation [2024-05-30 23:39:17,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17 WrapperNode [2024-05-30 23:39:17,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 23:39:17,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 23:39:17,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 23:39:17,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 23:39:17,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,824 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-05-30 23:39:17,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 23:39:17,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 23:39:17,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 23:39:17,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 23:39:17,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 23:39:17,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 23:39:17,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 23:39:17,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 23:39:17,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (1/1) ... [2024-05-30 23:39:17,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 23:39:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:17,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 23:39:17,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 23:39:17,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 23:39:17,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 23:39:17,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 23:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 23:39:17,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 23:39:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 23:39:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 23:39:17,934 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 23:39:18,024 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 23:39:18,026 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 23:39:18,309 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 23:39:18,321 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 23:39:18,321 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 23:39:18,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 11:39:18 BoogieIcfgContainer [2024-05-30 23:39:18,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 23:39:18,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 23:39:18,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 23:39:18,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 23:39:18,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 11:39:17" (1/3) ... [2024-05-30 23:39:18,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e5f321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 11:39:18, skipping insertion in model container [2024-05-30 23:39:18,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:39:17" (2/3) ... [2024-05-30 23:39:18,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e5f321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 11:39:18, skipping insertion in model container [2024-05-30 23:39:18,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 11:39:18" (3/3) ... [2024-05-30 23:39:18,327 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-05-30 23:39:18,333 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 23:39:18,340 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 23:39:18,340 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 23:39:18,340 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 23:39:18,386 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 23:39:18,418 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 23:39:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 23:39:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:18,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 23:39:18,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 23:39:18,449 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 23:39:18,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 23:39:18,459 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;@272b5444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 23:39:18,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 23:39:18,677 INFO L78 Accepts]: Start accepts. Automaton has currently 738 states, but on-demand construction may add more states Word has length 100 [2024-05-30 23:39:18,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:18,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:18,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1566695842, now seen corresponding path program 1 times [2024-05-30 23:39:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731466720] [2024-05-30 23:39:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:39:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731466720] [2024-05-30 23:39:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731466720] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:39:18,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:39:18,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 23:39:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476619495] [2024-05-30 23:39:18,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:39:18,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 23:39:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:18,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 23:39:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 23:39:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:18,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:18,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:18,960 INFO L78 Accepts]: Start accepts. Automaton has currently 738 states, but on-demand construction may add more states Word has length 95 [2024-05-30 23:39:18,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:18,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 23:39:18,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:18,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1119003591, now seen corresponding path program 1 times [2024-05-30 23:39:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11320754] [2024-05-30 23:39:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:39:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11320754] [2024-05-30 23:39:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11320754] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:39:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:39:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 23:39:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616592988] [2024-05-30 23:39:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:39:19,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 23:39:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 23:39:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-30 23:39:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:19,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:19,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:19,425 INFO L78 Accepts]: Start accepts. Automaton has currently 745 states, but on-demand construction may add more states Word has length 103 [2024-05-30 23:39:19,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:19,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 23:39:19,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:19,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash -688973404, now seen corresponding path program 1 times [2024-05-30 23:39:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100955382] [2024-05-30 23:39:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:39:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100955382] [2024-05-30 23:39:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100955382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:39:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:39:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 23:39:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547108019] [2024-05-30 23:39:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:39:19,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 23:39:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 23:39:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 23:39:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:19,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:19,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:19,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:19,829 INFO L78 Accepts]: Start accepts. Automaton has currently 653 states, but on-demand construction may add more states Word has length 116 [2024-05-30 23:39:19,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:19,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 23:39:19,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:19,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1997832491, now seen corresponding path program 1 times [2024-05-30 23:39:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269015686] [2024-05-30 23:39:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:39:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269015686] [2024-05-30 23:39:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269015686] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:39:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819145172] [2024-05-30 23:39:20,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:20,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:20,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:20,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:39:20,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 23:39:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:20,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 23:39:20,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:39:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:39:20,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:39:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:39:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819145172] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 23:39:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 23:39:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-05-30 23:39:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745846561] [2024-05-30 23:39:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:39:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 23:39:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 23:39:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-30 23:39:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:20,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:20,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:20,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:20,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:20,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:20,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:39:20,390 INFO L78 Accepts]: Start accepts. Automaton has currently 660 states, but on-demand construction may add more states Word has length 153 [2024-05-30 23:39:20,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:20,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 23:39:20,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:20,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:20,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 783855516, now seen corresponding path program 1 times [2024-05-30 23:39:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706888805] [2024-05-30 23:39:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 23:39:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706888805] [2024-05-30 23:39:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706888805] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:39:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010181954] [2024-05-30 23:39:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:21,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:21,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:21,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:39:21,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 23:39:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:21,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-30 23:39:21,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:39:21,718 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 15 treesize of output 7 [2024-05-30 23:39:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:39:21,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:39:22,200 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 23:39:22,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-30 23:39:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:39:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010181954] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:39:22,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:39:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2024-05-30 23:39:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350980516] [2024-05-30 23:39:22,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:39:22,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-30 23:39:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-30 23:39:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-05-30 23:39:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:22,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:22,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.222222222222221) internal successors, (404), 36 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:22,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:22,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:22,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:22,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:39:22,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:39:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:39:24,191 INFO L78 Accepts]: Start accepts. Automaton has currently 875 states, but on-demand construction may add more states Word has length 174 [2024-05-30 23:39:24,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 23:39:24,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:24,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:24,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash -569130302, now seen corresponding path program 2 times [2024-05-30 23:39:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48923624] [2024-05-30 23:39:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-30 23:39:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48923624] [2024-05-30 23:39:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48923624] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:39:24,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789097768] [2024-05-30 23:39:24,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 23:39:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:24,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:39:25,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 23:39:25,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 23:39:25,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:39:25,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 23:39:25,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:39:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-30 23:39:25,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:39:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-30 23:39:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789097768] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:39:26,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:39:26,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2024-05-30 23:39:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689926496] [2024-05-30 23:39:26,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:39:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-30 23:39:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:39:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-30 23:39:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-05-30 23:39:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:26,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:39:26,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.166666666666666) internal successors, (245), 30 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:39:26,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:39:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:39:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:39:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:39:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:39:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:39:28,506 INFO L78 Accepts]: Start accepts. Automaton has currently 548 states, but on-demand construction may add more states Word has length 213 [2024-05-30 23:39:28,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:39:28,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 23:39:28,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:28,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:39:28,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:39:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1095653113, now seen corresponding path program 3 times [2024-05-30 23:39:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:39:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376220516] [2024-05-30 23:39:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:39:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:39:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:39:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 23:39:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:39:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376220516] [2024-05-30 23:39:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376220516] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:39:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250923100] [2024-05-30 23:39:29,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 23:39:29,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:39:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:39:29,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:39:29,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 23:39:29,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-30 23:39:29,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:39:29,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 91 conjunts are in the unsatisfiable core [2024-05-30 23:39:29,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:39:30,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-30 23:39:30,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 23:39:30,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 23:39:33,596 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2024-05-30 23:39:33,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 88 [2024-05-30 23:39:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:39:33,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:39:40,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:39:40,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 704 treesize of output 404 [2024-05-30 23:39:40,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:39:40,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2052 treesize of output 1956 [2024-05-30 23:39:40,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:39:40,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 473 [2024-05-30 23:39:47,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:39:47,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 316 treesize of output 480 [2024-05-30 23:40:24,178 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 23:40:33,498 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 23:40:47,106 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 23:41:31,817 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 23:41:32,713 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 23:41:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:41:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250923100] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:41:39,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:41:39,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 48, 44] total 103 [2024-05-30 23:41:39,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106664593] [2024-05-30 23:41:39,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:41:39,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-05-30 23:41:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:41:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-05-30 23:41:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=9915, Unknown=59, NotChecked=0, Total=10506 [2024-05-30 23:41:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:41:39,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:41:39,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 5.87378640776699) internal successors, (605), 103 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:41:39,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:41:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:41:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-30 23:41:54,891 INFO L78 Accepts]: Start accepts. Automaton has currently 705 states, but on-demand construction may add more states Word has length 258 [2024-05-30 23:41:54,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:41:54,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 23:41:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-30 23:41:55,098 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:41:55,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:41:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash -609926049, now seen corresponding path program 4 times [2024-05-30 23:41:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:41:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335193760] [2024-05-30 23:41:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:41:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:41:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:42:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-05-30 23:42:03,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:42:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335193760] [2024-05-30 23:42:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335193760] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:42:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687392034] [2024-05-30 23:42:03,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 23:42:03,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:42:03,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:42:03,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:42:03,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 23:42:04,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 23:42:04,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:42:04,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-30 23:42:04,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:42:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-30 23:42:17,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:42:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-30 23:42:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687392034] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:42:24,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:42:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 47 [2024-05-30 23:42:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905920185] [2024-05-30 23:42:24,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:42:24,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-05-30 23:42:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:42:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-05-30 23:42:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1859, Unknown=6, NotChecked=0, Total=2162 [2024-05-30 23:42:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:42:24,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:42:24,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.51063829787234) internal successors, (353), 47 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-30 23:42:24,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:42:37,341 WARN L293 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 74 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:42:44,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 23:42:47,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 23:43:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:43:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:43:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:43:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:43:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:43:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:43:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-30 23:43:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 23:43:54,790 INFO L78 Accepts]: Start accepts. Automaton has currently 1372 states, but on-demand construction may add more states Word has length 336 [2024-05-30 23:43:54,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:43:54,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 23:43:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:43:54,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:43:54,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:43:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1316853759, now seen corresponding path program 5 times [2024-05-30 23:43:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:43:55,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426530656] [2024-05-30 23:43:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:43:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:43:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:43:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-30 23:43:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:43:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426530656] [2024-05-30 23:43:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426530656] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:43:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511243524] [2024-05-30 23:43:56,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 23:43:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:43:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:43:56,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:43:56,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 23:44:10,611 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-05-30 23:44:10,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:44:10,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-30 23:44:10,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:44:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 635 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-05-30 23:44:11,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:46:58,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) is different from false [2024-05-30 23:47:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 547 refuted. 78 times theorem prover too weak. 157 trivial. 10 not checked. [2024-05-30 23:47:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511243524] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:47:31,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:47:31,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 56 [2024-05-30 23:47:31,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51320822] [2024-05-30 23:47:31,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:47:31,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-05-30 23:47:31,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:47:31,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-05-30 23:47:31,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2680, Unknown=90, NotChecked=106, Total=3080 [2024-05-30 23:47:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:47:31,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:47:31,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 7.803571428571429) internal successors, (437), 56 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-30 23:47:31,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 23:47:31,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:47:36,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (and (<= .cse0 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= 6 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) (+ .cse5 (* .cse0 4294967296)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse7 (* 8589934593 v_z_2))) (< (+ (* (div .cse7 4294967296) 4294967296) 6) .cse7)) (< v_z_2 (+ (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))))) is different from false [2024-05-30 23:47:38,768 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-30 23:47:40,779 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-30 23:47:42,810 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2024-05-30 23:47:44,837 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-30 23:47:46,856 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-30 23:47:48,877 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-05-30 23:47:50,891 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-30 23:50:36,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:38,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:42,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:44,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:46,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:48,445 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-30 23:50:50,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:52,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:54,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:56,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:50:58,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:00,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:02,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:04,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:06,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:08,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:10,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:12,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:14,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:16,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:18,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:20,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:22,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:24,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:26,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:28,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:30,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:32,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:34,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:36,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:38,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:40,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:42,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:44,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:46,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:51:48,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:12,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:14,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:16,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:18,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:20,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:22,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:24,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:26,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:28,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:30,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:32,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:34,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:36,049 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 [1] [2024-05-30 23:52:38,056 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 [1] [2024-05-30 23:52:40,074 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 [1] [2024-05-30 23:52:42,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:44,129 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 [1] [2024-05-30 23:52:46,134 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 [1] [2024-05-30 23:52:48,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:52,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:54,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:56,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:52:58,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:00,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:02,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:04,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:06,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:08,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:10,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:12,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:14,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:16,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:18,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:20,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:22,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:24,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:26,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:53:28,369 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) .cse5)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-30 23:53:30,383 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-05-30 23:53:32,399 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false Received shutdown request... [2024-05-30 23:53:38,340 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 23:53:38,340 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 23:53:38,340 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-30 23:53:38,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 23:53:38,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-30 23:53:38,897 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 121 known predicates. [2024-05-30 23:53:38,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 23:53:38,903 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-05-30 23:53:38,904 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 23:53:38,905 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 23:53:38,905 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 23:53:38,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 11:53:38 BasicIcfg [2024-05-30 23:53:38,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 23:53:38,907 INFO L158 Benchmark]: Toolchain (without parser) took 861367.02ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 900.7MB). Free memory was 100.6MB in the beginning and 949.5MB in the end (delta: -848.9MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,907 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 23:53:38,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.29ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 100.4MB in the beginning and 218.4MB in the end (delta: -117.9MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.70ms. Allocated memory is still 248.5MB. Free memory was 218.4MB in the beginning and 216.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,908 INFO L158 Benchmark]: Boogie Preprocessor took 19.13ms. Allocated memory is still 248.5MB. Free memory was 216.3MB in the beginning and 214.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,908 INFO L158 Benchmark]: RCFGBuilder took 476.52ms. Allocated memory is still 248.5MB. Free memory was 214.7MB in the beginning and 196.1MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,908 INFO L158 Benchmark]: TraceAbstraction took 860584.11ms. Allocated memory was 248.5MB in the beginning and 1.1GB in the end (delta: 824.2MB). Free memory was 195.3MB in the beginning and 949.5MB in the end (delta: -754.2MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2024-05-30 23:53:38,909 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.09ms. Allocated memory is still 172.0MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.29ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 100.4MB in the beginning and 218.4MB in the end (delta: -117.9MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.70ms. Allocated memory is still 248.5MB. Free memory was 218.4MB in the beginning and 216.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.13ms. Allocated memory is still 248.5MB. Free memory was 216.3MB in the beginning and 214.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 476.52ms. Allocated memory is still 248.5MB. Free memory was 214.7MB in the beginning and 196.1MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 860584.11ms. Allocated memory was 248.5MB in the beginning and 1.1GB in the end (delta: 824.2MB). Free memory was 195.3MB in the beginning and 949.5MB in the end (delta: -754.2MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 792, independent: 696, independent conditional: 696, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 0, Positive unconditional cache size: 693, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 96, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 704, independent: 640, independent conditional: 640, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 0, Positive unconditional cache size: 693, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 160, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 704, independent: 640, independent conditional: 640, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 0, Positive unconditional cache size: 776, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 224, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 593, independent: 537, independent conditional: 537, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 971, Positive conditional cache size: 0, Positive unconditional cache size: 971, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 280, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 599, independent: 544, independent conditional: 544, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 0, Positive unconditional cache size: 1078, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 335, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 813, independent: 740, independent conditional: 740, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1521, Positive cache size: 1521, Positive conditional cache size: 0, Positive unconditional cache size: 1521, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 408, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 378, independent: 338, independent conditional: 338, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1521, Positive cache size: 1521, Positive conditional cache size: 0, Positive unconditional cache size: 1521, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 448, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 498, independent: 445, independent conditional: 445, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 501, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1154, independent: 1051, independent conditional: 1051, independent unconditional: 0, dependent: 103, dependent conditional: 103, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 604, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1246, independent: 1144, independent conditional: 1144, independent unconditional: 0, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7481, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 706, dependent conditional: 706, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 6775, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6775, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6775, independent: 5227, independent conditional: 0, independent unconditional: 5227, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 706, Statistics for Abstraction: - StatisticsResult: Visitor Statistics States: 719, Transitions: 790, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 719, Transitions: 734, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 726, Transitions: 741, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 620, Transitions: 632, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 627, Transitions: 639, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 828, Transitions: 844, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 462, Transitions: 469, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 617, Transitions: 624, Traversal time: 15.4s - StatisticsResult: Visitor Statistics States: 1205, Transitions: 1218, Traversal time: 90.5s - StatisticsResult: Visitor Statistics States: 1206, Transitions: 1217, Traversal time: 366.9s - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 121 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 235 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 860.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 476.7s, 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: 338, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 15.8s SatisfiabilityAnalysisTime, 366.1s InterpolantComputationTime, 2798 NumberOfCodeBlocks, 2798 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4027 ConstructedInterpolants, 144 QuantifiedInterpolants, 59965 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 679/3511 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