This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 15:36:20,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 15:36:20,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 15:36:20,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 15:36:20,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 15:36:20,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 15:36:20,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 15:36:20,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 15:36:20,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 15:36:20,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 15:36:20,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 15:36:20,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 15:36:20,452 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 15:36:20,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 15:36:20,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 15:36:20,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 15:36:20,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 15:36:20,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 15:36:20,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 15:36:20,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 15:36:20,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 15:36:20,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 15:36:20,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 15:36:20,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 15:36:20,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 15:36:20,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 15:36:20,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 15:36:20,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 15:36:20,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 15:36:20,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 15:36:20,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 15:36:20,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 15:36:20,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 15:36:20,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 15:36:20,467 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 15:36:20,467 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 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: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> SYMBOLIC_RELATION [2024-10-16 15:36:20,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 15:36:20,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 15:36:20,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 15:36:20,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 15:36:20,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 15:36:20,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-10-16 15:36:22,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 15:36:22,286 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 15:36:22,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-10-16 15:36:22,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a00801d5a/c1c37f4445b7463e87bd21ea6c61b0aa/FLAG77fc9daa3 [2024-10-16 15:36:22,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a00801d5a/c1c37f4445b7463e87bd21ea6c61b0aa [2024-10-16 15:36:22,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 15:36:22,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 15:36:22,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 15:36:22,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 15:36:22,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 15:36:22,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b11e10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22, skipping insertion in model container [2024-10-16 15:36:22,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 15:36:22,640 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-16 15:36:22,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 15:36:22,654 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 15:36:22,692 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-16 15:36:22,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 15:36:22,739 INFO L204 MainTranslator]: Completed translation [2024-10-16 15:36:22,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22 WrapperNode [2024-10-16 15:36:22,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 15:36:22,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 15:36:22,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 15:36:22,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 15:36:22,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,793 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-16 15:36:22,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 15:36:22,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 15:36:22,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 15:36:22,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 15:36:22,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 15:36:22,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 15:36:22,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 15:36:22,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 15:36:22,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (1/1) ... [2024-10-16 15:36:22,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 15:36:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 15:36:22,865 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-10-16 15:36:22,871 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-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-16 15:36:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-16 15:36:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 15:36:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 15:36:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 15:36:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 15:36:22,906 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 15:36:23,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 15:36:23,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 15:36:23,230 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 15:36:23,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 15:36:23,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 15:36:23,384 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-16 15:36:23,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:36:23 BoogieIcfgContainer [2024-10-16 15:36:23,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 15:36:23,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 15:36:23,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 15:36:23,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 15:36:23,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:36:22" (1/3) ... [2024-10-16 15:36:23,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2f6fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:36:23, skipping insertion in model container [2024-10-16 15:36:23,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:36:22" (2/3) ... [2024-10-16 15:36:23,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2f6fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:36:23, skipping insertion in model container [2024-10-16 15:36:23,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:36:23" (3/3) ... [2024-10-16 15:36:23,408 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-10-16 15:36:23,420 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 15:36:23,420 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-16 15:36:23,421 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 15:36:23,455 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-16 15:36:23,493 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 15:36:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 15:36:23,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 15:36:23,498 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-10-16 15:36:23,502 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-10-16 15:36:23,582 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 15:36:23,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 15:36:23,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 15:36:23,602 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;@34ad9e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 15:36:23,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-16 15:36:24,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1798447205, now seen corresponding path program 1 times [2024-10-16 15:36:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 15:36:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 15:36:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 15:36:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:24,744 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 15:36:24,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-10-16 15:36:24,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:24,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-16 15:36:24,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -496522092, now seen corresponding path program 1 times [2024-10-16 15:36:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 15:36:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 15:36:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 15:36:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 15:36:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-16 15:36:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:25,096 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 15:36:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10-16 15:36:25,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-10-16 15:36:25,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1917908684, now seen corresponding path program 1 times [2024-10-16 15:36:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:25,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1626202920, now seen corresponding path program 1 times [2024-10-16 15:36:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 15:36:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 15:36:25,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 15:36:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:25,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 15:36:25,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-10-16 15:36:25,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-16 15:36:25,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1917908700, now seen corresponding path program 1 times [2024-10-16 15:36:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:25,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -213155686, now seen corresponding path program 1 times [2024-10-16 15:36:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1639704184, now seen corresponding path program 1 times [2024-10-16 15:36:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 15:36:25,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 15:36:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1993113704, now seen corresponding path program 1 times [2024-10-16 15:36:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 15:36:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827234480] [2024-10-16 15:36:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-16 15:36:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 15:36:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827234480] [2024-10-16 15:36:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827234480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 15:36:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620997476] [2024-10-16 15:36:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 15:36:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 15:36:26,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 15:36:26,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-16 15:36:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:26,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-16 15:36:26,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 15:36:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-16 15:36:26,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 15:36:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620997476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 15:36:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-16 15:36:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-16 15:36:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742845548] [2024-10-16 15:36:26,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 15:36:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 15:36:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 15:36:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 15:36:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-16 15:36:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:26,186 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 15:36:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-10-16 15:36:26,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:26,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:26,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:26,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:26,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-16 15:36:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9 [2024-10-16 15:36:26,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1917908721, now seen corresponding path program 1 times [2024-10-16 15:36:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:26,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -213155634, now seen corresponding path program 1 times [2024-10-16 15:36:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:26,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -601748930, now seen corresponding path program 1 times [2024-10-16 15:36:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-16 15:36:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-16 15:36:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash 274319181, now seen corresponding path program 1 times [2024-10-16 15:36:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-16 15:36:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-16 15:36:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1085565289, now seen corresponding path program 1 times [2024-10-16 15:36:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-16 15:36:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-16 15:36:27,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 15:36:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 764258452, now seen corresponding path program 1 times [2024-10-16 15:36:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 15:36:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169111442] [2024-10-16 15:36:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 51 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 15:36:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 15:36:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169111442] [2024-10-16 15:36:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169111442] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 15:36:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474878745] [2024-10-16 15:36:27,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 15:36:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 15:36:27,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 15:36:27,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-16 15:36:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 15:36:27,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-16 15:36:27,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 15:36:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-16 15:36:27,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 15:36:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474878745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 15:36:27,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-16 15:36:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-16 15:36:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004131933] [2024-10-16 15:36:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 15:36:27,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 15:36:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 15:36:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 15:36:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-16 15:36:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:27,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 15:36:27,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-16 15:36:27,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:27,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:27,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:27,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:27,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 15:36:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 15:36:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 15:36:27,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-16 15:36:27,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-16 15:36:27,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 15:36:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1917908756, now seen corresponding path program 1 times [2024-10-16 15:36:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2005019852, now seen corresponding path program 1 times [2024-10-16 15:36:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1382548906, now seen corresponding path program 1 times [2024-10-16 15:36:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 15:36:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash -155741166, now seen corresponding path program 2 times [2024-10-16 15:36:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 15:36:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983893890] [2024-10-16 15:36:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 15:36:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 15:36:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 15:36:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 15:36:27,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 15:36:27,989 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 15:36:27,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-16 15:36:27,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-16 15:36:27,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-16 15:36:27,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2024-10-16 15:36:28,003 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-16 15:36:28,058 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-16 15:36:28,058 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-16 15:36:28,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 03:36:28 BasicIcfg [2024-10-16 15:36:28,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-16 15:36:28,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-16 15:36:28,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-16 15:36:28,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-16 15:36:28,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:36:23" (3/4) ... [2024-10-16 15:36:28,063 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-16 15:36:28,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-16 15:36:28,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-16 15:36:28,124 INFO L158 Benchmark]: Toolchain (without parser) took 5811.90ms. Allocated memory was 86.0MB in the beginning and 182.5MB in the end (delta: 96.5MB). Free memory was 45.3MB in the beginning and 102.7MB in the end (delta: -57.3MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,124 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-16 15:36:28,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.65ms. Allocated memory is still 86.0MB. Free memory was 45.1MB in the beginning and 39.3MB in the end (delta: 5.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.36ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 39.3MB in the beginning and 102.6MB in the end (delta: -63.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,125 INFO L158 Benchmark]: Boogie Preprocessor took 35.00ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,125 INFO L158 Benchmark]: RCFGBuilder took 553.82ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 64.3MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,125 INFO L158 Benchmark]: TraceAbstraction took 4659.41ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 100.3MB in the beginning and 115.3MB in the end (delta: -15.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,125 INFO L158 Benchmark]: Witness Printer took 61.74ms. Allocated memory is still 182.5MB. Free memory was 115.3MB in the beginning and 102.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-16 15:36:28,126 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.14ms. Allocated memory is still 50.3MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.65ms. Allocated memory is still 86.0MB. Free memory was 45.1MB in the beginning and 39.3MB in the end (delta: 5.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.36ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 39.3MB in the beginning and 102.6MB in the end (delta: -63.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.00ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.82ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 64.3MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4659.41ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 100.3MB in the beginning and 115.3MB in the end (delta: -15.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 61.74ms. Allocated memory is still 182.5MB. Free memory was 115.3MB in the beginning and 102.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1541, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 384, dependent conditional: 362, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 275, dependent conditional: 231, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 385, independent conditional: 1, independent unconditional: 384, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 983, independent: 189, independent conditional: 5, independent unconditional: 184, dependent: 794, dependent conditional: 305, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1432, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 229, dependent conditional: 34, dependent unconditional: 195, unknown: 431, unknown conditional: 24, unknown unconditional: 407] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 385, Positive conditional cache size: 1, Positive unconditional cache size: 384, Negative cache size: 46, Negative conditional cache size: 23, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 838, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 275, dependent conditional: 231, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 385, independent conditional: 1, independent unconditional: 384, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 983, independent: 189, independent conditional: 5, independent unconditional: 184, dependent: 794, dependent conditional: 305, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1432, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 229, dependent conditional: 34, dependent unconditional: 195, unknown: 431, unknown conditional: 24, unknown unconditional: 407] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 385, Positive conditional cache size: 1, Positive unconditional cache size: 384, Negative cache size: 46, Negative conditional cache size: 23, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 838 ], Independence queries for same thread: 290, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 109, Number of trivial persistent sets: 87, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 512, independent: 492, independent conditional: 0, independent unconditional: 492, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1541, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 384, dependent conditional: 362, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1251, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 94, dependent conditional: 72, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 275, dependent conditional: 231, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 385, independent conditional: 1, independent unconditional: 384, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 983, independent: 189, independent conditional: 5, independent unconditional: 184, dependent: 794, dependent conditional: 305, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1432, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 229, dependent conditional: 34, dependent unconditional: 195, unknown: 431, unknown conditional: 24, unknown unconditional: 407] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 385, Positive conditional cache size: 1, Positive unconditional cache size: 384, Negative cache size: 46, Negative conditional cache size: 23, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 838, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 665, independent unconditional: 492, dependent: 275, dependent conditional: 231, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1157, independent conditional: 1, independent unconditional: 1156, dependent: 275, dependent conditional: 57, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 385, independent conditional: 1, independent unconditional: 384, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 46, dependent conditional: 23, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 983, independent: 189, independent conditional: 5, independent unconditional: 184, dependent: 794, dependent conditional: 305, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1432, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 229, dependent conditional: 34, dependent unconditional: 195, unknown: 431, unknown conditional: 24, unknown unconditional: 407] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 385, Positive conditional cache size: 1, Positive unconditional cache size: 384, Negative cache size: 46, Negative conditional cache size: 23, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 838 ], Independence queries for same thread: 290 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=2147483646, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=2147483646, t2=2147483647, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] - UnprovableResult [Line: 913]: 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: 914]: 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 5 procedures, 55 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 189/210 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: ConditionalCommutativityOverallTime: 2.2s, ConditionalCommutativityCheckTime: 2.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 3, ConditionalCommutativityConditionCalculations: 15, ConditionalCommutativityTraceChecks: 15, ConditionalCommutativityImperfectProofs: 5 RESULT: Ultimate proved your program to be incorrect! [2024-10-16 15:36:28,154 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-10-16 15:36:28,350 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...