/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:14:11,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:14:11,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:14:11,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:14:11,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:14:11,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:14:11,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:14:11,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:14:11,652 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:14:11,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:14:11,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:14:11,653 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:14:11,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:14:11,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:14:11,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:14:11,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:14:11,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:14:11,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:14:11,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:14:11,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:14:11,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:14:11,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:14:11,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:14:11,655 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:14:11,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:14:11,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:11,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:14:11,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:14:11,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:14:11,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:14:11,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:14:11,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:14:11,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:14:11,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:14:11,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:14:11,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:14:11,878 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:14:11,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:14:11,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:13,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:14:13,245 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:14:13,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:13,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601bd888b/d485c5dcd4eb4be39c736124812f5b57/FLAG132e10ca0 [2023-11-17 15:14:13,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601bd888b/d485c5dcd4eb4be39c736124812f5b57 [2023-11-17 15:14:13,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:14:13,272 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:14:13,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:13,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:14:13,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:14:13,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4893e7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13, skipping insertion in model container [2023-11-17 15:14:13,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:14:13,463 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-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:14:13,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:13,649 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:14:13,664 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-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:14:13,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:13,726 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:13,727 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:13,732 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:14:13,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13 WrapperNode [2023-11-17 15:14:13,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:13,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:13,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:14:13,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:14:13,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,783 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-17 15:14:13,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:13,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:14:13,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:14:13,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:14:13,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:14:13,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:14:13,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:14:13,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:14:13,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (1/1) ... [2023-11-17 15:14:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:14:13,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:14:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:14:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:14:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:14:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:14:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:14:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:14:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:14:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:14:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:14:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:14:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:14:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:14:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:14:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:14:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:14:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:14:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:14:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:14:13,932 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:14:14,061 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:14:14,062 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:14:14,385 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:14:14,489 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:14:14,489 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:14:14,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:14 BoogieIcfgContainer [2023-11-17 15:14:14,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:14:14,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:14:14,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:14:14,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:14:14,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:14:13" (1/3) ... [2023-11-17 15:14:14,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385497c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:14, skipping insertion in model container [2023-11-17 15:14:14,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:13" (2/3) ... [2023-11-17 15:14:14,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385497c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:14, skipping insertion in model container [2023-11-17 15:14:14,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:14" (3/3) ... [2023-11-17 15:14:14,498 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:14,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:14:14,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:14:14,512 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:14:14,573 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:14:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 284 flow [2023-11-17 15:14:14,671 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-17 15:14:14,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:14,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:14:14,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 134 transitions, 284 flow [2023-11-17 15:14:14,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 130 transitions, 272 flow [2023-11-17 15:14:14,689 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:14:14,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 130 transitions, 272 flow [2023-11-17 15:14:14,700 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 130 transitions, 272 flow [2023-11-17 15:14:14,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 130 transitions, 272 flow [2023-11-17 15:14:14,720 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-17 15:14:14,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:14,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:14:14,723 INFO L119 LiptonReduction]: Number of co-enabled transitions 3560 [2023-11-17 15:14:17,817 INFO L134 LiptonReduction]: Checked pairs total: 9547 [2023-11-17 15:14:17,817 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-17 15:14:17,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:14:17,855 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@233654b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:14:17,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:14:17,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:14:17,859 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:14:17,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:17,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:17,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:14:17,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:17,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash 561345, now seen corresponding path program 1 times [2023-11-17 15:14:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428325402] [2023-11-17 15:14:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428325402] [2023-11-17 15:14:18,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428325402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:18,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:18,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594298947] [2023-11-17 15:14:18,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:18,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:18,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2023-11-17 15:14:18,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:18,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2023-11-17 15:14:18,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:18,909 INFO L124 PetriNetUnfolderBase]: 4903/6758 cut-off events. [2023-11-17 15:14:18,909 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-17 15:14:18,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 6758 events. 4903/6758 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32801 event pairs, 2535 based on Foata normal form. 0/6422 useless extension candidates. Maximal degree in co-relation 13594. Up to 5335 conditions per place. [2023-11-17 15:14:18,935 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-17 15:14:18,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-11-17 15:14:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-11-17 15:14:18,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2023-11-17 15:14:18,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-11-17 15:14:18,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-11-17 15:14:18,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:18,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-11-17 15:14:18,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,956 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 399 transitions. [2023-11-17 15:14:18,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-11-17 15:14:18,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:14:18,959 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-17 15:14:18,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 15:14:18,963 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 15:14:18,963 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-17 15:14:18,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:18,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:18,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:14:18,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:18,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 711240117, now seen corresponding path program 1 times [2023-11-17 15:14:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693105804] [2023-11-17 15:14:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693105804] [2023-11-17 15:14:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693105804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:19,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:19,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027143687] [2023-11-17 15:14:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:19,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:19,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:19,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-17 15:14:19,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:19,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:19,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-17 15:14:19,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:20,790 INFO L124 PetriNetUnfolderBase]: 16407/22321 cut-off events. [2023-11-17 15:14:20,790 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2023-11-17 15:14:20,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46179 conditions, 22321 events. 16407/22321 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 117924 event pairs, 5637 based on Foata normal form. 634/22955 useless extension candidates. Maximal degree in co-relation 46169. Up to 13398 conditions per place. [2023-11-17 15:14:20,929 INFO L140 encePairwiseOnDemand]: 238/247 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-11-17 15:14:20,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-11-17 15:14:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-17 15:14:20,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993252361673414 [2023-11-17 15:14:20,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-17 15:14:20,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-17 15:14:20,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:20,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-17 15:14:20,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:20,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:20,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:20,941 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 370 transitions. [2023-11-17 15:14:20,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-11-17 15:14:20,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:20,944 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-11-17 15:14:20,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-17 15:14:20,945 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-17 15:14:20,946 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-11-17 15:14:20,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:20,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:20,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:20,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:14:20,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:20,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash 573604913, now seen corresponding path program 1 times [2023-11-17 15:14:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848846737] [2023-11-17 15:14:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848846737] [2023-11-17 15:14:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848846737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:21,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170069222] [2023-11-17 15:14:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:21,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:21,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-17 15:14:21,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:21,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:21,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-17 15:14:21,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:22,857 INFO L124 PetriNetUnfolderBase]: 15212/20712 cut-off events. [2023-11-17 15:14:22,858 INFO L125 PetriNetUnfolderBase]: For 8898/8898 co-relation queries the response was YES. [2023-11-17 15:14:22,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51966 conditions, 20712 events. 15212/20712 cut-off events. For 8898/8898 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 105787 event pairs, 3999 based on Foata normal form. 225/20937 useless extension candidates. Maximal degree in co-relation 51954. Up to 8783 conditions per place. [2023-11-17 15:14:22,954 INFO L140 encePairwiseOnDemand]: 239/247 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-11-17 15:14:22,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 340 flow [2023-11-17 15:14:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-11-17 15:14:22,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898785425101215 [2023-11-17 15:14:22,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-11-17 15:14:22,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-11-17 15:14:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-11-17 15:14:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:22,960 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:22,960 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 484 transitions. [2023-11-17 15:14:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 340 flow [2023-11-17 15:14:22,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:23,000 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2023-11-17 15:14:23,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-11-17 15:14:23,001 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-17 15:14:23,001 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 168 flow [2023-11-17 15:14:23,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:23,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:23,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:23,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:14:23,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:23,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 534277697, now seen corresponding path program 1 times [2023-11-17 15:14:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524636480] [2023-11-17 15:14:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524636480] [2023-11-17 15:14:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524636480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856603424] [2023-11-17 15:14:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:23,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-17 15:14:23,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:23,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:23,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-17 15:14:23,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:24,611 INFO L124 PetriNetUnfolderBase]: 14954/20366 cut-off events. [2023-11-17 15:14:24,612 INFO L125 PetriNetUnfolderBase]: For 12915/12915 co-relation queries the response was YES. [2023-11-17 15:14:24,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53989 conditions, 20366 events. 14954/20366 cut-off events. For 12915/12915 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 106506 event pairs, 2854 based on Foata normal form. 40/20406 useless extension candidates. Maximal degree in co-relation 53974. Up to 11586 conditions per place. [2023-11-17 15:14:24,779 INFO L140 encePairwiseOnDemand]: 238/247 looper letters, 65 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2023-11-17 15:14:24,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 490 flow [2023-11-17 15:14:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-11-17 15:14:24,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020242914979757 [2023-11-17 15:14:24,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-11-17 15:14:24,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-11-17 15:14:24,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:24,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-11-17 15:14:24,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:24,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:24,784 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:24,784 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 168 flow. Second operand 4 states and 496 transitions. [2023-11-17 15:14:24,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 490 flow [2023-11-17 15:14:24,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:24,838 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 322 flow [2023-11-17 15:14:24,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2023-11-17 15:14:24,839 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-11-17 15:14:24,839 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 322 flow [2023-11-17 15:14:24,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:24,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:24,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:24,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:14:24,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:24,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1478439179, now seen corresponding path program 1 times [2023-11-17 15:14:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529735606] [2023-11-17 15:14:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529735606] [2023-11-17 15:14:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529735606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609867749] [2023-11-17 15:14:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:24,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:24,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2023-11-17 15:14:24,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:24,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:24,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2023-11-17 15:14:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:26,533 INFO L124 PetriNetUnfolderBase]: 9343/13845 cut-off events. [2023-11-17 15:14:26,533 INFO L125 PetriNetUnfolderBase]: For 18139/19462 co-relation queries the response was YES. [2023-11-17 15:14:26,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37418 conditions, 13845 events. 9343/13845 cut-off events. For 18139/19462 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 87469 event pairs, 1512 based on Foata normal form. 1258/14772 useless extension candidates. Maximal degree in co-relation 37399. Up to 8492 conditions per place. [2023-11-17 15:14:26,601 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 96 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2023-11-17 15:14:26,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 123 transitions, 920 flow [2023-11-17 15:14:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-11-17 15:14:26,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491497975708502 [2023-11-17 15:14:26,604 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-11-17 15:14:26,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-11-17 15:14:26,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:26,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-11-17 15:14:26,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:26,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:26,608 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:26,608 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 322 flow. Second operand 5 states and 607 transitions. [2023-11-17 15:14:26,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 123 transitions, 920 flow [2023-11-17 15:14:26,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:14:26,629 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 397 flow [2023-11-17 15:14:26,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2023-11-17 15:14:26,631 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-11-17 15:14:26,631 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 397 flow [2023-11-17 15:14:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:26,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:26,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:14:26,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:26,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1960076370, now seen corresponding path program 1 times [2023-11-17 15:14:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340905499] [2023-11-17 15:14:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340905499] [2023-11-17 15:14:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340905499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573017426] [2023-11-17 15:14:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:26,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:26,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2023-11-17 15:14:26,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 397 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:26,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:26,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2023-11-17 15:14:26,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:27,909 INFO L124 PetriNetUnfolderBase]: 7490/11429 cut-off events. [2023-11-17 15:14:27,909 INFO L125 PetriNetUnfolderBase]: For 19140/20129 co-relation queries the response was YES. [2023-11-17 15:14:27,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38391 conditions, 11429 events. 7490/11429 cut-off events. For 19140/20129 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 73669 event pairs, 810 based on Foata normal form. 848/11999 useless extension candidates. Maximal degree in co-relation 38367. Up to 3458 conditions per place. [2023-11-17 15:14:27,960 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 130 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2023-11-17 15:14:27,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 166 transitions, 1319 flow [2023-11-17 15:14:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-11-17 15:14:27,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927703875072296 [2023-11-17 15:14:27,963 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-11-17 15:14:27,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-11-17 15:14:27,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:27,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-11-17 15:14:27,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:27,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:27,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:27,968 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 397 flow. Second operand 7 states and 852 transitions. [2023-11-17 15:14:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 166 transitions, 1319 flow [2023-11-17 15:14:28,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 166 transitions, 1314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:28,013 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 526 flow [2023-11-17 15:14:28,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-11-17 15:14:28,014 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-11-17 15:14:28,014 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 526 flow [2023-11-17 15:14:28,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:28,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:28,014 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] [2023-11-17 15:14:28,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:14:28,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:28,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 289306190, now seen corresponding path program 1 times [2023-11-17 15:14:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213313388] [2023-11-17 15:14:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213313388] [2023-11-17 15:14:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213313388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271423004] [2023-11-17 15:14:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:28,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:28,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:28,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-17 15:14:28,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:28,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:28,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-17 15:14:28,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:30,119 INFO L124 PetriNetUnfolderBase]: 14776/21460 cut-off events. [2023-11-17 15:14:30,120 INFO L125 PetriNetUnfolderBase]: For 71835/71835 co-relation queries the response was YES. [2023-11-17 15:14:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88304 conditions, 21460 events. 14776/21460 cut-off events. For 71835/71835 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 129878 event pairs, 3341 based on Foata normal form. 76/21536 useless extension candidates. Maximal degree in co-relation 88276. Up to 9826 conditions per place. [2023-11-17 15:14:30,285 INFO L140 encePairwiseOnDemand]: 238/247 looper letters, 90 selfloop transitions, 23 changer transitions 36/149 dead transitions. [2023-11-17 15:14:30,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 1398 flow [2023-11-17 15:14:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-11-17 15:14:30,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050607287449392 [2023-11-17 15:14:30,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-11-17 15:14:30,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-11-17 15:14:30,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:30,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-11-17 15:14:30,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:30,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:30,290 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:30,290 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 526 flow. Second operand 4 states and 499 transitions. [2023-11-17 15:14:30,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 1398 flow [2023-11-17 15:14:31,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 1252 flow, removed 51 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:31,329 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 569 flow [2023-11-17 15:14:31,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=569, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-11-17 15:14:31,330 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-11-17 15:14:31,330 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 569 flow [2023-11-17 15:14:31,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:31,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:31,331 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] [2023-11-17 15:14:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:14:31,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:31,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1179812925, now seen corresponding path program 1 times [2023-11-17 15:14:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622309846] [2023-11-17 15:14:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622309846] [2023-11-17 15:14:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622309846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:14:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654765996] [2023-11-17 15:14:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:31,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:31,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2023-11-17 15:14:31,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 569 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:31,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:31,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2023-11-17 15:14:31,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:32,157 INFO L124 PetriNetUnfolderBase]: 3975/6374 cut-off events. [2023-11-17 15:14:32,158 INFO L125 PetriNetUnfolderBase]: For 19074/19429 co-relation queries the response was YES. [2023-11-17 15:14:32,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22997 conditions, 6374 events. 3975/6374 cut-off events. For 19074/19429 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39933 event pairs, 825 based on Foata normal form. 392/6591 useless extension candidates. Maximal degree in co-relation 22966. Up to 2143 conditions per place. [2023-11-17 15:14:32,189 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 114 selfloop transitions, 18 changer transitions 18/170 dead transitions. [2023-11-17 15:14:32,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 170 transitions, 1673 flow [2023-11-17 15:14:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-11-17 15:14:32,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4933487565066512 [2023-11-17 15:14:32,192 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-11-17 15:14:32,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-11-17 15:14:32,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:32,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-11-17 15:14:32,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,196 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,196 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 569 flow. Second operand 7 states and 853 transitions. [2023-11-17 15:14:32,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 170 transitions, 1673 flow [2023-11-17 15:14:32,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 170 transitions, 1623 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:32,222 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 691 flow [2023-11-17 15:14:32,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-11-17 15:14:32,222 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-11-17 15:14:32,222 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 691 flow [2023-11-17 15:14:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:32,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:14:32,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:32,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 532792684, now seen corresponding path program 1 times [2023-11-17 15:14:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261269879] [2023-11-17 15:14:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261269879] [2023-11-17 15:14:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261269879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919112189] [2023-11-17 15:14:32,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:32,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:32,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2023-11-17 15:14:32,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:32,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2023-11-17 15:14:32,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:34,082 INFO L124 PetriNetUnfolderBase]: 6505/10734 cut-off events. [2023-11-17 15:14:34,082 INFO L125 PetriNetUnfolderBase]: For 37508/37798 co-relation queries the response was YES. [2023-11-17 15:14:34,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44185 conditions, 10734 events. 6505/10734 cut-off events. For 37508/37798 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 76082 event pairs, 1265 based on Foata normal form. 63/10633 useless extension candidates. Maximal degree in co-relation 44152. Up to 5161 conditions per place. [2023-11-17 15:14:34,154 INFO L140 encePairwiseOnDemand]: 239/247 looper letters, 117 selfloop transitions, 9 changer transitions 67/213 dead transitions. [2023-11-17 15:14:34,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 213 transitions, 2257 flow [2023-11-17 15:14:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-11-17 15:14:34,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950838635049161 [2023-11-17 15:14:34,157 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-11-17 15:14:34,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-11-17 15:14:34,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:34,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-11-17 15:14:34,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,161 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 691 flow. Second operand 7 states and 856 transitions. [2023-11-17 15:14:34,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 213 transitions, 2257 flow [2023-11-17 15:14:34,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 1951 flow, removed 124 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:34,694 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 695 flow [2023-11-17 15:14:34,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=695, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2023-11-17 15:14:34,695 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-11-17 15:14:34,696 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 695 flow [2023-11-17 15:14:34,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:34,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:14:34,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:34,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash -244050658, now seen corresponding path program 2 times [2023-11-17 15:14:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33520472] [2023-11-17 15:14:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33520472] [2023-11-17 15:14:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33520472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:35,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:35,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:14:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99242469] [2023-11-17 15:14:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:35,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:14:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:14:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:14:35,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2023-11-17 15:14:35,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 695 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:35,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2023-11-17 15:14:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:36,901 INFO L124 PetriNetUnfolderBase]: 7306/12075 cut-off events. [2023-11-17 15:14:36,917 INFO L125 PetriNetUnfolderBase]: For 36819/37696 co-relation queries the response was YES. [2023-11-17 15:14:36,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48580 conditions, 12075 events. 7306/12075 cut-off events. For 36819/37696 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 86840 event pairs, 1973 based on Foata normal form. 293/12149 useless extension candidates. Maximal degree in co-relation 48543. Up to 7583 conditions per place. [2023-11-17 15:14:37,010 INFO L140 encePairwiseOnDemand]: 239/247 looper letters, 133 selfloop transitions, 14 changer transitions 28/195 dead transitions. [2023-11-17 15:14:37,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 195 transitions, 1868 flow [2023-11-17 15:14:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:14:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:14:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-11-17 15:14:37,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006747638326585 [2023-11-17 15:14:37,026 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-11-17 15:14:37,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-11-17 15:14:37,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:37,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-11-17 15:14:37,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,031 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,031 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 695 flow. Second operand 6 states and 742 transitions. [2023-11-17 15:14:37,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 195 transitions, 1868 flow [2023-11-17 15:14:37,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 195 transitions, 1861 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:37,692 INFO L231 Difference]: Finished difference. Result has 82 places, 92 transitions, 860 flow [2023-11-17 15:14:37,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2023-11-17 15:14:37,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-11-17 15:14:37,693 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 860 flow [2023-11-17 15:14:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:37,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:14:37,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:37,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2126682631, now seen corresponding path program 1 times [2023-11-17 15:14:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160172050] [2023-11-17 15:14:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160172050] [2023-11-17 15:14:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160172050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222473966] [2023-11-17 15:14:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:37,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:37,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-11-17 15:14:37,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 860 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:37,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-11-17 15:14:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:39,738 INFO L124 PetriNetUnfolderBase]: 12215/20258 cut-off events. [2023-11-17 15:14:39,738 INFO L125 PetriNetUnfolderBase]: For 82570/83354 co-relation queries the response was YES. [2023-11-17 15:14:39,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90738 conditions, 20258 events. 12215/20258 cut-off events. For 82570/83354 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 157357 event pairs, 2489 based on Foata normal form. 198/20289 useless extension candidates. Maximal degree in co-relation 90697. Up to 9355 conditions per place. [2023-11-17 15:14:39,874 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 106 selfloop transitions, 2 changer transitions 70/194 dead transitions. [2023-11-17 15:14:39,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 194 transitions, 2034 flow [2023-11-17 15:14:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-11-17 15:14:39,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151821862348178 [2023-11-17 15:14:39,876 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-11-17 15:14:39,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-11-17 15:14:39,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:39,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-11-17 15:14:39,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:39,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:39,879 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:39,879 INFO L175 Difference]: Start difference. First operand has 82 places, 92 transitions, 860 flow. Second operand 4 states and 509 transitions. [2023-11-17 15:14:39,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 194 transitions, 2034 flow [2023-11-17 15:14:40,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 194 transitions, 1982 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:40,915 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 792 flow [2023-11-17 15:14:40,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=792, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2023-11-17 15:14:40,916 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-11-17 15:14:40,916 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 792 flow [2023-11-17 15:14:40,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:40,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:40,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:40,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:14:40,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:40,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -604710355, now seen corresponding path program 2 times [2023-11-17 15:14:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:40,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135597731] [2023-11-17 15:14:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135597731] [2023-11-17 15:14:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135597731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:14:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854927873] [2023-11-17 15:14:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:14:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:14:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:14:41,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2023-11-17 15:14:41,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 792 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:41,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:41,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2023-11-17 15:14:41,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:43,099 INFO L124 PetriNetUnfolderBase]: 9788/16571 cut-off events. [2023-11-17 15:14:43,099 INFO L125 PetriNetUnfolderBase]: For 63644/65087 co-relation queries the response was YES. [2023-11-17 15:14:43,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72611 conditions, 16571 events. 9788/16571 cut-off events. For 63644/65087 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 133711 event pairs, 924 based on Foata normal form. 504/16797 useless extension candidates. Maximal degree in co-relation 72568. Up to 5397 conditions per place. [2023-11-17 15:14:43,264 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 77 selfloop transitions, 17 changer transitions 105/208 dead transitions. [2023-11-17 15:14:43,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 208 transitions, 2213 flow [2023-11-17 15:14:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:14:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:14:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions. [2023-11-17 15:14:43,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47908232118758437 [2023-11-17 15:14:43,279 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions. [2023-11-17 15:14:43,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions. [2023-11-17 15:14:43,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:43,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions. [2023-11-17 15:14:43,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:43,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:43,283 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:43,283 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 792 flow. Second operand 9 states and 1065 transitions. [2023-11-17 15:14:43,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 208 transitions, 2213 flow [2023-11-17 15:14:44,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 208 transitions, 2182 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:44,596 INFO L231 Difference]: Finished difference. Result has 95 places, 61 transitions, 549 flow [2023-11-17 15:14:44,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=95, PETRI_TRANSITIONS=61} [2023-11-17 15:14:44,597 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2023-11-17 15:14:44,597 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 61 transitions, 549 flow [2023-11-17 15:14:44,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:44,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:44,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:44,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:14:44,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:44,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2065219053, now seen corresponding path program 1 times [2023-11-17 15:14:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675439938] [2023-11-17 15:14:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675439938] [2023-11-17 15:14:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675439938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084730229] [2023-11-17 15:14:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:44,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:44,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-17 15:14:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 61 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-17 15:14:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:45,125 INFO L124 PetriNetUnfolderBase]: 2144/3458 cut-off events. [2023-11-17 15:14:45,125 INFO L125 PetriNetUnfolderBase]: For 15783/15783 co-relation queries the response was YES. [2023-11-17 15:14:45,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16674 conditions, 3458 events. 2144/3458 cut-off events. For 15783/15783 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18206 event pairs, 524 based on Foata normal form. 1/3459 useless extension candidates. Maximal degree in co-relation 16638. Up to 1681 conditions per place. [2023-11-17 15:14:45,142 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 64 selfloop transitions, 4 changer transitions 40/108 dead transitions. [2023-11-17 15:14:45,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 108 transitions, 1110 flow [2023-11-17 15:14:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-11-17 15:14:45,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48785425101214575 [2023-11-17 15:14:45,144 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-11-17 15:14:45,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-11-17 15:14:45,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:45,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-11-17 15:14:45,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,147 INFO L175 Difference]: Start difference. First operand has 95 places, 61 transitions, 549 flow. Second operand 4 states and 482 transitions. [2023-11-17 15:14:45,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 108 transitions, 1110 flow [2023-11-17 15:14:45,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 908 flow, removed 40 selfloop flow, removed 19 redundant places. [2023-11-17 15:14:45,192 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 296 flow [2023-11-17 15:14:45,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2023-11-17 15:14:45,192 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-11-17 15:14:45,192 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 296 flow [2023-11-17 15:14:45,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:45,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:45,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:14:45,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:45,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2048075771, now seen corresponding path program 2 times [2023-11-17 15:14:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31687740] [2023-11-17 15:14:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31687740] [2023-11-17 15:14:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31687740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:14:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841854588] [2023-11-17 15:14:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:45,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:14:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:14:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:14:45,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247 [2023-11-17 15:14:45,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 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-11-17 15:14:45,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:45,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247 [2023-11-17 15:14:45,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:45,962 INFO L124 PetriNetUnfolderBase]: 600/1024 cut-off events. [2023-11-17 15:14:45,963 INFO L125 PetriNetUnfolderBase]: For 2106/2149 co-relation queries the response was YES. [2023-11-17 15:14:45,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 1024 events. 600/1024 cut-off events. For 2106/2149 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4412 event pairs, 74 based on Foata normal form. 4/1027 useless extension candidates. Maximal degree in co-relation 4191. Up to 394 conditions per place. [2023-11-17 15:14:45,967 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 61 selfloop transitions, 6 changer transitions 44/115 dead transitions. [2023-11-17 15:14:45,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 115 transitions, 896 flow [2023-11-17 15:14:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-11-17 15:14:45,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794679005205321 [2023-11-17 15:14:45,969 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-11-17 15:14:45,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-11-17 15:14:45,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:45,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-11-17 15:14:45,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:45,973 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 296 flow. Second operand 7 states and 829 transitions. [2023-11-17 15:14:45,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 115 transitions, 896 flow [2023-11-17 15:14:45,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 115 transitions, 811 flow, removed 15 selfloop flow, removed 14 redundant places. [2023-11-17 15:14:45,979 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 285 flow [2023-11-17 15:14:45,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-11-17 15:14:45,980 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-11-17 15:14:45,980 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 285 flow [2023-11-17 15:14:45,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 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-11-17 15:14:45,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:45,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:45,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:14:45,981 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:45,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -684823563, now seen corresponding path program 3 times [2023-11-17 15:14:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117864171] [2023-11-17 15:14:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:46,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:14:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:46,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:14:46,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:14:46,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:14:46,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:14:46,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:14:46,122 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:46,126 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:14:46,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:14:46,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:14:46,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:14:46,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:14:46,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:14:46,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:14:46 BasicIcfg [2023-11-17 15:14:46,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:14:46,211 INFO L158 Benchmark]: Toolchain (without parser) took 32939.35ms. Allocated memory was 177.2MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 127.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-11-17 15:14:46,211 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 177.2MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:14:46,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.01ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 102.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:46,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 177.2MB. Free memory was 102.7MB in the beginning and 100.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:46,212 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 177.2MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:46,212 INFO L158 Benchmark]: RCFGBuilder took 675.44ms. Allocated memory was 177.2MB in the beginning and 295.7MB in the end (delta: 118.5MB). Free memory was 97.9MB in the beginning and 235.3MB in the end (delta: -137.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2023-11-17 15:14:46,212 INFO L158 Benchmark]: TraceAbstraction took 31717.89ms. Allocated memory was 295.7MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 234.2MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2023-11-17 15:14:46,213 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.21ms. Allocated memory is still 177.2MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 460.01ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 102.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 177.2MB. Free memory was 102.7MB in the beginning and 100.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 177.2MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 675.44ms. Allocated memory was 177.2MB in the beginning and 295.7MB in the end (delta: 118.5MB). Free memory was 97.9MB in the beginning and 235.3MB in the end (delta: -137.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * TraceAbstraction took 31717.89ms. Allocated memory was 295.7MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 234.2MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 140 PlacesBefore, 43 PlacesAfterwards, 130 TransitionsBefore, 31 TransitionsAfterwards, 3560 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 9547 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4296, independent: 4051, independent conditional: 0, independent unconditional: 4051, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2541, independent: 2464, independent conditional: 0, independent unconditional: 2464, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2541, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 371, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4296, independent: 1587, independent conditional: 0, independent unconditional: 1587, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 2541, unknown conditional: 0, unknown unconditional: 2541] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t713={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t713={5:0}, t714={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t715; [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 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: 31.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 26 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=10, InterpolantAutomatonStates: 74, 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.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:14:46,244 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...