/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 12:23:57,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 12:23:57,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 12:23:57,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 12:23:57,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 12:23:57,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 12:23:57,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 12:23:57,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 12:23:57,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 12:23:57,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 12:23:57,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 12:23:57,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 12:23:57,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 12:23:57,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 12:23:57,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 12:23:57,271 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 12:23:57,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-14 12:23:57,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 12:23:57,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 12:23:57,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 12:23:57,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 12:23:57,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 12:23:57,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-11-14 12:23:58,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 12:23:59,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 12:23:59,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-11-14 12:23:59,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/84be8db53/3e00a74e09a44bc6888f69da02523efb/FLAGf86dba313 [2024-11-14 12:23:59,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/84be8db53/3e00a74e09a44bc6888f69da02523efb [2024-11-14 12:23:59,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 12:23:59,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 12:23:59,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 12:23:59,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 12:23:59,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 12:23:59,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7676f1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59, skipping insertion in model container [2024-11-14 12:23:59,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 12:23:59,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-11-14 12:23:59,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 12:23:59,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 12:23:59,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-11-14 12:23:59,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 12:23:59,709 INFO L204 MainTranslator]: Completed translation [2024-11-14 12:23:59,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59 WrapperNode [2024-11-14 12:23:59,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 12:23:59,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 12:23:59,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 12:23:59,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 12:23:59,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,759 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-11-14 12:23:59,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 12:23:59,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 12:23:59,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 12:23:59,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 12:23:59,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 12:23:59,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 12:23:59,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 12:23:59,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 12:23:59,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (1/1) ... [2024-11-14 12:23:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 12:23:59,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 12:23:59,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 12:23:59,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 12:23:59,877 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-14 12:23:59,878 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 12:23:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 12:23:59,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 12:23:59,879 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 12:24:00,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 12:24:00,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 12:24:00,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 12:24:00,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 12:24:00,278 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 12:24:00,278 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 12:24:00,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 12:24:00 BoogieIcfgContainer [2024-11-14 12:24:00,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 12:24:00,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 12:24:00,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 12:24:00,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 12:24:00,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 12:23:59" (1/3) ... [2024-11-14 12:24:00,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b30c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 12:24:00, skipping insertion in model container [2024-11-14 12:24:00,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 12:23:59" (2/3) ... [2024-11-14 12:24:00,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b30c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 12:24:00, skipping insertion in model container [2024-11-14 12:24:00,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 12:24:00" (3/3) ... [2024-11-14 12:24:00,286 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-11-14 12:24:00,299 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 12:24:00,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 159 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2024-11-14 12:24:00,300 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 12:24:00,352 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 12:24:00,429 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 12:24:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 12:24:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 12:24:00,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 12:24:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 12:24:00,508 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 12:24:00,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 12:24:00,522 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a7a041a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 12:24:00,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-14 12:24:00,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:00,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1032079575, now seen corresponding path program 1 times [2024-11-14 12:24:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234833248] [2024-11-14 12:24:00,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:01,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234833248] [2024-11-14 12:24:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234833248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:01,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:01,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 12:24:01,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596287734] [2024-11-14 12:24:01,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 12:24:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:01,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 12:24:01,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 12:24:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:01,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-11-14 12:24:01,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:01,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 12:24:01,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash -401913413, now seen corresponding path program 1 times [2024-11-14 12:24:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123536273] [2024-11-14 12:24:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123536273] [2024-11-14 12:24:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123536273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 12:24:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893277923] [2024-11-14 12:24:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:01,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 12:24:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:01,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 12:24:01,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 12:24:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-11-14 12:24:01,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:01,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 12:24:01,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:01,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash 217664351, now seen corresponding path program 1 times [2024-11-14 12:24:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796896755] [2024-11-14 12:24:01,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796896755] [2024-11-14 12:24:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796896755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:01,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 12:24:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335408338] [2024-11-14 12:24:01,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:01,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 12:24:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:01,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 12:24:01,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 12:24:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,787 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-11-14 12:24:01,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:01,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 12:24:01,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:01,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 750213565, now seen corresponding path program 1 times [2024-11-14 12:24:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928355811] [2024-11-14 12:24:01,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928355811] [2024-11-14 12:24:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928355811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:02,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 12:24:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062080676] [2024-11-14 12:24:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 12:24:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:02,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 12:24:02,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 12:24:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:02,148 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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-11-14 12:24:02,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:02,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:02,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:02,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:02,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 12:24:02,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash -48713492, now seen corresponding path program 1 times [2024-11-14 12:24:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203519580] [2024-11-14 12:24:02,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203519580] [2024-11-14 12:24:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203519580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-14 12:24:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120516571] [2024-11-14 12:24:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:04,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 12:24:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 12:24:04,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-14 12:24:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:04,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:04,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0625) internal successors, (113), 16 states have internal predecessors, (113), 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-11-14 12:24:04,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:04,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:04,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:04,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:04,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 12:24:05,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 12:24:05,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:05,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 337771236, now seen corresponding path program 1 times [2024-11-14 12:24:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519522846] [2024-11-14 12:24:05,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519522846] [2024-11-14 12:24:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519522846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:07,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:07,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-14 12:24:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070874345] [2024-11-14 12:24:07,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:07,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 12:24:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:07,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 12:24:07,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-14 12:24:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:07,652 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 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-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 12:24:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 12:24:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 12:24:10,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 12:24:10,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:10,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 116855694, now seen corresponding path program 1 times [2024-11-14 12:24:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386330047] [2024-11-14 12:24:10,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386330047] [2024-11-14 12:24:10,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386330047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:10,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:10,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 12:24:10,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301984311] [2024-11-14 12:24:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 12:24:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:10,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 12:24:10,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 12:24:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:10,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 12:24:10,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:10,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:10,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-14 12:24:10,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-14 12:24:10,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 12:24:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 12:24:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 12:24:11,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1648050592, now seen corresponding path program 2 times [2024-11-14 12:24:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382018572] [2024-11-14 12:24:11,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382018572] [2024-11-14 12:24:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382018572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-14 12:24:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198622627] [2024-11-14 12:24:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 12:24:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 12:24:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-14 12:24:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:12,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:12,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0625) internal successors, (113), 16 states have internal predecessors, (113), 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-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:12,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:14,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 12:24:14,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 153201774, now seen corresponding path program 3 times [2024-11-14 12:24:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070173978] [2024-11-14 12:24:14,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 12:24:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 12:24:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 12:24:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070173978] [2024-11-14 12:24:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070173978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 12:24:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 12:24:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-14 12:24:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136832823] [2024-11-14 12:24:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 12:24:15,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 12:24:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 12:24:15,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 12:24:15,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-14 12:24:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:15,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 12:24:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.65) internal successors, (113), 20 states have internal predecessors, (113), 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-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-14 12:24:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 12:24:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 12:24:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 12:24:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 12:24:16,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-14 12:24:16,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 12:24:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -71281562, now seen corresponding path program 2 times [2024-11-14 12:24:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 12:24:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175909656] [2024-11-14 12:24:16,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 12:24:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 12:24:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 12:24:16,956 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 12:24:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 12:24:17,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 12:24:17,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-14 12:24:17,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-11-14 12:24:17,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-11-14 12:24:17,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-11-14 12:24:17,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-11-14 12:24:17,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-11-14 12:24:17,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-11-14 12:24:17,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-14 12:24:17,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-11-14 12:24:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 12:24:17,033 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-11-14 12:24:17,120 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 12:24:17,120 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 12:24:17,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 12:24:17,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 12:24:17 BasicIcfg [2024-11-14 12:24:17,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 12:24:17,150 INFO L158 Benchmark]: Toolchain (without parser) took 18030.52ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 54.1MB in the beginning and 309.5MB in the end (delta: -255.4MB). Peak memory consumption was 256.3MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,150 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 12:24:17,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.77ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 23.0MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 83.9MB. Free memory was 23.0MB in the beginning and 20.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,151 INFO L158 Benchmark]: Boogie Preprocessor took 64.10ms. Allocated memory is still 83.9MB. Free memory was 20.5MB in the beginning and 54.9MB in the end (delta: -34.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,151 INFO L158 Benchmark]: RCFGBuilder took 451.93ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 32.2MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,151 INFO L158 Benchmark]: TraceAbstraction took 16868.70ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 31.4MB in the beginning and 309.5MB in the end (delta: -278.2MB). Peak memory consumption was 234.2MB. Max. memory is 8.0GB. [2024-11-14 12:24:17,152 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.16ms. Allocated memory is still 83.9MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 588.77ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 23.0MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 83.9MB. Free memory was 23.0MB in the beginning and 20.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.10ms. Allocated memory is still 83.9MB. Free memory was 20.5MB in the beginning and 54.9MB in the end (delta: -34.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * RCFGBuilder took 451.93ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 32.2MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16868.70ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 31.4MB in the beginning and 309.5MB in the end (delta: -278.2MB). Peak memory consumption was 234.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3908, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 116, dependent conditional: 82, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3832, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3832, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 80, dependent conditional: 46, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 13, independent unconditional: 3779, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 13, independent unconditional: 3779, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2030, independent: 1979, independent conditional: 11, independent unconditional: 1968, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1963, independent conditional: 0, independent unconditional: 1963, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2325, independent: 521, independent conditional: 404, independent unconditional: 117, dependent: 1804, dependent conditional: 727, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 3872, independent: 1813, independent conditional: 2, independent unconditional: 1811, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 2030, unknown conditional: 28, unknown unconditional: 2002] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1979, Positive conditional cache size: 11, Positive unconditional cache size: 1968, Negative cache size: 51, Negative conditional cache size: 17, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1833, Maximal queried relation: 4, Independence queries for same thread: 76, Persistent sets #1 benchmarks: Persistent set computation time: 1.3s, Number of persistent set computation: 680, Number of trivial persistent sets: 635, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2002, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3908, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 116, dependent conditional: 82, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3832, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3832, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 1824, independent unconditional: 1968, dependent: 80, dependent conditional: 46, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 13, independent unconditional: 3779, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3872, independent: 3792, independent conditional: 13, independent unconditional: 3779, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2030, independent: 1979, independent conditional: 11, independent unconditional: 1968, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1963, independent conditional: 0, independent unconditional: 1963, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2325, independent: 521, independent conditional: 404, independent unconditional: 117, dependent: 1804, dependent conditional: 727, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 3872, independent: 1813, independent conditional: 2, independent unconditional: 1811, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 2030, unknown conditional: 28, unknown unconditional: 2002] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1979, Positive conditional cache size: 11, Positive unconditional cache size: 1968, Negative cache size: 51, Negative conditional cache size: 17, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1833, Maximal queried relation: 4, Independence queries for same thread: 76 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; VAL [t1=0, t2=0] [L3901] 0 struct device *my_dev; VAL [my_dev={0:0}, t1=0, t2=0] [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; VAL [\result=0, my_dev={0:0}, t1=0, t2=0] [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, ret=0, t1=0, t2=0] [L3954] COND TRUE 0 ret==0 VAL [my_dev={0:0}, ret=0, t1=0, t2=0] [L3955] 0 int probe_ret; VAL [my_dev={0:0}, ret=0, t1=0, t2=0] [L3956] 0 struct my_data data; VAL [data={5:0}, my_dev={0:0}, ret=0, t1=0, t2=0] [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, t1=0, t2=0] [L3924] 0 data->shared.b = 0 VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, t1=0, t2=0] [L3925] EXPR 0 data->shared.a VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, t1=0, t2=0] [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, t1=0, t2=0] [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, res=0, t1=0, t2=0] [L3928] COND FALSE 0 !(\read(res)) VAL [\old(data)={5:0}, data={5:0}, my_dev={0:0}, res=0, t1=0, t2=0] [L3931] 0 my_dev = &data->dev VAL [\old(data)={5:0}, data={5:0}, my_dev={5:28}, res=0, t1=0, t2=0] [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:28}, res=0, t1=-1, t2=0] [L3903] 1 struct my_data *data; VAL [\old(arg)={0:0}, arg={0:0}, my_dev={5:28}, t1=-1, t2=0] [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [\old(arg)={0:0}, __mptr={5:28}, arg={0:0}, my_dev={5:28}, t1=-1, t2=0] [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} VAL [\old(arg)={0:0}, __mptr={5:28}, arg={0:0}, my_dev={5:28}, t1=-1, t2=0] [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:28}, t1=-1, t2=0] [L3908] 1 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:28}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, res=0, t1=-1, t2=0] [L3903] 2 struct my_data *data; VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [\old(arg)={0:0}, __mptr={5:28}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} VAL [\old(arg)={0:0}, __mptr={5:28}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3908] 2 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3917] 1 return 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3917] 2 return 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3935] 0 return 0; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result=0, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, res=0, t1=-1, t2=0] [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, probe_ret=0, ret=0, t1=-1, t2=0] [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, status={3:0}, t1=-1, t2=0] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, status={3:0}, t1=-1, t2=0] [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, status={3:0}, t1=-1, t2=0] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, probe_ret=0, ret=0, t1=-1, t2=0] [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, data={5:0}, expression=1, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:28}, probe_ret=0, ret=0, t1=-1, t2=0] [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:28}, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:28}, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3933]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3934]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 187 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 8.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: 199, 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, 7.1s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 6667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-14 12:24:17,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...