/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/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 14:22:02,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 14:22:02,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 14:22:02,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 14:22:02,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 14:22:02,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 14:22:02,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 14:22:02,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 14:22:02,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 14:22:02,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 14:22:02,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 14:22:02,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 14:22:02,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 14:22:02,819 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 14:22:02,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 14:22:02,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 14:22:02,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 14:22:02,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 14:22:02,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 14:22:02,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 14:22:02,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 14:22:02,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 14:22:02,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 14:22:02,822 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 14:22:02,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 14:22:02,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:22:02,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 14:22:02,824 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 14:22:02,825 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 [2024-05-30 14:22:03,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 14:22:03,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 14:22:03,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 14:22:03,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 14:22:03,078 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 14:22:03,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-05-30 14:22:04,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 14:22:04,449 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 14:22:04,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-05-30 14:22:04,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0df328a8b/40735d6515884cfb8cf04294eb6fb531/FLAGe21a64cc5 [2024-05-30 14:22:04,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0df328a8b/40735d6515884cfb8cf04294eb6fb531 [2024-05-30 14:22:04,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 14:22:04,492 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 14:22:04,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 14:22:04,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 14:22:04,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 14:22:04,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:22:04" (1/1) ... [2024-05-30 14:22:04,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700b366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:04, skipping insertion in model container [2024-05-30 14:22:04,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:22:04" (1/1) ... [2024-05-30 14:22:04,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 14:22:04,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2024-05-30 14:22:05,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:22:05,013 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 14:22:05,051 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2024-05-30 14:22:05,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:22:05,156 INFO L206 MainTranslator]: Completed translation [2024-05-30 14:22:05,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05 WrapperNode [2024-05-30 14:22:05,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 14:22:05,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 14:22:05,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 14:22:05,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 14:22:05,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,215 INFO L138 Inliner]: procedures = 467, calls = 47, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2024-05-30 14:22:05,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 14:22:05,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 14:22:05,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 14:22:05,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 14:22:05,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 14:22:05,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 14:22:05,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 14:22:05,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 14:22:05,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (1/1) ... [2024-05-30 14:22:05,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:22:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:05,276 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 14:22:05,284 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 14:22:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 14:22:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 14:22:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 14:22:05,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-30 14:22:05,313 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 14:22:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 14:22:05,314 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 14:22:05,563 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 14:22:05,564 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 14:22:05,721 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 14:22:05,738 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 14:22:05,739 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-30 14:22:05,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:22:05 BoogieIcfgContainer [2024-05-30 14:22:05,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 14:22:05,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 14:22:05,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 14:22:05,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 14:22:05,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 02:22:04" (1/3) ... [2024-05-30 14:22:05,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5406de37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:22:05, skipping insertion in model container [2024-05-30 14:22:05,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:05" (2/3) ... [2024-05-30 14:22:05,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5406de37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:22:05, skipping insertion in model container [2024-05-30 14:22:05,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:22:05" (3/3) ... [2024-05-30 14:22:05,747 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-05-30 14:22:05,754 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 14:22:05,761 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 14:22:05,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-30 14:22:05,762 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 14:22:05,805 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 14:22:05,843 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:05,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:05,846 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 14:22:05,860 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 14:22:05,880 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:05,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:22:05,901 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=LoopsAndPotentialCycles, 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;@33dee9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:05,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:05,907 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:05,939 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 61 states. [2024-05-30 14:22:05,940 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:05,942 INFO L78 Accepts]: Start accepts. Automaton has currently 64 states, but on-demand construction may add more states Word has length 54 [2024-05-30 14:22:05,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:05,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:22:05,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash -851334172, now seen corresponding path program 1 times [2024-05-30 14:22:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953312506] [2024-05-30 14:22:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:06,672 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 14:22:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953312506] [2024-05-30 14:22:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953312506] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 14:22:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750433136] [2024-05-30 14:22:06,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:06,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 14:22:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 14:22:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 14:22:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:06,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:06,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 14:22:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:06,702 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:03,487 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6485 states. [2024-05-30 14:23:03,487 INFO L212 cStratifiedReduction]: Copied states 152 times. [2024-05-30 14:23:03,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:23:03,488 INFO L78 Accepts]: Start accepts. Automaton has currently 6724 states, but on-demand construction may add more states Word has length 75 [2024-05-30 14:23:03,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:03,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 14:23:03,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:23:03,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1282618836, now seen corresponding path program 1 times [2024-05-30 14:23:03,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:03,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017502313] [2024-05-30 14:23:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:23:03,626 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 14:23:03,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:23:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017502313] [2024-05-30 14:23:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017502313] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:23:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:23:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 14:23:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629133817] [2024-05-30 14:23:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:23:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 14:23:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:23:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 14:23:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 14:23:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:03,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:23:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 14:23:03,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:23:03,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:03,642 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:10,769 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4388 states. [2024-05-30 14:24:10,769 INFO L212 cStratifiedReduction]: Copied states 995 times. [2024-05-30 14:24:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:24:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 14:24:10,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:24:10,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 14:24:10,792 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:24:10,793 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/6) [2024-05-30 14:24:10,797 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:10,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:24:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:24:10,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:24:10,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 14:24:10,855 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:24:10,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:24:10,856 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=LoopsAndPotentialCycles, 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;@33dee9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:10,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:24:10,856 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:10,870 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 71 states. [2024-05-30 14:24:10,870 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:10,871 INFO L78 Accepts]: Start accepts. Automaton has currently 75 states, but on-demand construction may add more states Word has length 64 [2024-05-30 14:24:10,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:10,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:10,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 721180560, now seen corresponding path program 1 times [2024-05-30 14:24:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018630860] [2024-05-30 14:24:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:10,913 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 14:24:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018630860] [2024-05-30 14:24:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018630860] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:10,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:24:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525809213] [2024-05-30 14:24:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:10,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:24:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:10,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:24:10,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:24:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:10,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:10,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:24:10,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:10,917 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:10,923 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 71 states. [2024-05-30 14:24:10,925 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:10,926 INFO L78 Accepts]: Start accepts. Automaton has currently 72 states, but on-demand construction may add more states Word has length 62 [2024-05-30 14:24:10,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:10,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 14:24:10,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:10,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1712776801, now seen corresponding path program 1 times [2024-05-30 14:24:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:10,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490523770] [2024-05-30 14:24:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:11,099 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 14:24:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490523770] [2024-05-30 14:24:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490523770] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:11,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:11,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 14:24:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715363014] [2024-05-30 14:24:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:11,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 14:24:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 14:24:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 14:24:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:11,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:11,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 14:24:11,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:11,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:11,102 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:40,911 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4915 states. [2024-05-30 14:24:40,911 INFO L212 cStratifiedReduction]: Copied states 116 times. [2024-05-30 14:24:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:24:40,912 INFO L78 Accepts]: Start accepts. Automaton has currently 5190 states, but on-demand construction may add more states Word has length 83 [2024-05-30 14:24:40,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 14:24:40,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:40,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1363515173, now seen corresponding path program 1 times [2024-05-30 14:24:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:40,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736233732] [2024-05-30 14:24:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:41,039 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 14:24:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736233732] [2024-05-30 14:24:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736233732] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:41,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 14:24:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723012009] [2024-05-30 14:24:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:41,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 14:24:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 14:24:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 14:24:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:41,044 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 14:24:41,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:41,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:24:41,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:41,044 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:47,214 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4425 states. [2024-05-30 14:25:47,214 INFO L212 cStratifiedReduction]: Copied states 1013 times. [2024-05-30 14:25:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:25:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 14:25:47,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:25:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 14:25:47,238 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-05-30 14:25:47,239 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/6) [2024-05-30 14:25:47,241 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:25:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:25:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:25:47,252 INFO L229 MonitoredProcess]: Starting monitored process 4 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 14:25:47,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-05-30 14:25:47,273 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:25:47,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:25:47,273 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=LoopsAndPotentialCycles, 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;@33dee9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:25:47,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:25:47,274 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:47,287 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 170 states. [2024-05-30 14:25:47,287 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:25:47,287 INFO L78 Accepts]: Start accepts. Automaton has currently 174 states, but on-demand construction may add more states Word has length 106 [2024-05-30 14:25:47,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:25:47,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:25:47,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:25:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 632673375, now seen corresponding path program 1 times [2024-05-30 14:25:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:25:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434224010] [2024-05-30 14:25:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:25:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:25:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:25:48,917 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 14:25:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:25:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434224010] [2024-05-30 14:25:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434224010] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:25:48,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:25:48,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-30 14:25:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843118165] [2024-05-30 14:25:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:25:48,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-30 14:25:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:25:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-30 14:25:48,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-05-30 14:25:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:48,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:25:48,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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 14:25:48,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:48,920 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:50,159 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 240 states. [2024-05-30 14:25:50,159 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:25:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 14:25:50,160 INFO L78 Accepts]: Start accepts. Automaton has currently 241 states, but on-demand construction may add more states Word has length 106 [2024-05-30 14:25:50,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:25:50,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 14:25:50,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:25:50,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:25:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -865534421, now seen corresponding path program 2 times [2024-05-30 14:25:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:25:50,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587560300] [2024-05-30 14:25:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:25:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:25:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:25:51,908 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 14:25:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:25:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587560300] [2024-05-30 14:25:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587560300] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:25:51,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:25:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-30 14:25:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885882414] [2024-05-30 14:25:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:25:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 14:25:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:25:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 14:25:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2024-05-30 14:25:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:51,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:25:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 27 states have internal predecessors, (106), 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 14:25:51,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 14:25:51,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:51,911 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:29:27,077 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13423 states. [2024-05-30 14:29:27,078 INFO L212 cStratifiedReduction]: Copied states 3673 times. [2024-05-30 14:29:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 14:29:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-30 14:29:27,078 INFO L78 Accepts]: Start accepts. Automaton has currently 10305 states, but on-demand construction may add more states Word has length 106 [2024-05-30 14:29:27,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:29:27,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 14:29:27,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:29:27,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:29:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1493133991, now seen corresponding path program 3 times [2024-05-30 14:29:27,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:29:27,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007732313] [2024-05-30 14:29:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:29:27,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:29:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:29:28,540 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 14:29:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:29:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007732313] [2024-05-30 14:29:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007732313] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:29:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:29:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-30 14:29:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362637447] [2024-05-30 14:29:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:29:28,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 14:29:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:29:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 14:29:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2024-05-30 14:29:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:29:28,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:29:28,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 27 states have internal predecessors, (106), 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 14:29:28,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 14:29:28,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-05-30 14:29:28,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:29:28,543 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:35:17,681 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17796 states. [2024-05-30 14:35:17,682 INFO L212 cStratifiedReduction]: Copied states 5165 times. [2024-05-30 14:35:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 14:35:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-30 14:35:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-30 14:35:17,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:35:17,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-30 14:35:17,708 INFO L445 BasicCegarLoop]: Path program histogram: [3] [2024-05-30 14:35:17,709 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/6) [2024-05-30 14:35:17,734 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:35:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:35:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:35:17,748 INFO L229 MonitoredProcess]: Starting monitored process 5 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 14:35:17,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-30 14:35:17,759 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:35:17,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:35:17,759 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=LoopsAndPotentialCycles, 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;@33dee9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:35:17,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:35:17,760 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:35:17,770 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 180 states. [2024-05-30 14:35:17,770 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:35:17,770 INFO L78 Accepts]: Start accepts. Automaton has currently 185 states, but on-demand construction may add more states Word has length 116 [2024-05-30 14:35:17,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:35:17,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:35:17,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:35:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1133696747, now seen corresponding path program 1 times [2024-05-30 14:35:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:35:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316890029] [2024-05-30 14:35:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:35:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:35:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:35:17,811 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 14:35:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:35:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316890029] [2024-05-30 14:35:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316890029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:35:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:35:17,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:35:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035515255] [2024-05-30 14:35:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:35:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:35:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:35:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:35:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:35:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:17,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:35:17,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 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 14:35:17,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:17,813 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:35:17,822 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 180 states. [2024-05-30 14:35:17,823 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:35:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:17,823 INFO L78 Accepts]: Start accepts. Automaton has currently 181 states, but on-demand construction may add more states Word has length 114 [2024-05-30 14:35:17,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:35:17,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-30 14:35:17,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:35:17,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:35:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1319941886, now seen corresponding path program 1 times [2024-05-30 14:35:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:35:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491389866] [2024-05-30 14:35:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:35:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:35:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:35:22,082 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 14:35:22,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:35:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491389866] [2024-05-30 14:35:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491389866] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:35:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:35:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-05-30 14:35:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588188203] [2024-05-30 14:35:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:35:22,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-30 14:35:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:35:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-30 14:35:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2024-05-30 14:35:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:22,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:35:22,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 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 14:35:22,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:22,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:22,101 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:35:25,175 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 259 states. [2024-05-30 14:35:25,175 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:35:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 14:35:25,181 INFO L78 Accepts]: Start accepts. Automaton has currently 268 states, but on-demand construction may add more states Word has length 114 [2024-05-30 14:35:25,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:35:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-30 14:35:25,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:35:25,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:35:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 290842318, now seen corresponding path program 2 times [2024-05-30 14:35:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:35:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363759974] [2024-05-30 14:35:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:35:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:35:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:35:27,471 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 14:35:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:35:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363759974] [2024-05-30 14:35:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363759974] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:35:27,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:35:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-05-30 14:35:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964898301] [2024-05-30 14:35:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:35:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-30 14:35:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:35:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-30 14:35:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2024-05-30 14:35:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:27,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:35:27,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 34 states have internal predecessors, (114), 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 14:35:27,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:27,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-30 14:35:27,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:27,474 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:35:32,002 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 311 states. [2024-05-30 14:35:32,002 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:35:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:35:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 14:35:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-30 14:35:32,003 INFO L78 Accepts]: Start accepts. Automaton has currently 320 states, but on-demand construction may add more states Word has length 114 [2024-05-30 14:35:32,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:35:32,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 14:35:32,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:35:32,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:35:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 397625816, now seen corresponding path program 3 times [2024-05-30 14:35:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:35:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593868908] [2024-05-30 14:35:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:35:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:35:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:35:32,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:35:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:35:32,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:35:32,124 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:35:32,124 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:35:32,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-30 14:35:32,126 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-05-30 14:35:32,126 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (4/6) [2024-05-30 14:35:32,128 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 14:35:32,128 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 14:35:32,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 02:35:32 BasicIcfg [2024-05-30 14:35:32,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 14:35:32,214 INFO L158 Benchmark]: Toolchain (without parser) took 807722.37ms. Allocated memory was 164.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 95.5MB in the beginning and 353.2MB in the end (delta: -257.7MB). Peak memory consumption was 986.2MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,214 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 164.6MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 14:35:32,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.94ms. Allocated memory was 164.6MB in the beginning and 221.2MB in the end (delta: 56.6MB). Free memory was 95.4MB in the beginning and 155.4MB in the end (delta: -60.1MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.22ms. Allocated memory is still 221.2MB. Free memory was 155.4MB in the beginning and 152.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,215 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 221.2MB. Free memory was 152.3MB in the beginning and 149.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,216 INFO L158 Benchmark]: RCFGBuilder took 490.86ms. Allocated memory is still 221.2MB. Free memory was 149.7MB in the beginning and 124.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,216 INFO L158 Benchmark]: TraceAbstraction took 806472.74ms. Allocated memory was 221.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.5MB in the beginning and 353.2MB in the end (delta: -229.8MB). Peak memory consumption was 956.7MB. Max. memory is 8.0GB. [2024-05-30 14:35:32,218 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.11ms. Allocated memory is still 164.6MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 663.94ms. Allocated memory was 164.6MB in the beginning and 221.2MB in the end (delta: 56.6MB). Free memory was 95.4MB in the beginning and 155.4MB in the end (delta: -60.1MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.22ms. Allocated memory is still 221.2MB. Free memory was 155.4MB in the beginning and 152.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 221.2MB. Free memory was 152.3MB in the beginning and 149.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.86ms. Allocated memory is still 221.2MB. Free memory was 149.7MB in the beginning and 124.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 806472.74ms. Allocated memory was 221.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.5MB in the beginning and 353.2MB in the end (delta: -229.8MB). Peak memory consumption was 956.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19649, independent: 19506, independent conditional: 19506, independent unconditional: 0, dependent: 97, dependent conditional: 97, dependent unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19631, independent: 19506, independent conditional: 19506, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19631, independent: 19506, independent conditional: 19506, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19824, independent: 19506, independent conditional: 0, independent unconditional: 19506, dependent: 198, dependent conditional: 119, dependent unconditional: 79, unknown: 120, unknown conditional: 74, unknown unconditional: 46] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19824, independent: 19506, independent conditional: 0, independent unconditional: 19506, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19824, independent: 19506, independent conditional: 0, independent unconditional: 19506, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19631, independent: 19506, independent conditional: 0, independent unconditional: 19506, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19631, independent: 19472, independent conditional: 0, independent unconditional: 19472, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 159, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 159, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115046, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 66388, dependent conditional: 0, dependent unconditional: 66388, unknown: 48190, unknown conditional: 0, unknown unconditional: 48190] , Protected Queries: 0 ], Cache Queries: [ total: 19824, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 19705, unknown conditional: 0, unknown unconditional: 19705] , Statistics on independence cache: Total cache size (in pairs): 19585, Positive cache size: 19506, Positive conditional cache size: 0, Positive unconditional cache size: 19506, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 46, Unknown conditional cache size: 0, Unknown unconditional cache size: 46, Eliminated conditions: 193, Maximal queried relation: 2, Independence queries for same thread: 18 - StatisticsResult: Reduction benchmarks 32.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 61, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 56785.1ms Time before loop, 0.0ms Time in loop, 56.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6485, Duplicate States: 152, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 67126.7ms Time before loop, 0.0ms Time in loop, 67.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4388, Duplicate States: 995, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 61, Transitions: 60, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 6422, Transitions: 6578, Traversal time: 56.8s - StatisticsResult: Visitor Statistics States: 4382, Transitions: 4811, Traversal time: 67.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 21, Times there's more than one choice: 6, Avg number of choices: 1.2857142857142858 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16362, independent: 16238, independent conditional: 16238, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16336, independent: 16238, independent conditional: 16238, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16336, independent: 16238, independent conditional: 16238, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16600, independent: 16238, independent conditional: 0, independent unconditional: 16238, dependent: 222, dependent conditional: 162, dependent unconditional: 60, unknown: 140, unknown conditional: 102, unknown unconditional: 38] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16600, independent: 16238, independent conditional: 0, independent unconditional: 16238, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16600, independent: 16238, independent conditional: 0, independent unconditional: 16238, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16336, independent: 16238, independent conditional: 0, independent unconditional: 16238, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16336, independent: 16213, independent conditional: 0, independent unconditional: 16213, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 123, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 123, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89952, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 49985, dependent conditional: 0, dependent unconditional: 49985, unknown: 39669, unknown conditional: 0, unknown unconditional: 39669] , Protected Queries: 0 ], Cache Queries: [ total: 16600, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 16438, unknown conditional: 0, unknown unconditional: 16438] , Statistics on independence cache: Total cache size (in pairs): 16298, Positive cache size: 16238, Positive conditional cache size: 0, Positive unconditional cache size: 16238, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Unknown cache size: 38, Unknown conditional cache size: 0, Unknown unconditional cache size: 38, Eliminated conditions: 264, Maximal queried relation: 3, Independence queries for same thread: 26 - StatisticsResult: Reduction benchmarks 13.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 71, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 4.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 71, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 29809.2ms Time before loop, 0.0ms Time in loop, 29.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4915, Duplicate States: 116, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 66169.3ms Time before loop, 0.0ms Time in loop, 66.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4425, Duplicate States: 1013, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 71, Transitions: 70, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 70, Transitions: 70, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 4835, Transitions: 4921, Traversal time: 29.8s - StatisticsResult: Visitor Statistics States: 4418, Transitions: 4851, Traversal time: 66.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 28, Times there's more than one choice: 17, Avg number of choices: 1.9642857142857142 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 62885, independent: 62065, independent conditional: 62065, independent unconditional: 0, dependent: 526, dependent conditional: 526, dependent unconditional: 0, unknown: 294, unknown conditional: 294, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62639, independent: 62065, independent conditional: 62065, independent unconditional: 0, dependent: 280, dependent conditional: 280, dependent unconditional: 0, unknown: 294, unknown conditional: 294, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62639, independent: 62065, independent conditional: 62065, independent unconditional: 0, dependent: 280, dependent conditional: 280, dependent unconditional: 0, unknown: 294, unknown conditional: 294, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64135, independent: 62065, independent conditional: 0, independent unconditional: 62065, dependent: 981, dependent conditional: 701, dependent unconditional: 280, unknown: 1089, unknown conditional: 795, unknown unconditional: 294] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64135, independent: 62065, independent conditional: 0, independent unconditional: 62065, dependent: 981, dependent conditional: 0, dependent unconditional: 981, unknown: 1089, unknown conditional: 0, unknown unconditional: 1089] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64135, independent: 62065, independent conditional: 0, independent unconditional: 62065, dependent: 981, dependent conditional: 0, dependent unconditional: 981, unknown: 1089, unknown conditional: 0, unknown unconditional: 1089] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62639, independent: 62065, independent conditional: 0, independent unconditional: 62065, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62639, independent: 61999, independent conditional: 0, independent unconditional: 61999, dependent: 640, dependent conditional: 0, dependent unconditional: 640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 640, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 640, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 640, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , SemanticIndependenceRelation.Query Time [ms]: [ total: 540911, independent: 788, independent conditional: 0, independent unconditional: 788, dependent: 237105, dependent conditional: 0, dependent unconditional: 237105, unknown: 303019, unknown conditional: 0, unknown unconditional: 303019] , Protected Queries: 0 ], Cache Queries: [ total: 64135, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 701, dependent conditional: 0, dependent unconditional: 701, unknown: 63434, unknown conditional: 0, unknown unconditional: 63434] , Statistics on independence cache: Total cache size (in pairs): 62345, Positive cache size: 62065, Positive conditional cache size: 0, Positive unconditional cache size: 62065, Negative cache size: 280, Negative conditional cache size: 0, Negative unconditional cache size: 280, Unknown cache size: 294, Unknown conditional cache size: 0, Unknown unconditional cache size: 294, Eliminated conditions: 1496, Maximal queried relation: 3, Independence queries for same thread: 246 - StatisticsResult: Reduction benchmarks 13.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 170, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1239.0ms Time before loop, 0.0ms Time in loop, 1.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 240, Duplicate States: 0, Protected Variables: 26 - StatisticsResult: Reduction benchmarks 215166.4ms Time before loop, 0.0ms Time in loop, 215.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 13423, Duplicate States: 3673, Protected Variables: 38 - StatisticsResult: Reduction benchmarks 349138.2ms Time before loop, 0.0ms Time in loop, 349.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17796, Duplicate States: 5165, Protected Variables: 38 - StatisticsResult: Visitor Statistics States: 121, Transitions: 120, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 190, Transitions: 190, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 13340, Transitions: 15702, Traversal time: 215.2s - StatisticsResult: Visitor Statistics States: 17732, Transitions: 22028, Traversal time: 349.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 245, Times there's more than one choice: 240, Avg number of choices: 2.5755102040816324 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 119, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 109, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 109, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1584, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1584, dependent conditional: 0, dependent unconditional: 1584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 109, unknown conditional: 0, unknown unconditional: 109] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 3, Independence queries for same thread: 10 - StatisticsResult: Reduction benchmarks 10.0ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 180, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 9.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 180, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 3073.1ms Time before loop, 0.0ms Time in loop, 3.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 259, Duplicate States: 0, Protected Variables: 43 - StatisticsResult: Reduction benchmarks 4527.8ms Time before loop, 0.0ms Time in loop, 4.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 311, Duplicate States: 0, Protected Variables: 43 - StatisticsResult: Visitor Statistics States: 131, Transitions: 130, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 130, Transitions: 130, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 208, Transitions: 210, Traversal time: 3.1s - StatisticsResult: Visitor Statistics States: 259, Transitions: 263, Traversal time: 4.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 9, Times there's more than one choice: 5, Avg number of choices: 1.8888888888888888 - PositiveResult [Line: 1675]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1731] CALL, EXPR 0 my_drv_init() [L1725] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1731] RET, EXPR 0 my_drv_init() [L1731] 0 int ret = my_drv_init(); VAL [ret=0, t1={3:0}, t2={4:0}] [L1732] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1733] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1734] 0 struct my_data data; VAL [data={6:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] CALL, EXPR 0 my_drv_probe(&data) [L1704] 0 struct device *d = &data->dev; VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.a = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1707] 0 data->shared.b = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1708] 0 int res = __VERIFIER_nondet_int(); VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1709] COND FALSE 0 !(\read(res)) VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1713] 0 return 0; VAL [\result=0, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1735] RET, EXPR 0 my_drv_probe(&data) [L1735] 0 probe_ret = my_drv_probe(&data) VAL [arg={6:24}, data={6:0}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1736] COND TRUE 0 probe_ret==0 [L1737] CALL 0 my_drv_disconnect(&data) [L1719] 0 void *status; VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1720] 0 \read(t1) VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1693] 2 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 2 data->shared.b = lb + 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1701] 2 return 0; VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1699] 1 data->shared.b = lb + 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1701] 1 return 0; VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1737] RET 0 my_drv_disconnect(&data) [L1738] EXPR 0 data.shared.a VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=1, lb=0, t1={3:0}, t2={4:0}] [L1738] RET 0 ldv_assert(data.shared.a==1) [L1739] EXPR 0 data.shared.b VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1739] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 124.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 124.0s, 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: 18, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 96.4s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 96.0s, 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: 20, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 570.4s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 565.6s, 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: 95, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 4129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 7.6s, 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: 99, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 4598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2024-05-30 14:35:32,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-05-30 14:35:32,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-05-30 14:35:32,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-30 14:35:32,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 14:35:33,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...