/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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:17:43,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:17:43,842 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:17:43,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:17:43,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:17:43,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:17:43,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:17:43,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:17:43,860 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:17:43,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:17:43,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:17:43,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:17:43,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:17:43,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:17:43,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:17:43,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:17:43,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:17:43,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:17:43,863 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:17:43,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:17:43,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:17:43,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:17:43,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:17:43,864 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:17:43,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:17:43,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:43,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:17:43,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:17:43,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:17:43,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:17:43,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:17:43,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:17:43,866 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:17:44,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:17:44,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:17:44,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:17:44,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:17:44,028 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:17:44,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:17:45,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:17:45,315 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:17:45,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:17:45,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811949eb0/d5c6706dcbbe4d2da466227ef2b444e7/FLAG3a18064d1 [2023-11-17 15:17:45,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811949eb0/d5c6706dcbbe4d2da466227ef2b444e7 [2023-11-17 15:17:45,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:17:45,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:17:45,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:45,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:17:45,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:17:45,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3494af43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45, skipping insertion in model container [2023-11-17 15:17:45,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:17:45,514 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 15:17:45,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:45,699 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:17:45,707 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 15:17:45,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:45,792 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:45,792 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:45,797 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:17:45,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45 WrapperNode [2023-11-17 15:17:45,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:45,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:45,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:17:45,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:17:45,805 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:17:45" (1/1) ... [2023-11-17 15:17:45,822 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:17:45" (1/1) ... [2023-11-17 15:17:45,843 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-17 15:17:45,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:45,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:17:45,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:17:45,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:17:45,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:17:45,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:17:45,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:17:45,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:17:45,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (1/1) ... [2023-11-17 15:17:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:45,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:17:45,919 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:17:45,934 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:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:17:45,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:17:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:17:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:17:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:17:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:17:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:17:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:17:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:17:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:17:45,941 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:17:46,036 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:17:46,038 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:17:46,276 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:17:46,368 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:17:46,368 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:17:46,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:46 BoogieIcfgContainer [2023-11-17 15:17:46,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:17:46,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:17:46,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:17:46,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:17:46,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:17:45" (1/3) ... [2023-11-17 15:17:46,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9bdf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:46, skipping insertion in model container [2023-11-17 15:17:46,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:45" (2/3) ... [2023-11-17 15:17:46,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9bdf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:46, skipping insertion in model container [2023-11-17 15:17:46,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:46" (3/3) ... [2023-11-17 15:17:46,375 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:17:46,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:17:46,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:17:46,387 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:17:46,461 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:17:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-17 15:17:46,519 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-17 15:17:46,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:46,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:17:46,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-17 15:17:46,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-17 15:17:46,528 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:17:46,539 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-17 15:17:46,542 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-17 15:17:46,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-11-17 15:17:46,561 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-17 15:17:46,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:46,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:17:46,563 INFO L119 LiptonReduction]: Number of co-enabled transitions 2206 [2023-11-17 15:17:49,413 INFO L134 LiptonReduction]: Checked pairs total: 4517 [2023-11-17 15:17:49,413 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-17 15:17:49,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:17:49,435 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;@7d68edd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:17:49,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:17:49,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:17:49,439 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 15:17:49,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:49,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:49,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:17:49,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:49,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 461778597, now seen corresponding path program 1 times [2023-11-17 15:17:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:49,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996684416] [2023-11-17 15:17:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:49,699 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:17:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996684416] [2023-11-17 15:17:49,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996684416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012623029] [2023-11-17 15:17:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:49,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 211 [2023-11-17 15:17:49,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:17:49,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:49,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 211 [2023-11-17 15:17:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:49,917 INFO L124 PetriNetUnfolderBase]: 855/1340 cut-off events. [2023-11-17 15:17:49,918 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:17:49,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 1340 events. 855/1340 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6075 event pairs, 237 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 2656. Up to 1027 conditions per place. [2023-11-17 15:17:49,926 INFO L140 encePairwiseOnDemand]: 207/211 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-11-17 15:17:49,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 148 flow [2023-11-17 15:17:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-17 15:17:49,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260663507109005 [2023-11-17 15:17:49,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-17 15:17:49,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-17 15:17:49,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:49,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-17 15:17:49,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:17:49,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 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:17:49,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 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:17:49,949 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 333 transitions. [2023-11-17 15:17:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 148 flow [2023-11-17 15:17:49,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:17:49,952 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-17 15:17:49,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-17 15:17:49,956 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-17 15:17:49,956 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-17 15:17:49,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:17:49,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:49,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:17:49,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:49,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 367408291, now seen corresponding path program 1 times [2023-11-17 15:17:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717766259] [2023-11-17 15:17:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:50,086 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:17:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717766259] [2023-11-17 15:17:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717766259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:17:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711095872] [2023-11-17 15:17:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:50,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2023-11-17 15:17:50,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:17:50,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:50,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2023-11-17 15:17:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:50,486 INFO L124 PetriNetUnfolderBase]: 1984/3015 cut-off events. [2023-11-17 15:17:50,486 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2023-11-17 15:17:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6292 conditions, 3015 events. 1984/3015 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15220 event pairs, 600 based on Foata normal form. 169/3184 useless extension candidates. Maximal degree in co-relation 6282. Up to 1321 conditions per place. [2023-11-17 15:17:50,499 INFO L140 encePairwiseOnDemand]: 203/211 looper letters, 32 selfloop transitions, 6 changer transitions 22/60 dead transitions. [2023-11-17 15:17:50,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 260 flow [2023-11-17 15:17:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-11-17 15:17:50,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758293838862559 [2023-11-17 15:17:50,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-11-17 15:17:50,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-11-17 15:17:50,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:50,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-11-17 15:17:50,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:17:50,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:50,511 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:50,511 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 5 states and 502 transitions. [2023-11-17 15:17:50,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 260 flow [2023-11-17 15:17:50,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:50,513 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 102 flow [2023-11-17 15:17:50,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-17 15:17:50,514 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-11-17 15:17:50,514 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 102 flow [2023-11-17 15:17:50,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:17:50,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:50,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:17:50,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:50,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1495238999, now seen corresponding path program 1 times [2023-11-17 15:17:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645619119] [2023-11-17 15:17:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:50,679 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:17:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645619119] [2023-11-17 15:17:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645619119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780802419] [2023-11-17 15:17:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:50,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2023-11-17 15:17:50,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:17:50,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:50,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2023-11-17 15:17:50,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:50,976 INFO L124 PetriNetUnfolderBase]: 1552/2399 cut-off events. [2023-11-17 15:17:50,976 INFO L125 PetriNetUnfolderBase]: For 1851/1851 co-relation queries the response was YES. [2023-11-17 15:17:50,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6537 conditions, 2399 events. 1552/2399 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11197 event pairs, 416 based on Foata normal form. 129/2528 useless extension candidates. Maximal degree in co-relation 6523. Up to 724 conditions per place. [2023-11-17 15:17:50,984 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 36 selfloop transitions, 6 changer transitions 31/73 dead transitions. [2023-11-17 15:17:50,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 73 transitions, 414 flow [2023-11-17 15:17:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-11-17 15:17:50,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631008801624915 [2023-11-17 15:17:50,986 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-11-17 15:17:50,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-11-17 15:17:50,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:50,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-11-17 15:17:50,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 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:17:50,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:50,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:50,990 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 102 flow. Second operand 7 states and 684 transitions. [2023-11-17 15:17:50,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 73 transitions, 414 flow [2023-11-17 15:17:50,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:50,998 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 136 flow [2023-11-17 15:17:50,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-11-17 15:17:51,000 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-11-17 15:17:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 136 flow [2023-11-17 15:17:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:17:51,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:51,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:17:51,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:51,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -173266664, now seen corresponding path program 1 times [2023-11-17 15:17:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:51,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81469231] [2023-11-17 15:17:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:51,084 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:17:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81469231] [2023-11-17 15:17:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81469231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360039300] [2023-11-17 15:17:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:51,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 211 [2023-11-17 15:17:51,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 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:17:51,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:51,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 211 [2023-11-17 15:17:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:51,436 INFO L124 PetriNetUnfolderBase]: 2010/3112 cut-off events. [2023-11-17 15:17:51,436 INFO L125 PetriNetUnfolderBase]: For 3917/3917 co-relation queries the response was YES. [2023-11-17 15:17:51,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8845 conditions, 3112 events. 2010/3112 cut-off events. For 3917/3917 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15830 event pairs, 537 based on Foata normal form. 72/3184 useless extension candidates. Maximal degree in co-relation 8825. Up to 1431 conditions per place. [2023-11-17 15:17:51,447 INFO L140 encePairwiseOnDemand]: 205/211 looper letters, 37 selfloop transitions, 5 changer transitions 25/67 dead transitions. [2023-11-17 15:17:51,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 444 flow [2023-11-17 15:17:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-11-17 15:17:51,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47962085308056873 [2023-11-17 15:17:51,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-11-17 15:17:51,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-11-17 15:17:51,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:51,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-11-17 15:17:51,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 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:17:51,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:51,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:51,452 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 136 flow. Second operand 5 states and 506 transitions. [2023-11-17 15:17:51,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 444 flow [2023-11-17 15:17:51,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 430 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-17 15:17:51,463 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 164 flow [2023-11-17 15:17:51,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-17 15:17:51,464 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2023-11-17 15:17:51,464 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 164 flow [2023-11-17 15:17:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 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:17:51,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:51,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:17:51,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:51,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1567230777, now seen corresponding path program 1 times [2023-11-17 15:17:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133497697] [2023-11-17 15:17:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:51,558 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:17:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:51,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133497697] [2023-11-17 15:17:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133497697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:51,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275504766] [2023-11-17 15:17:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:51,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:51,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 211 [2023-11-17 15:17:51,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:17:51,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:51,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 211 [2023-11-17 15:17:51,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:51,928 INFO L124 PetriNetUnfolderBase]: 1932/3061 cut-off events. [2023-11-17 15:17:51,929 INFO L125 PetriNetUnfolderBase]: For 2408/2408 co-relation queries the response was YES. [2023-11-17 15:17:51,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8380 conditions, 3061 events. 1932/3061 cut-off events. For 2408/2408 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16267 event pairs, 577 based on Foata normal form. 66/3127 useless extension candidates. Maximal degree in co-relation 8358. Up to 903 conditions per place. [2023-11-17 15:17:51,941 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 37 selfloop transitions, 4 changer transitions 36/77 dead transitions. [2023-11-17 15:17:51,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 478 flow [2023-11-17 15:17:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-11-17 15:17:51,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47731888964116453 [2023-11-17 15:17:51,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-11-17 15:17:51,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-11-17 15:17:51,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:51,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-11-17 15:17:51,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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:17:51,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:51,947 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:51,947 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 164 flow. Second operand 7 states and 705 transitions. [2023-11-17 15:17:51,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 478 flow [2023-11-17 15:17:51,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 441 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-17 15:17:51,956 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 136 flow [2023-11-17 15:17:51,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2023-11-17 15:17:51,957 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-11-17 15:17:51,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 136 flow [2023-11-17 15:17:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:17:51,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:51,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:51,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:17:51,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:51,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1876173738, now seen corresponding path program 1 times [2023-11-17 15:17:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424670091] [2023-11-17 15:17:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:52,063 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:17:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424670091] [2023-11-17 15:17:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424670091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506422571] [2023-11-17 15:17:52,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:52,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:52,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2023-11-17 15:17:52,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 26 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:17:52,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:52,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2023-11-17 15:17:52,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:52,230 INFO L124 PetriNetUnfolderBase]: 770/1360 cut-off events. [2023-11-17 15:17:52,230 INFO L125 PetriNetUnfolderBase]: For 1536/1547 co-relation queries the response was YES. [2023-11-17 15:17:52,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3684 conditions, 1360 events. 770/1360 cut-off events. For 1536/1547 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7348 event pairs, 140 based on Foata normal form. 138/1490 useless extension candidates. Maximal degree in co-relation 3662. Up to 619 conditions per place. [2023-11-17 15:17:52,235 INFO L140 encePairwiseOnDemand]: 205/211 looper letters, 39 selfloop transitions, 5 changer transitions 5/53 dead transitions. [2023-11-17 15:17:52,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 354 flow [2023-11-17 15:17:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:17:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:17:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-11-17 15:17:52,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928909952606635 [2023-11-17 15:17:52,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-11-17 15:17:52,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-11-17 15:17:52,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:52,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-11-17 15:17:52,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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:17:52,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:17:52,239 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:17:52,239 INFO L175 Difference]: Start difference. First operand has 49 places, 26 transitions, 136 flow. Second operand 4 states and 416 transitions. [2023-11-17 15:17:52,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 354 flow [2023-11-17 15:17:52,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 316 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-17 15:17:52,242 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 148 flow [2023-11-17 15:17:52,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-11-17 15:17:52,243 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-11-17 15:17:52,243 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 148 flow [2023-11-17 15:17:52,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:17:52,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:52,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:17:52,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:52,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -594805873, now seen corresponding path program 1 times [2023-11-17 15:17:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:52,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283446087] [2023-11-17 15:17:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:52,345 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:17:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283446087] [2023-11-17 15:17:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283446087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762886739] [2023-11-17 15:17:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:52,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2023-11-17 15:17:52,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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:17:52,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2023-11-17 15:17:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:52,517 INFO L124 PetriNetUnfolderBase]: 635/1112 cut-off events. [2023-11-17 15:17:52,517 INFO L125 PetriNetUnfolderBase]: For 960/960 co-relation queries the response was YES. [2023-11-17 15:17:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 1112 events. 635/1112 cut-off events. For 960/960 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5290 event pairs, 188 based on Foata normal form. 14/1126 useless extension candidates. Maximal degree in co-relation 3715. Up to 464 conditions per place. [2023-11-17 15:17:52,521 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 39 selfloop transitions, 6 changer transitions 18/63 dead transitions. [2023-11-17 15:17:52,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 412 flow [2023-11-17 15:17:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2023-11-17 15:17:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46824644549763034 [2023-11-17 15:17:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2023-11-17 15:17:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2023-11-17 15:17:52,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:52,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2023-11-17 15:17:52,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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:17:52,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:52,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:52,525 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 148 flow. Second operand 5 states and 494 transitions. [2023-11-17 15:17:52,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 412 flow [2023-11-17 15:17:52,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 390 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:52,528 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 146 flow [2023-11-17 15:17:52,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-11-17 15:17:52,528 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-11-17 15:17:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 146 flow [2023-11-17 15:17:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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:17:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:52,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:17:52,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:52,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1350855501, now seen corresponding path program 2 times [2023-11-17 15:17:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884648975] [2023-11-17 15:17:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:52,639 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:17:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884648975] [2023-11-17 15:17:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884648975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:52,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95187300] [2023-11-17 15:17:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:52,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:52,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:52,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:52,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2023-11-17 15:17:52,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:52,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:52,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2023-11-17 15:17:52,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:52,741 INFO L124 PetriNetUnfolderBase]: 216/423 cut-off events. [2023-11-17 15:17:52,742 INFO L125 PetriNetUnfolderBase]: For 495/498 co-relation queries the response was YES. [2023-11-17 15:17:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 423 events. 216/423 cut-off events. For 495/498 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1814 event pairs, 32 based on Foata normal form. 50/470 useless extension candidates. Maximal degree in co-relation 1395. Up to 164 conditions per place. [2023-11-17 15:17:52,743 INFO L140 encePairwiseOnDemand]: 205/211 looper letters, 41 selfloop transitions, 8 changer transitions 3/55 dead transitions. [2023-11-17 15:17:52,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 390 flow [2023-11-17 15:17:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-11-17 15:17:52,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48625592417061614 [2023-11-17 15:17:52,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-11-17 15:17:52,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-11-17 15:17:52,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:52,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-11-17 15:17:52,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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:17:52,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:52,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:17:52,748 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 146 flow. Second operand 5 states and 513 transitions. [2023-11-17 15:17:52,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 390 flow [2023-11-17 15:17:52,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 352 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-17 15:17:52,749 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 173 flow [2023-11-17 15:17:52,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-17 15:17:52,750 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-11-17 15:17:52,750 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 173 flow [2023-11-17 15:17:52,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:52,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:52,751 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:17:52,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:17:52,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:52,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -321771936, now seen corresponding path program 1 times [2023-11-17 15:17:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:52,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521825779] [2023-11-17 15:17:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:52,873 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:17:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521825779] [2023-11-17 15:17:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521825779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:52,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:17:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320889956] [2023-11-17 15:17:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:52,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:17:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:17:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:17:52,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2023-11-17 15:17:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 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:17:52,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:52,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2023-11-17 15:17:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:52,998 INFO L124 PetriNetUnfolderBase]: 200/404 cut-off events. [2023-11-17 15:17:52,998 INFO L125 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2023-11-17 15:17:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 404 events. 200/404 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1644 event pairs, 38 based on Foata normal form. 6/410 useless extension candidates. Maximal degree in co-relation 1557. Up to 199 conditions per place. [2023-11-17 15:17:52,999 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 33 selfloop transitions, 2 changer transitions 24/59 dead transitions. [2023-11-17 15:17:52,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 459 flow [2023-11-17 15:17:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2023-11-17 15:17:53,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45260663507109006 [2023-11-17 15:17:53,001 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 573 transitions. [2023-11-17 15:17:53,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 573 transitions. [2023-11-17 15:17:53,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:53,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 573 transitions. [2023-11-17 15:17:53,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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:17:53,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:17:53,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:17:53,004 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 173 flow. Second operand 6 states and 573 transitions. [2023-11-17 15:17:53,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 459 flow [2023-11-17 15:17:53,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 402 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-17 15:17:53,006 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 137 flow [2023-11-17 15:17:53,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-11-17 15:17:53,007 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-11-17 15:17:53,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 137 flow [2023-11-17 15:17:53,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 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:17:53,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:53,008 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:17:53,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:17:53,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:53,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1515379298, now seen corresponding path program 2 times [2023-11-17 15:17:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083633480] [2023-11-17 15:17:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:53,256 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:17:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083633480] [2023-11-17 15:17:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083633480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:17:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371712947] [2023-11-17 15:17:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:17:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:17:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:17:53,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2023-11-17 15:17:53,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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:17:53,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:53,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2023-11-17 15:17:53,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:53,388 INFO L124 PetriNetUnfolderBase]: 94/206 cut-off events. [2023-11-17 15:17:53,388 INFO L125 PetriNetUnfolderBase]: For 261/262 co-relation queries the response was YES. [2023-11-17 15:17:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 206 events. 94/206 cut-off events. For 261/262 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 673 event pairs, 14 based on Foata normal form. 5/211 useless extension candidates. Maximal degree in co-relation 718. Up to 129 conditions per place. [2023-11-17 15:17:53,390 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 32 selfloop transitions, 5 changer transitions 25/64 dead transitions. [2023-11-17 15:17:53,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 443 flow [2023-11-17 15:17:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-11-17 15:17:53,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46445497630331756 [2023-11-17 15:17:53,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-11-17 15:17:53,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-11-17 15:17:53,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:53,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-11-17 15:17:53,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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:17:53,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:53,395 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:17:53,395 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 137 flow. Second operand 7 states and 686 transitions. [2023-11-17 15:17:53,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 443 flow [2023-11-17 15:17:53,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 400 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-11-17 15:17:53,397 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 154 flow [2023-11-17 15:17:53,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-11-17 15:17:53,398 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-11-17 15:17:53,398 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 154 flow [2023-11-17 15:17:53,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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:17:53,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:53,398 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:17:53,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:17:53,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:53,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1680036571, now seen corresponding path program 1 times [2023-11-17 15:17:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806554181] [2023-11-17 15:17:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:53,512 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:17:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806554181] [2023-11-17 15:17:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806554181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:17:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203129965] [2023-11-17 15:17:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:17:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:17:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:17:53,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2023-11-17 15:17:53,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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:17:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2023-11-17 15:17:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:53,590 INFO L124 PetriNetUnfolderBase]: 52/119 cut-off events. [2023-11-17 15:17:53,591 INFO L125 PetriNetUnfolderBase]: For 182/183 co-relation queries the response was YES. [2023-11-17 15:17:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 119 events. 52/119 cut-off events. For 182/183 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 298 event pairs, 8 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 432. Up to 39 conditions per place. [2023-11-17 15:17:53,592 INFO L140 encePairwiseOnDemand]: 205/211 looper letters, 30 selfloop transitions, 11 changer transitions 1/44 dead transitions. [2023-11-17 15:17:53,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 299 flow [2023-11-17 15:17:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 597 transitions. [2023-11-17 15:17:53,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471563981042654 [2023-11-17 15:17:53,593 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 597 transitions. [2023-11-17 15:17:53,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 597 transitions. [2023-11-17 15:17:53,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:53,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 597 transitions. [2023-11-17 15:17:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 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:17:53,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:17:53,596 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:17:53,596 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 154 flow. Second operand 6 states and 597 transitions. [2023-11-17 15:17:53,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 299 flow [2023-11-17 15:17:53,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 269 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-17 15:17:53,597 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 170 flow [2023-11-17 15:17:53,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-11-17 15:17:53,598 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-11-17 15:17:53,598 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 170 flow [2023-11-17 15:17:53,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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:17:53,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:53,598 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] [2023-11-17 15:17:53,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:17:53,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:53,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash -868378934, now seen corresponding path program 1 times [2023-11-17 15:17:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325502123] [2023-11-17 15:17:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:53,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:53,977 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:17:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325502123] [2023-11-17 15:17:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325502123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:53,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:53,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:17:53,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239383639] [2023-11-17 15:17:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:53,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:17:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:17:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:17:53,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2023-11-17 15:17:53,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 170 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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:17:53,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:53,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2023-11-17 15:17:53,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:54,109 INFO L124 PetriNetUnfolderBase]: 50/120 cut-off events. [2023-11-17 15:17:54,109 INFO L125 PetriNetUnfolderBase]: For 239/241 co-relation queries the response was YES. [2023-11-17 15:17:54,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 120 events. 50/120 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 292 event pairs, 12 based on Foata normal form. 3/123 useless extension candidates. Maximal degree in co-relation 477. Up to 46 conditions per place. [2023-11-17 15:17:54,110 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 26 selfloop transitions, 4 changer transitions 24/56 dead transitions. [2023-11-17 15:17:54,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 440 flow [2023-11-17 15:17:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:17:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:17:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 751 transitions. [2023-11-17 15:17:54,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44490521327014215 [2023-11-17 15:17:54,112 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 751 transitions. [2023-11-17 15:17:54,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 751 transitions. [2023-11-17 15:17:54,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:54,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 751 transitions. [2023-11-17 15:17:54,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.875) internal successors, (751), 8 states have internal predecessors, (751), 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:17:54,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:17:54,116 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:17:54,116 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 170 flow. Second operand 8 states and 751 transitions. [2023-11-17 15:17:54,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 440 flow [2023-11-17 15:17:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 311 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-11-17 15:17:54,117 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 122 flow [2023-11-17 15:17:54,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2023-11-17 15:17:54,118 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-11-17 15:17:54,118 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 122 flow [2023-11-17 15:17:54,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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:17:54,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:54,118 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] [2023-11-17 15:17:54,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:17:54,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:54,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -410057186, now seen corresponding path program 2 times [2023-11-17 15:17:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608922166] [2023-11-17 15:17:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:54,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:54,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:17:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:54,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:17:54,179 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:17:54,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:17:54,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:17:54,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:17:54,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:17:54,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:17:54,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:17:54,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:17:54,181 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:54,185 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:17:54,185 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:17:54,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:17:54,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:17:54,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:17:54,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:17:54 BasicIcfg [2023-11-17 15:17:54,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:17:54,219 INFO L158 Benchmark]: Toolchain (without parser) took 8871.57ms. Allocated memory was 250.6MB in the beginning and 503.3MB in the end (delta: 252.7MB). Free memory was 210.4MB in the beginning and 378.3MB in the end (delta: -167.9MB). Peak memory consumption was 85.9MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,219 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 173.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:17:54,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 250.6MB. Free memory was 210.4MB in the beginning and 187.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.92ms. Allocated memory is still 250.6MB. Free memory was 187.3MB in the beginning and 184.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,220 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 250.6MB. Free memory was 184.7MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,220 INFO L158 Benchmark]: RCFGBuilder took 500.36ms. Allocated memory is still 250.6MB. Free memory was 182.6MB in the beginning and 149.6MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,220 INFO L158 Benchmark]: TraceAbstraction took 7848.33ms. Allocated memory was 250.6MB in the beginning and 503.3MB in the end (delta: 252.7MB). Free memory was 149.1MB in the beginning and 378.3MB in the end (delta: -229.2MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2023-11-17 15:17:54,221 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.17ms. Allocated memory is still 192.9MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 173.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 250.6MB. Free memory was 210.4MB in the beginning and 187.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.92ms. Allocated memory is still 250.6MB. Free memory was 187.3MB in the beginning and 184.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 250.6MB. Free memory was 184.7MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 500.36ms. Allocated memory is still 250.6MB. Free memory was 182.6MB in the beginning and 149.6MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7848.33ms. Allocated memory was 250.6MB in the beginning and 503.3MB in the end (delta: 252.7MB). Free memory was 149.1MB in the beginning and 378.3MB in the end (delta: -229.2MB). Peak memory consumption was 24.0MB. 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 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: 2.9s, 117 PlacesBefore, 33 PlacesAfterwards, 109 TransitionsBefore, 24 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 4517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2361, independent: 2231, independent conditional: 0, independent unconditional: 2231, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1536, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1536, independent: 1479, independent conditional: 0, independent unconditional: 1479, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2361, independent: 738, independent conditional: 0, independent unconditional: 738, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 1536, unknown conditional: 0, unknown unconditional: 1536] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 836]: 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: 834]: 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: 832]: 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 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1161 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 14 mSDtfsCounter, 1161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 866 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:17:54,238 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...