/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-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 02:55:07,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 02:55:07,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 02:55:07,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 02:55:07,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 02:55:07,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 02:55:07,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 02:55:07,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 02:55:07,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 02:55:07,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 02:55:07,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 02:55:07,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 02:55:07,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 02:55:07,567 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 02:55:07,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 02:55:07,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 02:55:07,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 02:55:07,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 02:55:07,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 02:55:07,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 02:55:07,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 02:55:07,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 02:55:07,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 02:55:07,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 02:55:07,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 02:55:07,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 02:55:07,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 02:55:07,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 02:55:07,575 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 02:55:07,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 02:55:07,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 02:55:07,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 02:55:07,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 02:55:07,578 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 02:55:07,578 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-03 02:55:07,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 02:55:07,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 02:55:07,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 02:55:07,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 02:55:07,806 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 02:55:07,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-05-03 02:55:08,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 02:55:09,186 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 02:55:09,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-05-03 02:55:09,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe24f25e1/0b152d684a45434cb6a4a70d730a6505/FLAGb4dc8477c [2024-05-03 02:55:09,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe24f25e1/0b152d684a45434cb6a4a70d730a6505 [2024-05-03 02:55:09,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 02:55:09,219 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 02:55:09,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 02:55:09,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 02:55:09,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 02:55:09,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241f0167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09, skipping insertion in model container [2024-05-03 02:55:09,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 02:55:09,657 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-3_2-container_of-global.i[75009,75022] [2024-05-03 02:55:09,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 02:55:09,706 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 02:55:09,765 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-3_2-container_of-global.i[75009,75022] [2024-05-03 02:55:09,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 02:55:09,876 INFO L206 MainTranslator]: Completed translation [2024-05-03 02:55:09,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09 WrapperNode [2024-05-03 02:55:09,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 02:55:09,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 02:55:09,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 02:55:09,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 02:55:09,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,952 INFO L138 Inliner]: procedures = 467, calls = 51, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2024-05-03 02:55:09,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 02:55:09,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 02:55:09,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 02:55:09,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 02:55:09,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:09,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:10,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 02:55:10,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 02:55:10,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 02:55:10,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 02:55:10,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (1/1) ... [2024-05-03 02:55:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 02:55:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:55:10,047 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-03 02:55:10,052 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-03 02:55:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 02:55:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 02:55:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 02:55:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 02:55:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 02:55:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-03 02:55:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 02:55:10,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 02:55:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-03 02:55:10,100 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-03 02:55:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 02:55:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 02:55:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 02:55:10,103 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 02:55:10,312 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 02:55:10,313 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 02:55:10,466 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 02:55:10,482 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 02:55:10,482 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-03 02:55:10,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 02:55:10 BoogieIcfgContainer [2024-05-03 02:55:10,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 02:55:10,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 02:55:10,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 02:55:10,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 02:55:10,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 02:55:09" (1/3) ... [2024-05-03 02:55:10,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a34bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 02:55:10, skipping insertion in model container [2024-05-03 02:55:10,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:55:09" (2/3) ... [2024-05-03 02:55:10,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a34bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 02:55:10, skipping insertion in model container [2024-05-03 02:55:10,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 02:55:10" (3/3) ... [2024-05-03 02:55:10,489 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-05-03 02:55:10,495 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 02:55:10,502 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 02:55:10,502 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-05-03 02:55:10,503 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 02:55:10,575 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 02:55:10,615 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:10,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:55:10,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:55:10,621 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-03 02:55:10,622 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-03 02:55:10,659 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:55:10,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:55:10,670 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:10,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:55:10,676 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:10,687 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 37 states. [2024-05-03 02:55:10,687 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:10,689 INFO L78 Accepts]: Start accepts. Automaton has currently 40 states, but on-demand construction may add more states Word has length 37 [2024-05-03 02:55:10,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:10,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:10,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -717367670, now seen corresponding path program 1 times [2024-05-03 02:55:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806296492] [2024-05-03 02:55:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:11,396 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-03 02:55:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806296492] [2024-05-03 02:55:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806296492] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 02:55:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932431195] [2024-05-03 02:55:11,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:11,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 02:55:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 02:55:11,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 02:55:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:11,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-03 02:55:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,429 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:11,504 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 36 states. [2024-05-03 02:55:11,504 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 02:55:11,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:55:11,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 02:55:11,510 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-05-03 02:55:11,512 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2024-05-03 02:55:11,520 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:55:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:55:11,580 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-03 02:55:11,581 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-03 02:55:11,595 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:55:11,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:55:11,596 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:11,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:55:11,596 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:11,604 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 47 states. [2024-05-03 02:55:11,605 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:11,605 INFO L78 Accepts]: Start accepts. Automaton has currently 51 states, but on-demand construction may add more states Word has length 47 [2024-05-03 02:55:11,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:11,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:11,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 365657404, now seen corresponding path program 1 times [2024-05-03 02:55:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135945137] [2024-05-03 02:55:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:11,661 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-03 02:55:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135945137] [2024-05-03 02:55:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135945137] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 02:55:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447818617] [2024-05-03 02:55:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:11,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 02:55:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:11,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 02:55:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 02:55:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03 02:55:11,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,665 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:11,692 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 47 states. [2024-05-03 02:55:11,692 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,693 INFO L78 Accepts]: Start accepts. Automaton has currently 48 states, but on-demand construction may add more states Word has length 45 [2024-05-03 02:55:11,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:11,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 02:55:11,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:11,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash -147864982, now seen corresponding path program 1 times [2024-05-03 02:55:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731249680] [2024-05-03 02:55:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:11,989 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-03 02:55:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731249680] [2024-05-03 02:55:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731249680] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 02:55:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479631146] [2024-05-03 02:55:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 02:55:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 02:55:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 02:55:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:11,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-03 02:55:11,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:11,993 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:12,071 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 46 states. [2024-05-03 02:55:12,071 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 02:55:12,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:55:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 02:55:12,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-03 02:55:12,074 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/8) [2024-05-03 02:55:12,076 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:55:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:55:12,079 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-03 02:55:12,084 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:55:12,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:55:12,084 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:55:12,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:55:12,085 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:12,098 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-03 02:55:12,101 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 81 states. [2024-05-03 02:55:12,106 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:12,107 INFO L78 Accepts]: Start accepts. Automaton has currently 86 states, but on-demand construction may add more states Word has length 74 [2024-05-03 02:55:12,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:12,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:12,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:12,108 INFO L85 PathProgramCache]: Analyzing trace with hash 942522866, now seen corresponding path program 1 times [2024-05-03 02:55:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669054440] [2024-05-03 02:55:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:12,142 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-03 02:55:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669054440] [2024-05-03 02:55:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669054440] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:12,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 02:55:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8804633] [2024-05-03 02:55:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:12,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 02:55:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:12,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 02:55:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 02:55:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:12,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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-03 02:55:12,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,145 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:12,149 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 81 states. [2024-05-03 02:55:12,150 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,150 INFO L78 Accepts]: Start accepts. Automaton has currently 82 states, but on-demand construction may add more states Word has length 70 [2024-05-03 02:55:12,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:12,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-03 02:55:12,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:12,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2089324402, now seen corresponding path program 1 times [2024-05-03 02:55:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:12,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385817128] [2024-05-03 02:55:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:12,338 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-03 02:55:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385817128] [2024-05-03 02:55:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385817128] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 02:55:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100601472] [2024-05-03 02:55:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:12,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 02:55:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 02:55:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 02:55:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:12,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-03 02:55:12,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:12,341 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:55:51,713 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5510 states. [2024-05-03 02:55:51,713 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:55:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:55:51,714 INFO L78 Accepts]: Start accepts. Automaton has currently 5847 states, but on-demand construction may add more states Word has length 91 [2024-05-03 02:55:51,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:55:51,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-03 02:55:51,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:55:51,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:55:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 895117715, now seen corresponding path program 1 times [2024-05-03 02:55:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:55:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891782706] [2024-05-03 02:55:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:55:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:55:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:55:51,792 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-03 02:55:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:55:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891782706] [2024-05-03 02:55:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891782706] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:55:51,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:55:51,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 02:55:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021922571] [2024-05-03 02:55:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:55:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 02:55:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:55:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 02:55:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-03 02:55:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:51,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:55:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03 02:55:51,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:51,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:55:51,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:55:51,795 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:56:25,728 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2969 states. [2024-05-03 02:56:25,729 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:56:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:56:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 02:56:25,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:56:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-03 02:56:25,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-05-03 02:56:25,742 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/8) [2024-05-03 02:56:25,745 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:56:25,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:56:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:56:25,747 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-03 02:56:25,748 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-03 02:56:25,768 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:56:25,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:56:25,768 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:56:25,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:56:25,769 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:56:25,780 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 91 states. [2024-05-03 02:56:25,780 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:56:25,780 INFO L78 Accepts]: Start accepts. Automaton has currently 97 states, but on-demand construction may add more states Word has length 84 [2024-05-03 02:56:25,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:56:25,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:56:25,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:56:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash -655417618, now seen corresponding path program 1 times [2024-05-03 02:56:25,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:56:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366871759] [2024-05-03 02:56:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:56:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:56:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:56:25,808 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-03 02:56:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:56:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366871759] [2024-05-03 02:56:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366871759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:56:25,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:56:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 02:56:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105281668] [2024-05-03 02:56:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:56:25,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 02:56:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:56:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 02:56:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 02:56:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:25,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:56:25,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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-03 02:56:25,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:25,810 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:56:25,812 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 91 states. [2024-05-03 02:56:25,812 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:56:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:25,812 INFO L78 Accepts]: Start accepts. Automaton has currently 92 states, but on-demand construction may add more states Word has length 78 [2024-05-03 02:56:25,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:56:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-03 02:56:25,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:56:25,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:56:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 413372138, now seen corresponding path program 1 times [2024-05-03 02:56:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:56:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830019290] [2024-05-03 02:56:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:56:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:56:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:56:26,013 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-03 02:56:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:56:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830019290] [2024-05-03 02:56:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830019290] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:56:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:56:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 02:56:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564196502] [2024-05-03 02:56:26,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:56:26,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 02:56:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:56:26,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 02:56:26,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 02:56:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:26,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:56:26,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-03 02:56:26,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:26,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:26,016 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:56:46,695 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4192 states. [2024-05-03 02:56:46,696 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:56:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:56:46,696 INFO L78 Accepts]: Start accepts. Automaton has currently 4529 states, but on-demand construction may add more states Word has length 99 [2024-05-03 02:56:46,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:56:46,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-03 02:56:46,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:56:46,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:56:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1310742289, now seen corresponding path program 1 times [2024-05-03 02:56:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:56:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631446695] [2024-05-03 02:56:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:56:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:56:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:56:46,792 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-03 02:56:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:56:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631446695] [2024-05-03 02:56:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631446695] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:56:46,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:56:46,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 02:56:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696903138] [2024-05-03 02:56:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:56:46,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 02:56:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:56:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 02:56:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-03 02:56:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:46,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:56:46,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-03 02:56:46,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:46,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:56:46,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:56:46,794 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:57:21,871 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2988 states. [2024-05-03 02:57:21,871 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:57:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 02:57:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 02:57:21,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:57:21,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-03 02:57:21,892 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-05-03 02:57:21,893 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/8) [2024-05-03 02:57:21,896 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:57:21,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:57:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:57:21,913 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 02:57:21,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-05-03 02:57:21,930 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:57:21,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:57:21,931 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:57:21,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:57:21,932 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:57:21,945 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 193 states. [2024-05-03 02:57:21,946 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:57:21,946 INFO L78 Accepts]: Start accepts. Automaton has currently 199 states, but on-demand construction may add more states Word has length 125 [2024-05-03 02:57:21,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:57:21,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:57:21,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:57:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -327718112, now seen corresponding path program 1 times [2024-05-03 02:57:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:57:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021097675] [2024-05-03 02:57:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:57:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:57:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:57:22,015 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-03 02:57:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:57:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021097675] [2024-05-03 02:57:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021097675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:57:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:57:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 02:57:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833712224] [2024-05-03 02:57:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:57:22,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 02:57:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:57:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 02:57:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 02:57:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:22,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:57:22,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 02:57:22,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:22,018 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:57:22,035 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 193 states. [2024-05-03 02:57:22,035 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:57:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:22,035 INFO L78 Accepts]: Start accepts. Automaton has currently 194 states, but on-demand construction may add more states Word has length 121 [2024-05-03 02:57:22,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:57:22,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-03 02:57:22,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:57:22,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:57:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -277278972, now seen corresponding path program 1 times [2024-05-03 02:57:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:57:22,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648630411] [2024-05-03 02:57:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:57:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:57:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:57:24,087 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-03 02:57:24,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:57:24,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648630411] [2024-05-03 02:57:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648630411] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:57:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:57:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-03 02:57:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305845396] [2024-05-03 02:57:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:57:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-03 02:57:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:57:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-03 02:57:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-05-03 02:57:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:24,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:57:24,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 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-03 02:57:24,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:24,090 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:57:25,492 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 310 states. [2024-05-03 02:57:25,492 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:57:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 02:57:25,493 INFO L78 Accepts]: Start accepts. Automaton has currently 311 states, but on-demand construction may add more states Word has length 121 [2024-05-03 02:57:25,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:57:25,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-03 02:57:25,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:57:25,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:57:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -126410236, now seen corresponding path program 2 times [2024-05-03 02:57:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:57:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066402851] [2024-05-03 02:57:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:57:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:57:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:57:27,225 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-03 02:57:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:57:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066402851] [2024-05-03 02:57:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066402851] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:57:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:57:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-03 02:57:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189762403] [2024-05-03 02:57:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:57:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-03 02:57:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:57:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-03 02:57:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-05-03 02:57:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:27,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:57:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 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-03 02:57:27,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:27,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 02:57:27,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:57:27,227 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:59:25,692 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 8412 states. [2024-05-03 02:59:25,692 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:59:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 02:59:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 02:59:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:59:25,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-03 02:59:25,704 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2024-05-03 02:59:25,705 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/8) [2024-05-03 02:59:25,706 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:59:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 02:59:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 02:59:25,709 INFO L229 MonitoredProcess]: Starting monitored process 7 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-03 02:59:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-03 02:59:25,733 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 02:59:25,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 02:59:25,734 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;@5465f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 02:59:25,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 02:59:25,734 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:59:25,745 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 203 states. [2024-05-03 02:59:25,746 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:59:25,746 INFO L78 Accepts]: Start accepts. Automaton has currently 210 states, but on-demand construction may add more states Word has length 135 [2024-05-03 02:59:25,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:59:25,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:59:25,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:59:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 972317776, now seen corresponding path program 1 times [2024-05-03 02:59:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:59:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741837856] [2024-05-03 02:59:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:59:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:59:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:59:25,779 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-03 02:59:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:59:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741837856] [2024-05-03 02:59:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741837856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:59:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:59:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 02:59:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377570554] [2024-05-03 02:59:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:59:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 02:59:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:59:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 02:59:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 02:59:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:25,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:59:25,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 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-03 02:59:25,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:25,781 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:59:25,790 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 203 states. [2024-05-03 02:59:25,790 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:59:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:25,791 INFO L78 Accepts]: Start accepts. Automaton has currently 204 states, but on-demand construction may add more states Word has length 129 [2024-05-03 02:59:25,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:59:25,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-03 02:59:25,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:59:25,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:59:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -446203957, now seen corresponding path program 1 times [2024-05-03 02:59:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:59:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273302547] [2024-05-03 02:59:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:59:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:59:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:59:28,503 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-03 02:59:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:59:28,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273302547] [2024-05-03 02:59:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273302547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:59:28,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:59:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-05-03 02:59:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021750943] [2024-05-03 02:59:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:59:28,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-03 02:59:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:59:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-03 02:59:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2024-05-03 02:59:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:28,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:59:28,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 02:59:28,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:28,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:28,506 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:59:31,135 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 329 states. [2024-05-03 02:59:31,135 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:59:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-03 02:59:31,136 INFO L78 Accepts]: Start accepts. Automaton has currently 335 states, but on-demand construction may add more states Word has length 129 [2024-05-03 02:59:31,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:59:31,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-03 02:59:31,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:59:31,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:59:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash 614632139, now seen corresponding path program 2 times [2024-05-03 02:59:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:59:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804051576] [2024-05-03 02:59:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:59:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:59:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 02:59:33,593 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-03 02:59:33,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 02:59:33,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804051576] [2024-05-03 02:59:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804051576] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 02:59:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 02:59:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-05-03 02:59:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296852287] [2024-05-03 02:59:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 02:59:33,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-03 02:59:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 02:59:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-03 02:59:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2024-05-03 02:59:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:33,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 02:59:33,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.3) internal successors, (129), 30 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 02:59:33,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:33,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-05-03 02:59:33,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:33,596 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 02:59:36,625 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 391 states. [2024-05-03 02:59:36,626 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 02:59:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 02:59:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-03 02:59:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-03 02:59:36,626 INFO L78 Accepts]: Start accepts. Automaton has currently 397 states, but on-demand construction may add more states Word has length 129 [2024-05-03 02:59:36,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 02:59:36,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-03 02:59:36,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 02:59:36,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 02:59:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1958702877, now seen corresponding path program 3 times [2024-05-03 02:59:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 02:59:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609555113] [2024-05-03 02:59:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 02:59:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 02:59:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-03 02:59:36,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-03 02:59:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-03 02:59:36,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-03 02:59:36,800 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-03 02:59:36,801 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 02:59:36,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-03 02:59:36,802 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-05-03 02:59:36,803 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (6/8) [2024-05-03 02:59:36,806 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 02:59:36,806 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 02:59:36,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 02:59:36 BasicIcfg [2024-05-03 02:59:36,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 02:59:36,898 INFO L158 Benchmark]: Toolchain (without parser) took 267678.00ms. Allocated memory was 186.6MB in the beginning and 858.8MB in the end (delta: 672.1MB). Free memory was 108.2MB in the beginning and 438.8MB in the end (delta: -330.7MB). Peak memory consumption was 675.8MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,898 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 02:59:36,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.15ms. Allocated memory was 186.6MB in the beginning and 348.1MB in the end (delta: 161.5MB). Free memory was 107.9MB in the beginning and 280.5MB in the end (delta: -172.6MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.39ms. Allocated memory is still 348.1MB. Free memory was 280.5MB in the beginning and 276.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,900 INFO L158 Benchmark]: Boogie Preprocessor took 62.43ms. Allocated memory is still 348.1MB. Free memory was 276.8MB in the beginning and 274.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,900 INFO L158 Benchmark]: RCFGBuilder took 467.07ms. Allocated memory is still 348.1MB. Free memory was 274.2MB in the beginning and 247.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,900 INFO L158 Benchmark]: TraceAbstraction took 266412.39ms. Allocated memory was 348.1MB in the beginning and 858.8MB in the end (delta: 510.7MB). Free memory was 245.9MB in the beginning and 438.8MB in the end (delta: -192.9MB). Peak memory consumption was 651.2MB. Max. memory is 8.0GB. [2024-05-03 02:59:36,904 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 186.6MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 657.15ms. Allocated memory was 186.6MB in the beginning and 348.1MB in the end (delta: 161.5MB). Free memory was 107.9MB in the beginning and 280.5MB in the end (delta: -172.6MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.39ms. Allocated memory is still 348.1MB. Free memory was 280.5MB in the beginning and 276.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.43ms. Allocated memory is still 348.1MB. Free memory was 276.8MB in the beginning and 274.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.07ms. Allocated memory is still 348.1MB. Free memory was 274.2MB in the beginning and 247.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 266412.39ms. Allocated memory was 348.1MB in the beginning and 858.8MB in the end (delta: 510.7MB). Free memory was 245.9MB in the beginning and 438.8MB in the end (delta: -192.9MB). Peak memory consumption was 651.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Reduction benchmarks 10.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: 37, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 74.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 36, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 38, Transitions: 37, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 36, Transitions: 36, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Reduction benchmarks 8.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: 47, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 26.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 47, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 77.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 46, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 48, Transitions: 47, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 47, Transitions: 47, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 45, Transitions: 46, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 3, Times there's more than one choice: 1, Avg number of choices: 1.3333333333333333 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14883, independent: 14759, independent conditional: 14759, independent unconditional: 0, dependent: 124, dependent conditional: 124, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14864, independent: 14759, independent conditional: 14759, independent unconditional: 0, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14864, independent: 14759, independent conditional: 14759, independent unconditional: 0, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15124, independent: 14759, independent conditional: 0, independent unconditional: 14759, dependent: 365, dependent conditional: 260, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15124, independent: 14759, independent conditional: 0, independent unconditional: 14759, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15124, independent: 14759, independent conditional: 0, independent unconditional: 14759, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14864, independent: 14759, independent conditional: 0, independent unconditional: 14759, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14864, independent: 14721, independent conditional: 0, independent unconditional: 14721, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 143, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 143, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66185, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 65754, dependent conditional: 0, dependent unconditional: 65754, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15124, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 14864, unknown conditional: 0, unknown unconditional: 14864] , Statistics on independence cache: Total cache size (in pairs): 14864, Positive cache size: 14759, Positive conditional cache size: 0, Positive unconditional cache size: 14759, Negative cache size: 105, Negative conditional cache size: 0, Negative unconditional cache size: 105, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 260, Maximal queried relation: 3, Independence queries for same thread: 19 - StatisticsResult: Reduction benchmarks 16.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 81, 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: 81, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 39371.2ms Time before loop, 0.0ms Time in loop, 39.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5510, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 33932.7ms Time before loop, 0.0ms Time in loop, 33.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2969, Duplicate States: 0, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 81, Transitions: 80, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 79, Transitions: 80, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 5446, Transitions: 5507, Traversal time: 39.4s - StatisticsResult: Visitor Statistics States: 2963, Transitions: 3019, Traversal time: 33.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 16, Times there's more than one choice: 9, Avg number of choices: 1.8125 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12223, independent: 12122, independent conditional: 12122, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12200, independent: 12122, independent conditional: 12122, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12200, independent: 12122, independent conditional: 12122, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12406, independent: 12122, independent conditional: 0, independent unconditional: 12122, dependent: 280, dependent conditional: 203, dependent unconditional: 77, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12406, independent: 12122, independent conditional: 0, independent unconditional: 12122, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12406, independent: 12122, independent conditional: 0, independent unconditional: 12122, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12200, independent: 12122, independent conditional: 0, independent unconditional: 12122, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12200, independent: 12093, independent conditional: 0, independent unconditional: 12093, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 107, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51093, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 49781, dependent conditional: 0, dependent unconditional: 49781, unknown: 1008, unknown conditional: 0, unknown unconditional: 1008] , Protected Queries: 0 ], Cache Queries: [ total: 12406, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 12203, unknown conditional: 0, unknown unconditional: 12203] , Statistics on independence cache: Total cache size (in pairs): 12199, Positive cache size: 12122, Positive conditional cache size: 0, Positive unconditional cache size: 12122, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 206, Maximal queried relation: 3, Independence queries for same thread: 23 - StatisticsResult: Reduction benchmarks 10.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: 91, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1.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: 91, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 20679.7ms Time before loop, 0.0ms Time in loop, 20.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4192, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 35076.9ms Time before loop, 0.0ms Time in loop, 35.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2988, Duplicate States: 0, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 91, Transitions: 90, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 88, Transitions: 90, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 4111, Transitions: 4146, Traversal time: 20.7s - StatisticsResult: Visitor Statistics States: 2981, Transitions: 3039, Traversal time: 35.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 20, Times there's more than one choice: 12, Avg number of choices: 1.9 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15432, independent: 15261, independent conditional: 15261, independent unconditional: 0, dependent: 161, dependent conditional: 161, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15419, independent: 15261, independent conditional: 15261, independent unconditional: 0, dependent: 148, dependent conditional: 148, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15419, independent: 15261, independent conditional: 15261, independent unconditional: 0, dependent: 148, dependent conditional: 148, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15892, independent: 15261, independent conditional: 0, independent unconditional: 15261, dependent: 591, dependent conditional: 443, dependent unconditional: 148, unknown: 40, unknown conditional: 30, unknown unconditional: 10] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15892, independent: 15261, independent conditional: 0, independent unconditional: 15261, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15892, independent: 15261, independent conditional: 0, independent unconditional: 15261, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15419, independent: 15261, independent conditional: 0, independent unconditional: 15261, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15419, independent: 15223, independent conditional: 0, independent unconditional: 15223, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 196, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112732, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 102267, dependent conditional: 0, dependent unconditional: 102267, unknown: 10071, unknown conditional: 0, unknown unconditional: 10071] , Protected Queries: 0 ], Cache Queries: [ total: 15892, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 15449, unknown conditional: 0, unknown unconditional: 15449] , Statistics on independence cache: Total cache size (in pairs): 15409, Positive cache size: 15261, Positive conditional cache size: 0, Positive unconditional cache size: 15261, Negative cache size: 148, Negative conditional cache size: 0, Negative unconditional cache size: 148, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10, Eliminated conditions: 473, Maximal queried relation: 3, Independence queries for same thread: 13 - StatisticsResult: Reduction benchmarks 13.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: 193, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 16.9ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 193, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1402.0ms Time before loop, 0.0ms Time in loop, 1.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 310, Duplicate States: 0, Protected Variables: 20 - StatisticsResult: Reduction benchmarks 118464.4ms Time before loop, 0.0ms Time in loop, 118.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 8412, Duplicate States: 0, Protected Variables: 26 - StatisticsResult: Visitor Statistics States: 140, Transitions: 139, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 138, Transitions: 139, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 254, Transitions: 256, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 8407, Transitions: 8567, Traversal time: 118.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 11, Times there's more than one choice: 7, Avg number of choices: 2.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 22, dependent conditional: 16, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 213, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 213, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1049, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 1022, dependent conditional: 0, dependent unconditional: 1022, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 229, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 213, unknown conditional: 0, unknown unconditional: 213] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 16 - StatisticsResult: Reduction benchmarks 11.4ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 203, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 9.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 203, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 2629.3ms Time before loop, 0.0ms Time in loop, 2.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 329, Duplicate States: 0, Protected Variables: 30 - StatisticsResult: Reduction benchmarks 3029.4ms Time before loop, 0.0ms Time in loop, 3.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 391, Duplicate States: 0, Protected Variables: 30 - StatisticsResult: Visitor Statistics States: 150, Transitions: 149, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 147, Transitions: 149, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 272, Transitions: 277, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 333, Transitions: 341, Traversal time: 3.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 15, Times there's more than one choice: 9, Avg number of choices: 1.9333333333333333 - 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 - 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}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; VAL [\result=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1736] 0 struct my_data data; VAL [data={6:0}, my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.b = 0 VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] EXPR 0 data->shared.a VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [data={6:0}, data={6:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [data={6:0}, data={6:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1712] 0 my_dev = &data->dev VAL [data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) VAL [arg={0:0}, data={6:0}, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] COND TRUE 0 probe_ret==0 [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1690] 2 struct my_data *data; VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1693] 2 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1701] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1701] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=1, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 6, 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.5s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 9, 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.3s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 173 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.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 73.7s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 73.3s, 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, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 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.startErr5ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 56.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 55.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 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.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 123.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 119.9s, 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: 55, 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, 3.7s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 3048 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.startErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 5.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 86, 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, 5.1s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 5285 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-03 02:59:36,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-05-03 02:59:37,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-05-03 02:59:37,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-05-03 02:59:37,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-05-03 02:59:37,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-05-03 02:59:37,952 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-03 02:59:38,154 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...