/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:40:57,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:40:57,210 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-VariableLbe.epf [2023-08-23 22:40:57,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:40:57,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:40:57,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:40:57,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:40:57,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:40:57,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:40:57,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:40:57,247 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:40:57,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:40:57,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:40:57,249 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:40:57,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:40:57,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:40:57,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:40:57,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:40:57,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:40:57,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:40:57,250 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:40:57,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:40:57,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:40:57,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:40:57,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:40:57,251 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:40:57,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:40:57,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:40:57,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:40:57,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:40:57,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:40:57,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:40:57,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:40:57,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:40:57,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:40:57,254 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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-08-23 22:40:57,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:40:57,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:40:57,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:40:57,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:40:57,601 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:40:57,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2023-08-23 22:40:58,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:40:59,135 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:40:59,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2023-08-23 22:40:59,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f21f2ae/f6cd31150cc94986910074cf11077355/FLAGe73056fe4 [2023-08-23 22:40:59,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f21f2ae/f6cd31150cc94986910074cf11077355 [2023-08-23 22:40:59,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:40:59,169 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:40:59,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:40:59,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:40:59,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:40:59,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf07ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59, skipping insertion in model container [2023-08-23 22:40:59,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:40:59,657 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/stack_longest-1.i[41530,41543] [2023-08-23 22:40:59,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:40:59,707 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:40:59,736 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-23 22:40:59,738 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-23 22:40:59,744 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [753] [2023-08-23 22:40:59,763 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/stack_longest-1.i[41530,41543] [2023-08-23 22:40:59,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:40:59,848 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:40:59,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59 WrapperNode [2023-08-23 22:40:59,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:40:59,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:40:59,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:40:59,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:40:59,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,914 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 156 [2023-08-23 22:40:59,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:40:59,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:40:59,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:40:59,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:40:59,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:40:59,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:40:59,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:40:59,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:40:59,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (1/1) ... [2023-08-23 22:40:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:40:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:40:59,977 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-08-23 22:40:59,981 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-08-23 22:41:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-23 22:41:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-23 22:41:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-23 22:41:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-23 22:41:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:41:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:41:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-23 22:41:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:41:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-23 22:41:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:41:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:41:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:41:00,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:41:00,015 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:41:00,130 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:41:00,131 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:41:00,423 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:41:00,430 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:41:00,430 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-23 22:41:00,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:41:00 BoogieIcfgContainer [2023-08-23 22:41:00,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:41:00,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:41:00,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:41:00,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:41:00,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:40:59" (1/3) ... [2023-08-23 22:41:00,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0bf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:41:00, skipping insertion in model container [2023-08-23 22:41:00,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:40:59" (2/3) ... [2023-08-23 22:41:00,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0bf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:41:00, skipping insertion in model container [2023-08-23 22:41:00,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:41:00" (3/3) ... [2023-08-23 22:41:00,441 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2023-08-23 22:41:00,455 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:41:00,456 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:41:00,456 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:41:00,528 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-23 22:41:00,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 158 transitions, 332 flow [2023-08-23 22:41:00,610 INFO L124 PetriNetUnfolderBase]: 10/156 cut-off events. [2023-08-23 22:41:00,611 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-23 22:41:00,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 156 events. 10/156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 386 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-23 22:41:00,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 158 transitions, 332 flow [2023-08-23 22:41:00,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 147 transitions, 303 flow [2023-08-23 22:41:00,640 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:41:00,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 147 transitions, 303 flow [2023-08-23 22:41:00,653 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 147 transitions, 303 flow [2023-08-23 22:41:00,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 147 transitions, 303 flow [2023-08-23 22:41:00,682 INFO L124 PetriNetUnfolderBase]: 10/147 cut-off events. [2023-08-23 22:41:00,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-23 22:41:00,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 147 events. 10/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 316 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-23 22:41:00,687 INFO L119 LiptonReduction]: Number of co-enabled transitions 7334 [2023-08-23 22:41:04,283 INFO L134 LiptonReduction]: Checked pairs total: 9508 [2023-08-23 22:41:04,283 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-23 22:41:04,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:41:04,301 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@602bc975, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:41:04,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 22:41:04,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:41:04,306 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-23 22:41:04,306 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-23 22:41:04,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:04,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-23 22:41:04,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:04,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1714417513, now seen corresponding path program 1 times [2023-08-23 22:41:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795889869] [2023-08-23 22:41:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795889869] [2023-08-23 22:41:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795889869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:04,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:04,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:41:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545731677] [2023-08-23 22:41:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:04,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:41:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:41:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:41:04,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 294 [2023-08-23 22:41:04,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-08-23 22:41:04,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:04,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 294 [2023-08-23 22:41:04,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:04,800 INFO L124 PetriNetUnfolderBase]: 845/1378 cut-off events. [2023-08-23 22:41:04,800 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-08-23 22:41:04,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1378 events. 845/1378 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5796 event pairs, 243 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 2588. Up to 777 conditions per place. [2023-08-23 22:41:04,812 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-23 22:41:04,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 253 flow [2023-08-23 22:41:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:41:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:41:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-23 22:41:04,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340136054421769 [2023-08-23 22:41:04,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-23 22:41:04,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-23 22:41:04,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:04,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-23 22:41:04,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-08-23 22:41:04,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:04,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:04,852 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 75 flow. Second operand 3 states and 471 transitions. [2023-08-23 22:41:04,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 253 flow [2023-08-23 22:41:04,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 22:41:04,859 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 100 flow [2023-08-23 22:41:04,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2023-08-23 22:41:04,864 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-23 22:41:04,864 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 100 flow [2023-08-23 22:41:04,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-08-23 22:41:04,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:04,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:04,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:41:04,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:04,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1177704333, now seen corresponding path program 1 times [2023-08-23 22:41:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346891547] [2023-08-23 22:41:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346891547] [2023-08-23 22:41:04,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346891547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:04,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:04,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:41:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107892224] [2023-08-23 22:41:04,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:04,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:41:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:41:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:41:04,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 294 [2023-08-23 22:41:04,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-08-23 22:41:04,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:04,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 294 [2023-08-23 22:41:05,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:05,192 INFO L124 PetriNetUnfolderBase]: 897/1478 cut-off events. [2023-08-23 22:41:05,192 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-23 22:41:05,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1478 events. 897/1478 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6180 event pairs, 398 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 2810. Up to 1184 conditions per place. [2023-08-23 22:41:05,200 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 48 selfloop transitions, 2 changer transitions 3/54 dead transitions. [2023-08-23 22:41:05,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 249 flow [2023-08-23 22:41:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:41:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:41:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-23 22:41:05,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2023-08-23 22:41:05,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-23 22:41:05,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-23 22:41:05,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:05,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-23 22:41:05,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-08-23 22:41:05,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:05,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:05,208 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 100 flow. Second operand 3 states and 480 transitions. [2023-08-23 22:41:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 249 flow [2023-08-23 22:41:05,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:41:05,212 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 104 flow [2023-08-23 22:41:05,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-08-23 22:41:05,214 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-23 22:41:05,214 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 104 flow [2023-08-23 22:41:05,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-08-23 22:41:05,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:05,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:41:05,217 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:05,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -613507711, now seen corresponding path program 1 times [2023-08-23 22:41:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942174192] [2023-08-23 22:41:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942174192] [2023-08-23 22:41:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942174192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:05,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:41:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307674051] [2023-08-23 22:41:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:05,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:41:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:41:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:41:05,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 294 [2023-08-23 22:41:05,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-08-23 22:41:05,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:05,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 294 [2023-08-23 22:41:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:05,460 INFO L124 PetriNetUnfolderBase]: 861/1442 cut-off events. [2023-08-23 22:41:05,460 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-23 22:41:05,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1442 events. 861/1442 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6182 event pairs, 584 based on Foata normal form. 50/1334 useless extension candidates. Maximal degree in co-relation 2808. Up to 1258 conditions per place. [2023-08-23 22:41:05,468 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 50 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-23 22:41:05,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 264 flow [2023-08-23 22:41:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:41:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:41:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-23 22:41:05,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351473922902494 [2023-08-23 22:41:05,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-23 22:41:05,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-23 22:41:05,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:05,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-23 22:41:05,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-08-23 22:41:05,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:05,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:05,475 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 104 flow. Second operand 3 states and 472 transitions. [2023-08-23 22:41:05,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 264 flow [2023-08-23 22:41:05,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:41:05,477 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 122 flow [2023-08-23 22:41:05,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2023-08-23 22:41:05,478 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-23 22:41:05,478 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 122 flow [2023-08-23 22:41:05,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-08-23 22:41:05,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:05,479 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:05,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:41:05,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:05,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 558175028, now seen corresponding path program 1 times [2023-08-23 22:41:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:05,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697905421] [2023-08-23 22:41:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:05,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697905421] [2023-08-23 22:41:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697905421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:41:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386031232] [2023-08-23 22:41:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:41:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:41:05,604 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-08-23 22:41:05,634 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-08-23 22:41:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:05,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-23 22:41:05,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:41:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:05,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:41:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386031232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:41:05,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:41:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-23 22:41:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541723134] [2023-08-23 22:41:05,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:41:05,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 22:41:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 22:41:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-23 22:41:05,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2023-08-23 22:41:05,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 138.375) internal successors, (1107), 8 states have internal predecessors, (1107), 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-08-23 22:41:05,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:05,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2023-08-23 22:41:05,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:06,386 INFO L124 PetriNetUnfolderBase]: 1815/3000 cut-off events. [2023-08-23 22:41:06,386 INFO L125 PetriNetUnfolderBase]: For 1081/1081 co-relation queries the response was YES. [2023-08-23 22:41:06,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 3000 events. 1815/3000 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14159 event pairs, 349 based on Foata normal form. 48/2736 useless extension candidates. Maximal degree in co-relation 6486. Up to 844 conditions per place. [2023-08-23 22:41:06,403 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 164 selfloop transitions, 22 changer transitions 0/187 dead transitions. [2023-08-23 22:41:06,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 187 transitions, 900 flow [2023-08-23 22:41:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 22:41:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 22:41:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1535 transitions. [2023-08-23 22:41:06,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221088435374149 [2023-08-23 22:41:06,407 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1535 transitions. [2023-08-23 22:41:06,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1535 transitions. [2023-08-23 22:41:06,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:06,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1535 transitions. [2023-08-23 22:41:06,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 153.5) internal successors, (1535), 10 states have internal predecessors, (1535), 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-08-23 22:41:06,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 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-08-23 22:41:06,417 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 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-08-23 22:41:06,417 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 122 flow. Second operand 10 states and 1535 transitions. [2023-08-23 22:41:06,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 187 transitions, 900 flow [2023-08-23 22:41:06,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 187 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:41:06,425 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 280 flow [2023-08-23 22:41:06,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2023-08-23 22:41:06,425 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-08-23 22:41:06,426 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 280 flow [2023-08-23 22:41:06,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 138.375) internal successors, (1107), 8 states have internal predecessors, (1107), 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-08-23 22:41:06,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:06,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:06,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-23 22:41:06,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:41:06,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:06,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -957332165, now seen corresponding path program 1 times [2023-08-23 22:41:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576133526] [2023-08-23 22:41:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576133526] [2023-08-23 22:41:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576133526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:41:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133642494] [2023-08-23 22:41:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:06,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:41:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:41:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:41:06,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 294 [2023-08-23 22:41:06,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-08-23 22:41:06,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:06,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 294 [2023-08-23 22:41:06,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:06,891 INFO L124 PetriNetUnfolderBase]: 573/1102 cut-off events. [2023-08-23 22:41:06,892 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2023-08-23 22:41:06,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1102 events. 573/1102 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4907 event pairs, 98 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1698. Up to 785 conditions per place. [2023-08-23 22:41:06,897 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 46 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-23 22:41:06,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 329 flow [2023-08-23 22:41:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:41:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:41:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-23 22:41:06,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2023-08-23 22:41:06,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-23 22:41:06,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-23 22:41:06,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:06,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-23 22:41:06,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-08-23 22:41:06,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:06,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 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-08-23 22:41:06,903 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 280 flow. Second operand 3 states and 450 transitions. [2023-08-23 22:41:06,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 329 flow [2023-08-23 22:41:06,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 317 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-23 22:41:06,907 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 204 flow [2023-08-23 22:41:06,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-08-23 22:41:06,909 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-23 22:41:06,909 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 204 flow [2023-08-23 22:41:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-08-23 22:41:06,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:06,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:41:06,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:06,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1417362489, now seen corresponding path program 1 times [2023-08-23 22:41:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073422088] [2023-08-23 22:41:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:06,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:06,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073422088] [2023-08-23 22:41:06,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073422088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:06,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:41:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018791992] [2023-08-23 22:41:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:06,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:41:06,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:06,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:41:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:41:06,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2023-08-23 22:41:07,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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-08-23 22:41:07,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:07,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2023-08-23 22:41:07,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:07,248 INFO L124 PetriNetUnfolderBase]: 679/1270 cut-off events. [2023-08-23 22:41:07,248 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2023-08-23 22:41:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3196 conditions, 1270 events. 679/1270 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5464 event pairs, 209 based on Foata normal form. 18/1288 useless extension candidates. Maximal degree in co-relation 2552. Up to 666 conditions per place. [2023-08-23 22:41:07,255 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 78 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2023-08-23 22:41:07,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 93 transitions, 524 flow [2023-08-23 22:41:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:41:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:41:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2023-08-23 22:41:07,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2023-08-23 22:41:07,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 896 transitions. [2023-08-23 22:41:07,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions. [2023-08-23 22:41:07,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:07,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions. [2023-08-23 22:41:07,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 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-08-23 22:41:07,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-08-23 22:41:07,264 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-08-23 22:41:07,264 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 204 flow. Second operand 6 states and 896 transitions. [2023-08-23 22:41:07,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 93 transitions, 524 flow [2023-08-23 22:41:07,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:41:07,268 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 271 flow [2023-08-23 22:41:07,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-23 22:41:07,269 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2023-08-23 22:41:07,269 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 271 flow [2023-08-23 22:41:07,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 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-08-23 22:41:07,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:07,270 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] [2023-08-23 22:41:07,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:41:07,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:07,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash 256939556, now seen corresponding path program 1 times [2023-08-23 22:41:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492805900] [2023-08-23 22:41:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492805900] [2023-08-23 22:41:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492805900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-23 22:41:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994896] [2023-08-23 22:41:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:07,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-23 22:41:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-23 22:41:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-23 22:41:07,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 294 [2023-08-23 22:41:07,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 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-08-23 22:41:07,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:07,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 294 [2023-08-23 22:41:07,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:08,400 INFO L124 PetriNetUnfolderBase]: 975/1854 cut-off events. [2023-08-23 22:41:08,400 INFO L125 PetriNetUnfolderBase]: For 1249/1249 co-relation queries the response was YES. [2023-08-23 22:41:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 1854 events. 975/1854 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9331 event pairs, 295 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 3621. Up to 1030 conditions per place. [2023-08-23 22:41:08,409 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 106 selfloop transitions, 10 changer transitions 3/124 dead transitions. [2023-08-23 22:41:08,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 771 flow [2023-08-23 22:41:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 22:41:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 22:41:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-08-23 22:41:08,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111394557823129 [2023-08-23 22:41:08,412 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-08-23 22:41:08,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-08-23 22:41:08,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:08,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-08-23 22:41:08,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 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-08-23 22:41:08,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 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-08-23 22:41:08,418 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 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-08-23 22:41:08,418 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 271 flow. Second operand 8 states and 967 transitions. [2023-08-23 22:41:08,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 771 flow [2023-08-23 22:41:08,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 124 transitions, 748 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-23 22:41:08,422 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 327 flow [2023-08-23 22:41:08,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-08-23 22:41:08,423 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-23 22:41:08,423 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 327 flow [2023-08-23 22:41:08,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 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-08-23 22:41:08,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:08,424 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] [2023-08-23 22:41:08,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:41:08,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:08,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1974860314, now seen corresponding path program 2 times [2023-08-23 22:41:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480925214] [2023-08-23 22:41:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:41:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480925214] [2023-08-23 22:41:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480925214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-23 22:41:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138040435] [2023-08-23 22:41:08,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:08,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-23 22:41:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-23 22:41:08,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-23 22:41:08,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 294 [2023-08-23 22:41:08,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 327 flow. Second operand has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 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-08-23 22:41:08,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:08,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 294 [2023-08-23 22:41:08,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:09,655 INFO L124 PetriNetUnfolderBase]: 1273/2412 cut-off events. [2023-08-23 22:41:09,656 INFO L125 PetriNetUnfolderBase]: For 1456/1456 co-relation queries the response was YES. [2023-08-23 22:41:09,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6462 conditions, 2412 events. 1273/2412 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12235 event pairs, 356 based on Foata normal form. 0/2383 useless extension candidates. Maximal degree in co-relation 4242. Up to 965 conditions per place. [2023-08-23 22:41:09,668 INFO L140 encePairwiseOnDemand]: 286/294 looper letters, 106 selfloop transitions, 14 changer transitions 3/128 dead transitions. [2023-08-23 22:41:09,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 843 flow [2023-08-23 22:41:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 22:41:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 22:41:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-08-23 22:41:09,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111394557823129 [2023-08-23 22:41:09,671 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-08-23 22:41:09,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-08-23 22:41:09,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:09,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-08-23 22:41:09,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 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-08-23 22:41:09,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 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-08-23 22:41:09,677 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 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-08-23 22:41:09,677 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 327 flow. Second operand 8 states and 967 transitions. [2023-08-23 22:41:09,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 843 flow [2023-08-23 22:41:09,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 843 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 22:41:09,684 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 405 flow [2023-08-23 22:41:09,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-23 22:41:09,685 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-23 22:41:09,685 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 405 flow [2023-08-23 22:41:09,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 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-08-23 22:41:09,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:09,685 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:09,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 22:41:09,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:09,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash 834917319, now seen corresponding path program 1 times [2023-08-23 22:41:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267743949] [2023-08-23 22:41:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:41:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-23 22:41:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:41:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267743949] [2023-08-23 22:41:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267743949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:41:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:41:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:41:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542292373] [2023-08-23 22:41:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:41:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:41:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:41:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:41:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:41:09,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 294 [2023-08-23 22:41:09,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-08-23 22:41:09,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:41:09,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 294 [2023-08-23 22:41:09,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:41:10,106 INFO L124 PetriNetUnfolderBase]: 1345/2519 cut-off events. [2023-08-23 22:41:10,106 INFO L125 PetriNetUnfolderBase]: For 1788/1788 co-relation queries the response was YES. [2023-08-23 22:41:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7088 conditions, 2519 events. 1345/2519 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 12306 event pairs, 540 based on Foata normal form. 16/2505 useless extension candidates. Maximal degree in co-relation 5066. Up to 992 conditions per place. [2023-08-23 22:41:10,123 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 108 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2023-08-23 22:41:10,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 124 transitions, 897 flow [2023-08-23 22:41:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:41:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:41:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1026 transitions. [2023-08-23 22:41:10,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2023-08-23 22:41:10,126 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1026 transitions. [2023-08-23 22:41:10,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1026 transitions. [2023-08-23 22:41:10,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:41:10,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1026 transitions. [2023-08-23 22:41:10,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.57142857142858) internal successors, (1026), 7 states have internal predecessors, (1026), 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-08-23 22:41:10,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-08-23 22:41:10,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-08-23 22:41:10,132 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 405 flow. Second operand 7 states and 1026 transitions. [2023-08-23 22:41:10,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 124 transitions, 897 flow [2023-08-23 22:41:10,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 873 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-23 22:41:10,141 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 515 flow [2023-08-23 22:41:10,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-08-23 22:41:10,141 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2023-08-23 22:41:10,142 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 515 flow [2023-08-23 22:41:10,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-08-23 22:41:10,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:41:10,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 22:41:10,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:41:10,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:41:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1564096500, now seen corresponding path program 1 times [2023-08-23 22:41:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:41:10,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955600575] [2023-08-23 22:41:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:41:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:41:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:41:10,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 22:41:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:41:10,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 22:41:10,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 22:41:10,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 22:41:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-08-23 22:41:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 22:41:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-23 22:41:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-23 22:41:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 22:41:10,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 22:41:10,214 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:41:10,219 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:41:10,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:41:10,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:41:10 BasicIcfg [2023-08-23 22:41:10,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:41:10,261 INFO L158 Benchmark]: Toolchain (without parser) took 11091.44ms. Allocated memory was 352.3MB in the beginning and 524.3MB in the end (delta: 172.0MB). Free memory was 327.1MB in the beginning and 256.7MB in the end (delta: 70.4MB). Peak memory consumption was 243.3MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,261 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:41:10,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.37ms. Allocated memory is still 352.3MB. Free memory was 327.1MB in the beginning and 297.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.67ms. Allocated memory is still 352.3MB. Free memory was 297.3MB in the beginning and 294.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,261 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 352.3MB. Free memory was 294.5MB in the beginning and 292.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,262 INFO L158 Benchmark]: RCFGBuilder took 491.17ms. Allocated memory is still 352.3MB. Free memory was 292.6MB in the beginning and 326.4MB in the end (delta: -33.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,262 INFO L158 Benchmark]: TraceAbstraction took 9824.91ms. Allocated memory was 352.3MB in the beginning and 524.3MB in the end (delta: 172.0MB). Free memory was 326.4MB in the beginning and 256.7MB in the end (delta: 69.8MB). Peak memory consumption was 241.5MB. Max. memory is 16.0GB. [2023-08-23 22:41:10,263 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 352.3MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 679.37ms. Allocated memory is still 352.3MB. Free memory was 327.1MB in the beginning and 297.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.67ms. Allocated memory is still 352.3MB. Free memory was 297.3MB in the beginning and 294.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 352.3MB. Free memory was 294.5MB in the beginning and 292.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 491.17ms. Allocated memory is still 352.3MB. Free memory was 292.6MB in the beginning and 326.4MB in the end (delta: -33.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. * TraceAbstraction took 9824.91ms. Allocated memory was 352.3MB in the beginning and 524.3MB in the end (delta: 172.0MB). Free memory was 326.4MB in the beginning and 256.7MB in the end (delta: 69.8MB). Peak memory consumption was 241.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] - GenericResultAtLocation [Line: 753]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [753] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 144 PlacesBefore, 35 PlacesAfterwards, 147 TransitionsBefore, 33 TransitionsAfterwards, 7334 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 5 ChoiceCompositions, 136 TotalNumberOfCompositions, 9508 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7052, independent: 6870, independent conditional: 0, independent unconditional: 6870, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4045, independent: 3996, independent conditional: 0, independent unconditional: 3996, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7052, independent: 2874, independent conditional: 0, independent unconditional: 2874, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 4045, unknown conditional: 0, unknown unconditional: 4045] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=9, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=10, top=0] [L991] COND TRUE 1 i<(800) [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L991] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=799, top=1] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 250 locations, 6 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: 9.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1668 IncrementalHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 0 mSDtfsCounter, 1668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1568 SizeOfPredicates, 1 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6/12 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-08-23 22:41:10,296 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...