/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:39:20,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:39:20,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 16:39:20,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:39:20,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:39:20,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:39:20,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:39:20,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:39:20,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:39:20,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:39:20,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:39:20,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:39:20,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:39:20,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:39:20,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:39:20,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:39:20,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:39:20,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:39:20,485 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:39:20,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:39:20,486 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:39:20,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:39:20,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:39:20,487 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:39:20,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:39:20,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:39:20,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:39:20,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:39:20,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:39:20,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:39:20,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:39:20,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:39:20,489 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/UAutomizer-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 [2023-11-17 16:39:20,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:39:20,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:39:20,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:39:20,728 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:39:20,729 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:39:20,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-11-17 16:39:22,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:39:22,243 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:39:22,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-11-17 16:39:22,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844162eae/ac2267ffe7cf4f0a9d04b3dd9c4f690c/FLAG1659b8d9b [2023-11-17 16:39:22,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844162eae/ac2267ffe7cf4f0a9d04b3dd9c4f690c [2023-11-17 16:39:22,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:39:22,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:39:22,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:39:22,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:39:22,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:39:22,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e8f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22, skipping insertion in model container [2023-11-17 16:39:22,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,351 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:39:22,704 WARN L240 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] [2023-11-17 16:39:22,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:39:22,721 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:39:22,757 WARN L240 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] [2023-11-17 16:39:22,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:39:22,807 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:39:22,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22 WrapperNode [2023-11-17 16:39:22,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:39:22,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:39:22,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:39:22,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:39:22,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,859 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-11-17 16:39:22,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:39:22,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:39:22,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:39:22,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:39:22,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:39:22,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:39:22,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:39:22,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:39:22,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (1/1) ... [2023-11-17 16:39:22,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:39:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:39:22,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 16:39:22,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:39:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:39:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:39:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-17 16:39:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 16:39:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:39:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:39:22,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:39:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:39:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:39:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:39:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 16:39:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:39:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:39:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:39:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:39:22,971 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:39:23,141 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:39:23,144 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:39:23,439 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:39:23,477 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:39:23,478 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:39:23,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:39:23 BoogieIcfgContainer [2023-11-17 16:39:23,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:39:23,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:39:23,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:39:23,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:39:23,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:39:22" (1/3) ... [2023-11-17 16:39:23,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d4a3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:39:23, skipping insertion in model container [2023-11-17 16:39:23,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:39:22" (2/3) ... [2023-11-17 16:39:23,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d4a3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:39:23, skipping insertion in model container [2023-11-17 16:39:23,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:39:23" (3/3) ... [2023-11-17 16:39:23,488 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2023-11-17 16:39:23,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:39:23,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:39:23,505 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:39:23,585 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:39:23,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 135 transitions, 284 flow [2023-11-17 16:39:23,679 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-11-17 16:39:23,679 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:39:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 10/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 155 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 83. Up to 3 conditions per place. [2023-11-17 16:39:23,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 135 transitions, 284 flow [2023-11-17 16:39:23,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 254 flow [2023-11-17 16:39:23,696 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:39:23,717 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 121 transitions, 254 flow [2023-11-17 16:39:23,721 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 121 transitions, 254 flow [2023-11-17 16:39:23,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 121 transitions, 254 flow [2023-11-17 16:39:23,782 INFO L124 PetriNetUnfolderBase]: 8/121 cut-off events. [2023-11-17 16:39:23,783 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:39:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 121 events. 8/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 144 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-11-17 16:39:23,786 INFO L119 LiptonReduction]: Number of co-enabled transitions 2186 [2023-11-17 16:39:29,372 INFO L134 LiptonReduction]: Checked pairs total: 4018 [2023-11-17 16:39:29,372 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-17 16:39:29,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:39:29,391 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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;@5f5b7186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:39:29,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:39:29,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:39:29,398 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2023-11-17 16:39:29,398 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:39:29,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:29,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:29,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:29,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -691204904, now seen corresponding path program 1 times [2023-11-17 16:39:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988192598] [2023-11-17 16:39:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:39:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:29,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988192598] [2023-11-17 16:39:29,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988192598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:39:29,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:39:29,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:39:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578928804] [2023-11-17 16:39:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:39:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:39:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:39:29,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:39:29,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 233 [2023-11-17 16:39:29,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-11-17 16:39:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 233 [2023-11-17 16:39:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:29,940 INFO L124 PetriNetUnfolderBase]: 249/514 cut-off events. [2023-11-17 16:39:29,940 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-17 16:39:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 514 events. 249/514 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2437 event pairs, 90 based on Foata normal form. 32/480 useless extension candidates. Maximal degree in co-relation 856. Up to 256 conditions per place. [2023-11-17 16:39:29,950 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-17 16:39:29,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 179 flow [2023-11-17 16:39:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:39:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:39:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-17 16:39:29,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350500715307582 [2023-11-17 16:39:29,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-17 16:39:29,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-17 16:39:29,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:29,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-17 16:39:29,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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) [2023-11-17 16:39:29,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:29,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:29,987 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 72 flow. Second operand 3 states and 374 transitions. [2023-11-17 16:39:29,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 179 flow [2023-11-17 16:39:29,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 169 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 16:39:29,992 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 74 flow [2023-11-17 16:39:29,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2023-11-17 16:39:29,998 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-17 16:39:29,998 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 74 flow [2023-11-17 16:39:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-11-17 16:39:29,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:29,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:39:30,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:30,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1436196058, now seen corresponding path program 1 times [2023-11-17 16:39:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119322877] [2023-11-17 16:39:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:39:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:30,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119322877] [2023-11-17 16:39:30,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119322877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:39:30,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:39:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:39:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660597380] [2023-11-17 16:39:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:39:30,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:39:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:39:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:39:30,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 233 [2023-11-17 16:39:30,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-11-17 16:39:30,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:30,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 233 [2023-11-17 16:39:30,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:30,250 INFO L124 PetriNetUnfolderBase]: 417/744 cut-off events. [2023-11-17 16:39:30,251 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-11-17 16:39:30,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 744 events. 417/744 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3348 event pairs, 165 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 756. Up to 395 conditions per place. [2023-11-17 16:39:30,255 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 38 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-17 16:39:30,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 197 flow [2023-11-17 16:39:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:39:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:39:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-17 16:39:30,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236051502145923 [2023-11-17 16:39:30,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-17 16:39:30,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-17 16:39:30,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:30,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-17 16:39:30,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2023-11-17 16:39:30,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:30,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:30,260 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 74 flow. Second operand 3 states and 366 transitions. [2023-11-17 16:39:30,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 197 flow [2023-11-17 16:39:30,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:39:30,261 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 84 flow [2023-11-17 16:39:30,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-11-17 16:39:30,262 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-17 16:39:30,263 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 84 flow [2023-11-17 16:39:30,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-11-17 16:39:30,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:30,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:30,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:39:30,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:30,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 224549234, now seen corresponding path program 1 times [2023-11-17 16:39:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516967516] [2023-11-17 16:39:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:39:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516967516] [2023-11-17 16:39:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516967516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:39:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285083423] [2023-11-17 16:39:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:39:30,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:39:30,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 16:39:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:30,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 16:39:30,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:39:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:39:30,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:39:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:39:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285083423] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:39:30,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:39:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-17 16:39:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053715299] [2023-11-17 16:39:30,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:39:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:39:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:39:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 16:39:30,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 233 [2023-11-17 16:39:30,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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) [2023-11-17 16:39:30,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:30,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 233 [2023-11-17 16:39:30,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:30,796 INFO L124 PetriNetUnfolderBase]: 611/1230 cut-off events. [2023-11-17 16:39:30,796 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-11-17 16:39:30,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1230 events. 611/1230 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6205 event pairs, 103 based on Foata normal form. 52/1208 useless extension candidates. Maximal degree in co-relation 900. Up to 256 conditions per place. [2023-11-17 16:39:30,803 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 64 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-11-17 16:39:30,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 75 transitions, 345 flow [2023-11-17 16:39:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:39:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:39:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-11-17 16:39:30,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339055793991416 [2023-11-17 16:39:30,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-11-17 16:39:30,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-11-17 16:39:30,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:30,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-11-17 16:39:30,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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) [2023-11-17 16:39:30,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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) [2023-11-17 16:39:30,810 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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) [2023-11-17 16:39:30,810 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 84 flow. Second operand 5 states and 622 transitions. [2023-11-17 16:39:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 75 transitions, 345 flow [2023-11-17 16:39:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 75 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:39:30,813 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 112 flow [2023-11-17 16:39:30,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-11-17 16:39:30,814 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-17 16:39:30,814 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 112 flow [2023-11-17 16:39:30,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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) [2023-11-17 16:39:30,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:30,815 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:30,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 16:39:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:31,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:31,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 608862678, now seen corresponding path program 2 times [2023-11-17 16:39:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905684736] [2023-11-17 16:39:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-17 16:39:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905684736] [2023-11-17 16:39:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905684736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:39:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:39:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:39:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449188347] [2023-11-17 16:39:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:39:31,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:39:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:39:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:39:31,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-11-17 16:39:31,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-11-17 16:39:31,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:31,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-11-17 16:39:31,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:31,323 INFO L124 PetriNetUnfolderBase]: 1380/2241 cut-off events. [2023-11-17 16:39:31,323 INFO L125 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2023-11-17 16:39:31,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 2241 events. 1380/2241 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9761 event pairs, 528 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2272. Up to 1525 conditions per place. [2023-11-17 16:39:31,337 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 48 selfloop transitions, 3 changer transitions 3/54 dead transitions. [2023-11-17 16:39:31,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 295 flow [2023-11-17 16:39:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:39:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:39:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-17 16:39:31,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5293276108726752 [2023-11-17 16:39:31,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-17 16:39:31,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-17 16:39:31,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:31,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-17 16:39:31,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-11-17 16:39:31,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:31,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:31,343 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 112 flow. Second operand 3 states and 370 transitions. [2023-11-17 16:39:31,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 295 flow [2023-11-17 16:39:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 284 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 16:39:31,350 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 130 flow [2023-11-17 16:39:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-17 16:39:31,352 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-11-17 16:39:31,352 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 130 flow [2023-11-17 16:39:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-11-17 16:39:31,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:31,353 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:39:31,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:31,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -388409868, now seen corresponding path program 3 times [2023-11-17 16:39:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650664388] [2023-11-17 16:39:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 16:39:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650664388] [2023-11-17 16:39:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650664388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:39:31,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:39:31,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:39:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140972320] [2023-11-17 16:39:31,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:39:31,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:39:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:39:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:39:31,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-11-17 16:39:31,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-17 16:39:31,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:31,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-11-17 16:39:31,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:31,612 INFO L124 PetriNetUnfolderBase]: 361/864 cut-off events. [2023-11-17 16:39:31,612 INFO L125 PetriNetUnfolderBase]: For 536/536 co-relation queries the response was YES. [2023-11-17 16:39:31,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 864 events. 361/864 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4363 event pairs, 119 based on Foata normal form. 108/972 useless extension candidates. Maximal degree in co-relation 1247. Up to 356 conditions per place. [2023-11-17 16:39:31,617 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 24 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2023-11-17 16:39:31,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 236 flow [2023-11-17 16:39:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:39:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:39:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-17 16:39:31,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107296137339056 [2023-11-17 16:39:31,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-17 16:39:31,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-17 16:39:31,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:31,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-17 16:39:31,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-17 16:39:31,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:31,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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) [2023-11-17 16:39:31,623 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 130 flow. Second operand 3 states and 357 transitions. [2023-11-17 16:39:31,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 236 flow [2023-11-17 16:39:31,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 16:39:31,626 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 148 flow [2023-11-17 16:39:31,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-17 16:39:31,626 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-11-17 16:39:31,627 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 148 flow [2023-11-17 16:39:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-17 16:39:31,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:31,627 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:31,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:39:31,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 910765318, now seen corresponding path program 4 times [2023-11-17 16:39:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218786246] [2023-11-17 16:39:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:39:31,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:31,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218786246] [2023-11-17 16:39:31,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218786246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:39:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728973460] [2023-11-17 16:39:31,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:39:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:39:31,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:39:31,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 16:39:31,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:39:31,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:39:31,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 16:39:31,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:39:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 16:39:31,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:39:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 16:39:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728973460] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:39:31,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:39:31,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-17 16:39:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731906291] [2023-11-17 16:39:31,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:39:31,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 16:39:31,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:31,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 16:39:31,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 16:39:31,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-11-17 16:39:31,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 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) [2023-11-17 16:39:31,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:31,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-11-17 16:39:31,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:32,289 INFO L124 PetriNetUnfolderBase]: 572/1161 cut-off events. [2023-11-17 16:39:32,289 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-11-17 16:39:32,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 1161 events. 572/1161 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5145 event pairs, 65 based on Foata normal form. 110/1245 useless extension candidates. Maximal degree in co-relation 1336. Up to 257 conditions per place. [2023-11-17 16:39:32,297 INFO L140 encePairwiseOnDemand]: 221/233 looper letters, 133 selfloop transitions, 32 changer transitions 7/172 dead transitions. [2023-11-17 16:39:32,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 172 transitions, 1043 flow [2023-11-17 16:39:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:39:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 16:39:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2229 transitions. [2023-11-17 16:39:32,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555487431023912 [2023-11-17 16:39:32,303 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2229 transitions. [2023-11-17 16:39:32,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2229 transitions. [2023-11-17 16:39:32,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:32,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2229 transitions. [2023-11-17 16:39:32,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 106.14285714285714) internal successors, (2229), 21 states have internal predecessors, (2229), 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) [2023-11-17 16:39:32,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 233.0) internal successors, (5126), 22 states have internal predecessors, (5126), 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) [2023-11-17 16:39:32,316 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 233.0) internal successors, (5126), 22 states have internal predecessors, (5126), 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) [2023-11-17 16:39:32,316 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 148 flow. Second operand 21 states and 2229 transitions. [2023-11-17 16:39:32,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 172 transitions, 1043 flow [2023-11-17 16:39:32,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 172 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:39:32,321 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 387 flow [2023-11-17 16:39:32,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=387, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-11-17 16:39:32,322 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-11-17 16:39:32,322 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 387 flow [2023-11-17 16:39:32,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 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) [2023-11-17 16:39:32,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:32,323 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:32,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 16:39:32,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 16:39:32,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:32,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1614720076, now seen corresponding path program 5 times [2023-11-17 16:39:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:32,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643435324] [2023-11-17 16:39:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-17 16:39:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643435324] [2023-11-17 16:39:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643435324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:39:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237083575] [2023-11-17 16:39:32,684 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:39:32,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:39:32,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:39:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 16:39:32,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 16:39:32,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:39:32,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:39:32,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:39:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 16:39:32,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 16:39:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237083575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:39:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 16:39:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-17 16:39:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337145158] [2023-11-17 16:39:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:39:32,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:39:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:32,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:39:32,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 16:39:32,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-11-17 16:39:32,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-11-17 16:39:32,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:32,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-11-17 16:39:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:33,107 INFO L124 PetriNetUnfolderBase]: 509/1040 cut-off events. [2023-11-17 16:39:33,108 INFO L125 PetriNetUnfolderBase]: For 1766/1766 co-relation queries the response was YES. [2023-11-17 16:39:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1040 events. 509/1040 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4372 event pairs, 139 based on Foata normal form. 18/1058 useless extension candidates. Maximal degree in co-relation 1708. Up to 444 conditions per place. [2023-11-17 16:39:33,114 INFO L140 encePairwiseOnDemand]: 223/233 looper letters, 63 selfloop transitions, 30 changer transitions 0/93 dead transitions. [2023-11-17 16:39:33,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 93 transitions, 712 flow [2023-11-17 16:39:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:39:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:39:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2023-11-17 16:39:33,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880441446965052 [2023-11-17 16:39:33,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 796 transitions. [2023-11-17 16:39:33,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 796 transitions. [2023-11-17 16:39:33,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:33,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 796 transitions. [2023-11-17 16:39:33,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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) [2023-11-17 16:39:33,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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) [2023-11-17 16:39:33,123 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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) [2023-11-17 16:39:33,123 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 387 flow. Second operand 7 states and 796 transitions. [2023-11-17 16:39:33,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 93 transitions, 712 flow [2023-11-17 16:39:33,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 698 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 16:39:33,130 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 493 flow [2023-11-17 16:39:33,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=493, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2023-11-17 16:39:33,131 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-11-17 16:39:33,131 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 493 flow [2023-11-17 16:39:33,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-11-17 16:39:33,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:33,131 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:33,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 16:39:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:33,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:33,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash 139097478, now seen corresponding path program 6 times [2023-11-17 16:39:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079179035] [2023-11-17 16:39:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:39:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 16:39:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:39:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079179035] [2023-11-17 16:39:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079179035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:39:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679116162] [2023-11-17 16:39:33,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:39:33,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:39:33,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:39:33,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 16:39:33,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-17 16:39:33,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:39:33,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-17 16:39:33,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:39:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 16:39:33,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:39:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 16:39:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679116162] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:39:33,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:39:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-17 16:39:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298121212] [2023-11-17 16:39:33,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:39:33,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:39:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:39:33,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:39:33,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 16:39:33,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-11-17 16:39:33,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-11-17 16:39:33,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:39:33,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-11-17 16:39:33,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:39:33,976 INFO L124 PetriNetUnfolderBase]: 354/735 cut-off events. [2023-11-17 16:39:33,976 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2023-11-17 16:39:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 735 events. 354/735 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2581 event pairs, 106 based on Foata normal form. 22/757 useless extension candidates. Maximal degree in co-relation 1005. Up to 323 conditions per place. [2023-11-17 16:39:33,981 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 63 selfloop transitions, 25 changer transitions 0/88 dead transitions. [2023-11-17 16:39:33,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 733 flow [2023-11-17 16:39:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:39:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:39:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2023-11-17 16:39:33,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48681790312691603 [2023-11-17 16:39:33,984 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 794 transitions. [2023-11-17 16:39:33,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 794 transitions. [2023-11-17 16:39:33,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:39:33,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 794 transitions. [2023-11-17 16:39:33,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 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) [2023-11-17 16:39:33,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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) [2023-11-17 16:39:33,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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) [2023-11-17 16:39:33,989 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 493 flow. Second operand 7 states and 794 transitions. [2023-11-17 16:39:33,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 733 flow [2023-11-17 16:39:33,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 681 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-11-17 16:39:33,995 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 433 flow [2023-11-17 16:39:33,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-11-17 16:39:33,996 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-11-17 16:39:33,996 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 433 flow [2023-11-17 16:39:33,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-11-17 16:39:33,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:39:33,997 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:39:34,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 16:39:34,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:39:34,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:39:34,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:39:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 246510952, now seen corresponding path program 7 times [2023-11-17 16:39:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:39:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674501838] [2023-11-17 16:39:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:39:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:39:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:39:34,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 16:39:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:39:34,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 16:39:34,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 16:39:34,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 16:39:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 16:39:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 16:39:34,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 16:39:34,345 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2023-11-17 16:39:34,350 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:39:34,350 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:39:34,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-17 16:39:34,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-17 16:39:34,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-17 16:39:34,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-17 16:39:34,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-17 16:39:34,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-17 16:39:34,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:39:34 BasicIcfg [2023-11-17 16:39:34,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:39:34,417 INFO L158 Benchmark]: Toolchain (without parser) took 12137.40ms. Allocated memory was 332.4MB in the beginning and 417.3MB in the end (delta: 84.9MB). Free memory was 286.8MB in the beginning and 187.6MB in the end (delta: 99.1MB). Peak memory consumption was 185.1MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,417 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:39:34,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.60ms. Allocated memory is still 332.4MB. Free memory was 286.8MB in the beginning and 260.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.94ms. Allocated memory is still 332.4MB. Free memory was 260.0MB in the beginning and 257.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,418 INFO L158 Benchmark]: Boogie Preprocessor took 42.96ms. Allocated memory is still 332.4MB. Free memory was 257.9MB in the beginning and 255.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,418 INFO L158 Benchmark]: RCFGBuilder took 574.94ms. Allocated memory is still 332.4MB. Free memory was 255.8MB in the beginning and 237.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,418 INFO L158 Benchmark]: TraceAbstraction took 10934.54ms. Allocated memory was 332.4MB in the beginning and 417.3MB in the end (delta: 84.9MB). Free memory was 235.9MB in the beginning and 187.6MB in the end (delta: 48.3MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. [2023-11-17 16:39:34,420 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 179.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.60ms. Allocated memory is still 332.4MB. Free memory was 286.8MB in the beginning and 260.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.94ms. Allocated memory is still 332.4MB. Free memory was 260.0MB in the beginning and 257.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.96ms. Allocated memory is still 332.4MB. Free memory was 257.9MB in the beginning and 255.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.94ms. Allocated memory is still 332.4MB. Free memory was 255.8MB in the beginning and 237.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10934.54ms. Allocated memory was 332.4MB in the beginning and 417.3MB in the end (delta: 84.9MB). Free memory was 235.9MB in the beginning and 187.6MB in the end (delta: 48.3MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 120 PlacesBefore, 32 PlacesAfterwards, 121 TransitionsBefore, 30 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 4018 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2792, independent: 2656, independent conditional: 0, independent unconditional: 2656, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1529, independent: 1490, independent conditional: 0, independent unconditional: 1490, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1529, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2792, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1529, unknown conditional: 0, unknown unconditional: 1529] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={6:0}, t2={7:0}, total=3] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={6:0}, t2={7:0}, total=3] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5: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 [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L917] COND TRUE 0 \read(flag) [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 175 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1039 IncrementalHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 3 mSDtfsCounter, 1039 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=7, InterpolantAutomatonStates: 52, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 424 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 913 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 257/282 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 16:39:34,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...