/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/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:15:09,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:15:09,403 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:15:09,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:15:09,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:15:09,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:15:09,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:15:09,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:15:09,442 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:15:09,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:15:09,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:15:09,443 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:15:09,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:15:09,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:15:09,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:15:09,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:15:09,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:15:09,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:15:09,452 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:15:09,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:15:09,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:15:09,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:15:09,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:15:09,455 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:15:09,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:15:09,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:09,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:15:09,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:15:09,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:15:09,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:15:09,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:15:09,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:15:09,457 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:15:09,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:15:09,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:15:09,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:15:09,707 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:15:09,707 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:15:09,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-11-17 15:15:10,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:11,175 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:11,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-11-17 15:15:11,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c021d616/e91555e098814f7cbfbe4df3d0da0427/FLAG08873ad40 [2023-11-17 15:15:11,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c021d616/e91555e098814f7cbfbe4df3d0da0427 [2023-11-17 15:15:11,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:11,207 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:11,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:11,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:11,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:11,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555fd4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11, skipping insertion in model container [2023-11-17 15:15:11,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,265 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:11,392 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/mix036_pso.opt_tso.opt.i[956,969] [2023-11-17 15:15:11,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:11,633 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:11,642 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/mix036_pso.opt_tso.opt.i[956,969] [2023-11-17 15:15:11,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:11,698 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:11,699 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:11,705 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:11,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11 WrapperNode [2023-11-17 15:15:11,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:11,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:11,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:11,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:11,714 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:15:11" (1/1) ... [2023-11-17 15:15:11,728 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:15:11" (1/1) ... [2023-11-17 15:15:11,751 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-11-17 15:15:11,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:11,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:11,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:11,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:11,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:11,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:11,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:11,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:11,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (1/1) ... [2023-11-17 15:15:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:11,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:11,830 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:15:11,857 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:15:11,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:11,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:11,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:11,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:11,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:15:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:15:11,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:11,870 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:15:12,008 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:12,010 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:12,284 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:12,405 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:12,406 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:12,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:12 BoogieIcfgContainer [2023-11-17 15:15:12,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:12,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:12,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:12,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:12,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:11" (1/3) ... [2023-11-17 15:15:12,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d84e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:12, skipping insertion in model container [2023-11-17 15:15:12,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:11" (2/3) ... [2023-11-17 15:15:12,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d84e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:12, skipping insertion in model container [2023-11-17 15:15:12,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:12" (3/3) ... [2023-11-17 15:15:12,422 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-11-17 15:15:12,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:12,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:12,441 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:12,520 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:12,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 290 flow [2023-11-17 15:15:12,613 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2023-11-17 15:15:12,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:12,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:15:12,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 290 flow [2023-11-17 15:15:12,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2023-11-17 15:15:12,630 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:12,642 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2023-11-17 15:15:12,645 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2023-11-17 15:15:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2023-11-17 15:15:12,680 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2023-11-17 15:15:12,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:12,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:15:12,685 INFO L119 LiptonReduction]: Number of co-enabled transitions 3472 [2023-11-17 15:15:17,182 INFO L134 LiptonReduction]: Checked pairs total: 6664 [2023-11-17 15:15:17,182 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-11-17 15:15:17,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:17,202 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;@2a5beae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:17,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:15:17,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:17,208 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-17 15:15:17,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:17,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:17,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:17,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:17,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1104047267, now seen corresponding path program 1 times [2023-11-17 15:15:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560335735] [2023-11-17 15:15:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:17,692 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:15:17,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:17,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560335735] [2023-11-17 15:15:17,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560335735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:17,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:17,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541429431] [2023-11-17 15:15:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:17,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:17,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 256 [2023-11-17 15:15:17,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:15:17,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:17,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 256 [2023-11-17 15:15:17,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:18,333 INFO L124 PetriNetUnfolderBase]: 2857/4432 cut-off events. [2023-11-17 15:15:18,334 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-17 15:15:18,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 4432 events. 2857/4432 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25002 event pairs, 721 based on Foata normal form. 0/4235 useless extension candidates. Maximal degree in co-relation 8502. Up to 2857 conditions per place. [2023-11-17 15:15:18,373 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 15:15:18,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 158 flow [2023-11-17 15:15:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-11-17 15:15:18,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338541666666666 [2023-11-17 15:15:18,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-11-17 15:15:18,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-11-17 15:15:18,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:18,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-11-17 15:15:18,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:15:18,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:18,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:18,415 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 410 transitions. [2023-11-17 15:15:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 158 flow [2023-11-17 15:15:18,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:18,422 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-11-17 15:15:18,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 15:15:18,427 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-17 15:15:18,428 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-11-17 15:15:18,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:15:18,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:18,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:18,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:18,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 132547208, now seen corresponding path program 1 times [2023-11-17 15:15:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:18,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918686461] [2023-11-17 15:15:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:18,750 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:15:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918686461] [2023-11-17 15:15:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918686461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:18,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175928714] [2023-11-17 15:15:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:18,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 256 [2023-11-17 15:15:18,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:15:18,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:18,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 256 [2023-11-17 15:15:18,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:19,329 INFO L124 PetriNetUnfolderBase]: 4631/6320 cut-off events. [2023-11-17 15:15:19,329 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-17 15:15:19,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 6320 events. 4631/6320 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27283 event pairs, 1783 based on Foata normal form. 16/6336 useless extension candidates. Maximal degree in co-relation 13052. Up to 6129 conditions per place. [2023-11-17 15:15:19,409 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-11-17 15:15:19,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 184 flow [2023-11-17 15:15:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-17 15:15:19,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2023-11-17 15:15:19,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-17 15:15:19,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-17 15:15:19,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:19,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-17 15:15:19,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:15:19,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:19,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:19,418 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 387 transitions. [2023-11-17 15:15:19,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 184 flow [2023-11-17 15:15:19,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:19,420 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 91 flow [2023-11-17 15:15:19,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-17 15:15:19,421 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-17 15:15:19,421 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 91 flow [2023-11-17 15:15:19,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:15:19,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:19,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:19,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:19,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:19,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash 59206445, now seen corresponding path program 1 times [2023-11-17 15:15:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278352226] [2023-11-17 15:15:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:19,630 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:15:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278352226] [2023-11-17 15:15:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278352226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451253443] [2023-11-17 15:15:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:19,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:19,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:19,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:19,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 256 [2023-11-17 15:15:19,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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:15:19,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:19,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 256 [2023-11-17 15:15:19,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:20,216 INFO L124 PetriNetUnfolderBase]: 4279/5856 cut-off events. [2023-11-17 15:15:20,217 INFO L125 PetriNetUnfolderBase]: For 1145/1145 co-relation queries the response was YES. [2023-11-17 15:15:20,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 5856 events. 4279/5856 cut-off events. For 1145/1145 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24459 event pairs, 1331 based on Foata normal form. 112/5968 useless extension candidates. Maximal degree in co-relation 13624. Up to 4033 conditions per place. [2023-11-17 15:15:20,265 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-11-17 15:15:20,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 199 flow [2023-11-17 15:15:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-17 15:15:20,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2023-11-17 15:15:20,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-17 15:15:20,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-17 15:15:20,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:20,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-17 15:15:20,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:15:20,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:20,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 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:15:20,271 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 91 flow. Second operand 3 states and 382 transitions. [2023-11-17 15:15:20,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 199 flow [2023-11-17 15:15:20,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:20,273 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2023-11-17 15:15:20,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-17 15:15:20,275 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-17 15:15:20,275 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2023-11-17 15:15:20,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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:15:20,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:20,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:20,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:20,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:20,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1486934177, now seen corresponding path program 1 times [2023-11-17 15:15:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26741216] [2023-11-17 15:15:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:20,479 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:15:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26741216] [2023-11-17 15:15:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26741216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661097857] [2023-11-17 15:15:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:20,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:20,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2023-11-17 15:15:20,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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:15:20,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:20,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2023-11-17 15:15:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:20,919 INFO L124 PetriNetUnfolderBase]: 2849/4154 cut-off events. [2023-11-17 15:15:20,920 INFO L125 PetriNetUnfolderBase]: For 888/917 co-relation queries the response was YES. [2023-11-17 15:15:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9512 conditions, 4154 events. 2849/4154 cut-off events. For 888/917 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 20973 event pairs, 535 based on Foata normal form. 296/4307 useless extension candidates. Maximal degree in co-relation 9499. Up to 2725 conditions per place. [2023-11-17 15:15:20,940 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 56 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-11-17 15:15:20,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 335 flow [2023-11-17 15:15:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-11-17 15:15:20,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2023-11-17 15:15:20,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-11-17 15:15:20,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-11-17 15:15:20,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:20,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-11-17 15:15:20,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 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:15:20,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 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:15:20,948 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 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:15:20,948 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 5 states and 644 transitions. [2023-11-17 15:15:20,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 335 flow [2023-11-17 15:15:20,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:20,951 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 166 flow [2023-11-17 15:15:20,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-11-17 15:15:20,952 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-17 15:15:20,952 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 166 flow [2023-11-17 15:15:20,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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:15:20,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:20,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:20,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:20,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:20,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1176542889, now seen corresponding path program 1 times [2023-11-17 15:15:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479545063] [2023-11-17 15:15:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:21,089 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:15:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479545063] [2023-11-17 15:15:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479545063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994257928] [2023-11-17 15:15:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:21,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:21,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2023-11-17 15:15:21,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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:15:21,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:21,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2023-11-17 15:15:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:21,538 INFO L124 PetriNetUnfolderBase]: 2309/3491 cut-off events. [2023-11-17 15:15:21,538 INFO L125 PetriNetUnfolderBase]: For 2168/2257 co-relation queries the response was YES. [2023-11-17 15:15:21,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10579 conditions, 3491 events. 2309/3491 cut-off events. For 2168/2257 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 18111 event pairs, 253 based on Foata normal form. 232/3617 useless extension candidates. Maximal degree in co-relation 10563. Up to 1230 conditions per place. [2023-11-17 15:15:21,559 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 73 selfloop transitions, 19 changer transitions 1/98 dead transitions. [2023-11-17 15:15:21,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 556 flow [2023-11-17 15:15:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-11-17 15:15:21,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2023-11-17 15:15:21,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-11-17 15:15:21,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-11-17 15:15:21,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:21,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-11-17 15:15:21,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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:15:21,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 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:15:21,569 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 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:15:21,569 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 166 flow. Second operand 7 states and 903 transitions. [2023-11-17 15:15:21,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 556 flow [2023-11-17 15:15:21,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:21,576 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 293 flow [2023-11-17 15:15:21,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-17 15:15:21,577 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-11-17 15:15:21,577 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 293 flow [2023-11-17 15:15:21,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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:15:21,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:21,578 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:15:21,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:21,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:21,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1742246670, now seen corresponding path program 1 times [2023-11-17 15:15:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:21,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169671551] [2023-11-17 15:15:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:21,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:21,767 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:15:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:21,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169671551] [2023-11-17 15:15:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169671551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:21,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:21,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321946336] [2023-11-17 15:15:21,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:21,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:21,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:21,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2023-11-17 15:15:21,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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:15:21,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:21,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2023-11-17 15:15:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:22,243 INFO L124 PetriNetUnfolderBase]: 2071/3159 cut-off events. [2023-11-17 15:15:22,243 INFO L125 PetriNetUnfolderBase]: For 4797/5026 co-relation queries the response was YES. [2023-11-17 15:15:22,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11366 conditions, 3159 events. 2071/3159 cut-off events. For 4797/5026 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 16389 event pairs, 204 based on Foata normal form. 149/3211 useless extension candidates. Maximal degree in co-relation 11346. Up to 1137 conditions per place. [2023-11-17 15:15:22,264 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 80 selfloop transitions, 27 changer transitions 11/123 dead transitions. [2023-11-17 15:15:22,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 819 flow [2023-11-17 15:15:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:15:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:15:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1160 transitions. [2023-11-17 15:15:22,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2023-11-17 15:15:22,268 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1160 transitions. [2023-11-17 15:15:22,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1160 transitions. [2023-11-17 15:15:22,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:22,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1160 transitions. [2023-11-17 15:15:22,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.88888888888889) internal successors, (1160), 9 states have internal predecessors, (1160), 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:15:22,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 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:15:22,275 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 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:15:22,275 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 293 flow. Second operand 9 states and 1160 transitions. [2023-11-17 15:15:22,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 819 flow [2023-11-17 15:15:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 774 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:22,353 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 412 flow [2023-11-17 15:15:22,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-11-17 15:15:22,354 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-11-17 15:15:22,354 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 412 flow [2023-11-17 15:15:22,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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:15:22,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:22,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:22,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:22,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 700117604, now seen corresponding path program 1 times [2023-11-17 15:15:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:22,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448633520] [2023-11-17 15:15:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:22,585 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:15:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448633520] [2023-11-17 15:15:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448633520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125604289] [2023-11-17 15:15:22,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:22,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:22,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:22,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2023-11-17 15:15:22,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 412 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:15:22,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:22,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2023-11-17 15:15:22,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:23,237 INFO L124 PetriNetUnfolderBase]: 3706/5547 cut-off events. [2023-11-17 15:15:23,237 INFO L125 PetriNetUnfolderBase]: For 13761/13761 co-relation queries the response was YES. [2023-11-17 15:15:23,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20684 conditions, 5547 events. 3706/5547 cut-off events. For 13761/13761 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 29415 event pairs, 180 based on Foata normal form. 10/5557 useless extension candidates. Maximal degree in co-relation 20660. Up to 3409 conditions per place. [2023-11-17 15:15:23,261 INFO L140 encePairwiseOnDemand]: 248/256 looper letters, 87 selfloop transitions, 14 changer transitions 43/144 dead transitions. [2023-11-17 15:15:23,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 144 transitions, 1357 flow [2023-11-17 15:15:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-11-17 15:15:23,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984375 [2023-11-17 15:15:23,263 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-11-17 15:15:23,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-11-17 15:15:23,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:23,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-11-17 15:15:23,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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:15:23,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 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:15:23,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 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:15:23,268 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 412 flow. Second operand 5 states and 638 transitions. [2023-11-17 15:15:23,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 144 transitions, 1357 flow [2023-11-17 15:15:23,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 144 transitions, 1118 flow, removed 79 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:23,433 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 324 flow [2023-11-17 15:15:23,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-11-17 15:15:23,434 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-11-17 15:15:23,434 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 324 flow [2023-11-17 15:15:23,435 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:15:23,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:23,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:23,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:23,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:23,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1237512470, now seen corresponding path program 2 times [2023-11-17 15:15:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714947981] [2023-11-17 15:15:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:23,601 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:15:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714947981] [2023-11-17 15:15:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714947981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673398528] [2023-11-17 15:15:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:23,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:23,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:23,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:23,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2023-11-17 15:15:23,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:15:23,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:23,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2023-11-17 15:15:23,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,041 INFO L124 PetriNetUnfolderBase]: 2093/3253 cut-off events. [2023-11-17 15:15:24,041 INFO L125 PetriNetUnfolderBase]: For 5915/5915 co-relation queries the response was YES. [2023-11-17 15:15:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 3253 events. 2093/3253 cut-off events. For 5915/5915 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16077 event pairs, 317 based on Foata normal form. 10/3263 useless extension candidates. Maximal degree in co-relation 12663. Up to 1816 conditions per place. [2023-11-17 15:15:24,059 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 79 selfloop transitions, 14 changer transitions 35/128 dead transitions. [2023-11-17 15:15:24,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 128 transitions, 1013 flow [2023-11-17 15:15:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-11-17 15:15:24,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967447916666667 [2023-11-17 15:15:24,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-11-17 15:15:24,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-11-17 15:15:24,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-11-17 15:15:24,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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:15:24,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 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:15:24,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 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:15:24,068 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 324 flow. Second operand 6 states and 763 transitions. [2023-11-17 15:15:24,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 128 transitions, 1013 flow [2023-11-17 15:15:24,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 128 transitions, 967 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:24,104 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 371 flow [2023-11-17 15:15:24,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-11-17 15:15:24,106 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-11-17 15:15:24,106 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 371 flow [2023-11-17 15:15:24,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:15:24,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:24,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 669782612, now seen corresponding path program 3 times [2023-11-17 15:15:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664099241] [2023-11-17 15:15:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,302 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:15:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664099241] [2023-11-17 15:15:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664099241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320801907] [2023-11-17 15:15:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:24,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2023-11-17 15:15:24,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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:15:24,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2023-11-17 15:15:24,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,682 INFO L124 PetriNetUnfolderBase]: 1416/2314 cut-off events. [2023-11-17 15:15:24,682 INFO L125 PetriNetUnfolderBase]: For 4470/4658 co-relation queries the response was YES. [2023-11-17 15:15:24,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 2314 events. 1416/2314 cut-off events. For 4470/4658 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12536 event pairs, 217 based on Foata normal form. 132/2384 useless extension candidates. Maximal degree in co-relation 8805. Up to 812 conditions per place. [2023-11-17 15:15:24,692 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 54 selfloop transitions, 18 changer transitions 25/105 dead transitions. [2023-11-17 15:15:24,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 817 flow [2023-11-17 15:15:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2023-11-17 15:15:24,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49267578125 [2023-11-17 15:15:24,696 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2023-11-17 15:15:24,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2023-11-17 15:15:24,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2023-11-17 15:15:24,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 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:15:24,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 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:15:24,703 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 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:15:24,704 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 371 flow. Second operand 8 states and 1009 transitions. [2023-11-17 15:15:24,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 817 flow [2023-11-17 15:15:24,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 779 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:24,739 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 341 flow [2023-11-17 15:15:24,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=341, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-17 15:15:24,740 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-11-17 15:15:24,741 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 341 flow [2023-11-17 15:15:24,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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:15:24,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,743 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:15:24,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:24,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:24,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -747038880, now seen corresponding path program 1 times [2023-11-17 15:15:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775921836] [2023-11-17 15:15:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,915 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:15:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775921836] [2023-11-17 15:15:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775921836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834443836] [2023-11-17 15:15:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:24,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:24,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 256 [2023-11-17 15:15:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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:15:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 256 [2023-11-17 15:15:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:25,200 INFO L124 PetriNetUnfolderBase]: 1176/2000 cut-off events. [2023-11-17 15:15:25,201 INFO L125 PetriNetUnfolderBase]: For 5108/5181 co-relation queries the response was YES. [2023-11-17 15:15:25,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8313 conditions, 2000 events. 1176/2000 cut-off events. For 5108/5181 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10841 event pairs, 194 based on Foata normal form. 7/1965 useless extension candidates. Maximal degree in co-relation 8289. Up to 1121 conditions per place. [2023-11-17 15:15:25,211 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 39 selfloop transitions, 1 changer transitions 55/99 dead transitions. [2023-11-17 15:15:25,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 893 flow [2023-11-17 15:15:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-11-17 15:15:25,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185546875 [2023-11-17 15:15:25,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-11-17 15:15:25,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-11-17 15:15:25,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:25,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-11-17 15:15:25,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 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:15:25,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 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:15:25,217 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 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:15:25,217 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 341 flow. Second operand 4 states and 531 transitions. [2023-11-17 15:15:25,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 893 flow [2023-11-17 15:15:25,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 723 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-11-17 15:15:25,239 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 221 flow [2023-11-17 15:15:25,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-11-17 15:15:25,239 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-11-17 15:15:25,240 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 221 flow [2023-11-17 15:15:25,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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:15:25,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:25,240 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:15:25,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:25,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:25,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1213785514, now seen corresponding path program 2 times [2023-11-17 15:15:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370355738] [2023-11-17 15:15:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,424 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:15:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370355738] [2023-11-17 15:15:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370355738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401250175] [2023-11-17 15:15:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:25,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 256 [2023-11-17 15:15:25,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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:15:25,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 256 [2023-11-17 15:15:25,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:25,615 INFO L124 PetriNetUnfolderBase]: 595/1033 cut-off events. [2023-11-17 15:15:25,615 INFO L125 PetriNetUnfolderBase]: For 2017/2017 co-relation queries the response was YES. [2023-11-17 15:15:25,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1033 events. 595/1033 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5099 event pairs, 97 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 3735. Up to 502 conditions per place. [2023-11-17 15:15:25,620 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 44 selfloop transitions, 1 changer transitions 30/77 dead transitions. [2023-11-17 15:15:25,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 560 flow [2023-11-17 15:15:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-11-17 15:15:25,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2023-11-17 15:15:25,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-11-17 15:15:25,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-11-17 15:15:25,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:25,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-11-17 15:15:25,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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:15:25,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 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:15:25,627 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 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:15:25,627 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 221 flow. Second operand 4 states and 524 transitions. [2023-11-17 15:15:25,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 560 flow [2023-11-17 15:15:25,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 548 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:25,638 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 188 flow [2023-11-17 15:15:25,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-17 15:15:25,639 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-11-17 15:15:25,639 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 188 flow [2023-11-17 15:15:25,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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:15:25,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:25,640 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:15:25,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:15:25,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:25,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1430334560, now seen corresponding path program 3 times [2023-11-17 15:15:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183369763] [2023-11-17 15:15:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:26,100 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:15:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183369763] [2023-11-17 15:15:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183369763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397327296] [2023-11-17 15:15:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:26,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:26,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 256 [2023-11-17 15:15:26,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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:15:26,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:26,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 256 [2023-11-17 15:15:26,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,271 INFO L124 PetriNetUnfolderBase]: 411/732 cut-off events. [2023-11-17 15:15:26,272 INFO L125 PetriNetUnfolderBase]: For 1484/1485 co-relation queries the response was YES. [2023-11-17 15:15:26,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 732 events. 411/732 cut-off events. For 1484/1485 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3384 event pairs, 56 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 2631. Up to 292 conditions per place. [2023-11-17 15:15:26,274 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 35 selfloop transitions, 3 changer transitions 40/81 dead transitions. [2023-11-17 15:15:26,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 592 flow [2023-11-17 15:15:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-11-17 15:15:26,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2023-11-17 15:15:26,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-11-17 15:15:26,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-11-17 15:15:26,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-11-17 15:15:26,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 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:15:26,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 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:15:26,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 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:15:26,283 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 188 flow. Second operand 7 states and 880 transitions. [2023-11-17 15:15:26,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 592 flow [2023-11-17 15:15:26,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 584 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:26,290 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 195 flow [2023-11-17 15:15:26,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=195, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2023-11-17 15:15:26,291 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-11-17 15:15:26,291 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 195 flow [2023-11-17 15:15:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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:15:26,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:26,292 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:15:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:15:26,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:26,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -390274508, now seen corresponding path program 4 times [2023-11-17 15:15:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646199868] [2023-11-17 15:15:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:26,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:26,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:26,410 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:26,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:15:26,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:15:26,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:15:26,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:15:26,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:15:26,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:15:26,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:15:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:15:26,414 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:26,419 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:26,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:26,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:26,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:26,482 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:26,487 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:15:26,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:26 BasicIcfg [2023-11-17 15:15:26,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:26,513 INFO L158 Benchmark]: Toolchain (without parser) took 15306.41ms. Allocated memory was 269.5MB in the beginning and 700.4MB in the end (delta: 431.0MB). Free memory was 218.9MB in the beginning and 315.0MB in the end (delta: -96.0MB). Peak memory consumption was 336.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,513 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 181.4MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:26,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.89ms. Allocated memory is still 269.5MB. Free memory was 218.9MB in the beginning and 195.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.34ms. Allocated memory is still 269.5MB. Free memory was 195.9MB in the beginning and 193.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,514 INFO L158 Benchmark]: Boogie Preprocessor took 35.31ms. Allocated memory is still 269.5MB. Free memory was 193.2MB in the beginning and 191.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,514 INFO L158 Benchmark]: RCFGBuilder took 614.48ms. Allocated memory is still 269.5MB. Free memory was 191.2MB in the beginning and 156.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,514 INFO L158 Benchmark]: TraceAbstraction took 14098.12ms. Allocated memory was 269.5MB in the beginning and 700.4MB in the end (delta: 431.0MB). Free memory was 156.0MB in the beginning and 315.0MB in the end (delta: -159.0MB). Peak memory consumption was 273.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:26,515 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 181.4MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.89ms. Allocated memory is still 269.5MB. Free memory was 218.9MB in the beginning and 195.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.34ms. Allocated memory is still 269.5MB. Free memory was 195.9MB in the beginning and 193.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.31ms. Allocated memory is still 269.5MB. Free memory was 193.2MB in the beginning and 191.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 614.48ms. Allocated memory is still 269.5MB. Free memory was 191.2MB in the beginning and 156.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14098.12ms. Allocated memory was 269.5MB in the beginning and 700.4MB in the end (delta: 431.0MB). Free memory was 156.0MB in the beginning and 315.0MB in the end (delta: -159.0MB). Peak memory consumption was 273.1MB. 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: 4.5s, 144 PlacesBefore, 40 PlacesAfterwards, 133 TransitionsBefore, 28 TransitionsAfterwards, 3472 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 6664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4119, independent: 3951, independent conditional: 0, independent unconditional: 3951, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2512, independent: 2457, independent conditional: 0, independent unconditional: 2457, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2512, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4119, independent: 1494, independent conditional: 0, independent unconditional: 1494, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 2512, unknown conditional: 0, unknown unconditional: 2512] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 861]: 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: 863]: 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: 859]: 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, 175 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: 13.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 22 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=6, InterpolantAutomatonStates: 64, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:15:26,542 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...