/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:11:39,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:11:39,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:11:39,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:11:39,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:11:39,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:11:39,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:11:39,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:11:39,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:11:39,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:11:39,429 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:11:39,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:11:39,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:11:39,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:11:39,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:11:39,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:11:39,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:11:39,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:11:39,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:11:39,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:11:39,433 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:11:39,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:11:39,434 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:11:39,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:11:39,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:11:39,434 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:11:39,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:11:39,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:39,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:11:39,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:11:39,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:11:39,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:11:39,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:11:39,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:11:39,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:11:39,437 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 23:11:39,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:11:39,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:11:39,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:11:39,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:11:39,762 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:11:39,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:11:40,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:11:41,255 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:11:41,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:11:41,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a18c5d03/d90a65cfb480451dbb51b38acf45f936/FLAGc0f175d8b [2023-08-23 23:11:41,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a18c5d03/d90a65cfb480451dbb51b38acf45f936 [2023-08-23 23:11:41,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:11:41,286 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:11:41,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:41,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:11:41,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:11:41,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64acb0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41, skipping insertion in model container [2023-08-23 23:11:41,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,351 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:11:41,471 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2023-08-23 23:11:41,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:41,694 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:11:41,704 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2023-08-23 23:11:41,719 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:11:41,722 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:11:41,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:41,805 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:41,806 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:41,811 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:11:41,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41 WrapperNode [2023-08-23 23:11:41,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:41,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:41,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:11:41,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:11:41,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,885 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-08-23 23:11:41,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:41,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:11:41,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:11:41,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:11:41,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:11:41,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:11:41,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:11:41,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:11:41,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (1/1) ... [2023-08-23 23:11:41,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:11:41,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 23:11:41,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 23:11:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:11:41,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:11:41,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:11:41,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:11:41,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:11:41,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:11:41,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:11:41,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:11:41,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:11:41,995 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:11:41,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:11:41,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:11:41,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:11:41,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:11:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:11:41,998 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:11:42,122 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:11:42,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:11:42,352 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:11:42,495 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:11:42,495 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:11:42,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:42 BoogieIcfgContainer [2023-08-23 23:11:42,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:11:42,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:11:42,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:11:42,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:11:42,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:11:41" (1/3) ... [2023-08-23 23:11:42,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4842b589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:42, skipping insertion in model container [2023-08-23 23:11:42,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:41" (2/3) ... [2023-08-23 23:11:42,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4842b589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:42, skipping insertion in model container [2023-08-23 23:11:42,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:42" (3/3) ... [2023-08-23 23:11:42,505 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:11:42,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:11:42,521 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:11:42,522 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:11:42,582 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:11:42,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:42,673 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:42,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:42,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-23 23:11:42,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:42,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:42,688 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:11:42,707 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:42,709 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:42,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:42,737 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:42,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:42,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-23 23:11:42,740 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-08-23 23:11:46,127 INFO L134 LiptonReduction]: Checked pairs total: 4493 [2023-08-23 23:11:46,128 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-23 23:11:46,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:11:46,145 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f4052b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:11:46,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:11:46,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:11:46,149 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-23 23:11:46,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:46,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:46,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-23 23:11:46,150 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-08-23 23:11:46,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash 437205245, now seen corresponding path program 1 times [2023-08-23 23:11:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898810385] [2023-08-23 23:11:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:46,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898810385] [2023-08-23 23:11:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898810385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290684353] [2023-08-23 23:11:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:46,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:46,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:46,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 198 [2023-08-23 23:11:46,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:46,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:46,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 198 [2023-08-23 23:11:46,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:46,809 INFO L124 PetriNetUnfolderBase]: 711/1124 cut-off events. [2023-08-23 23:11:46,809 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-23 23:11:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1124 events. 711/1124 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4952 event pairs, 197 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2232. Up to 859 conditions per place. [2023-08-23 23:11:46,821 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-23 23:11:46,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-08-23 23:11:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-08-23 23:11:46,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269360269360269 [2023-08-23 23:11:46,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-08-23 23:11:46,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-08-23 23:11:46,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:46,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-08-23 23:11:46,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:46,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:46,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:46,856 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 313 transitions. [2023-08-23 23:11:46,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-08-23 23:11:46,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:11:46,861 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-23 23:11:46,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-23 23:11:46,867 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-23 23:11:46,867 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-23 23:11:46,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:46,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:46,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:46,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:11:46,869 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-08-23 23:11:46,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1603025151, now seen corresponding path program 1 times [2023-08-23 23:11:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943485879] [2023-08-23 23:11:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943485879] [2023-08-23 23:11:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943485879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:47,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609758795] [2023-08-23 23:11:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:47,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:47,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 198 [2023-08-23 23:11:47,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:47,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 198 [2023-08-23 23:11:47,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:47,410 INFO L124 PetriNetUnfolderBase]: 1356/2082 cut-off events. [2023-08-23 23:11:47,410 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-08-23 23:11:47,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 2082 events. 1356/2082 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9998 event pairs, 498 based on Foata normal form. 86/2168 useless extension candidates. Maximal degree in co-relation 4349. Up to 1151 conditions per place. [2023-08-23 23:11:47,422 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-23 23:11:47,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2023-08-23 23:11:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-23 23:11:47,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-08-23 23:11:47,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-23 23:11:47,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-23 23:11:47,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:47,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-23 23:11:47,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,429 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 296 transitions. [2023-08-23 23:11:47,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2023-08-23 23:11:47,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:47,432 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2023-08-23 23:11:47,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-08-23 23:11:47,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-23 23:11:47,434 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2023-08-23 23:11:47,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:47,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:47,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:11:47,441 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-08-23 23:11:47,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826649, now seen corresponding path program 1 times [2023-08-23 23:11:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390282012] [2023-08-23 23:11:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:47,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:47,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390282012] [2023-08-23 23:11:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390282012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:47,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468593571] [2023-08-23 23:11:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:47,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 198 [2023-08-23 23:11:47,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:47,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 198 [2023-08-23 23:11:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:47,849 INFO L124 PetriNetUnfolderBase]: 1328/2039 cut-off events. [2023-08-23 23:11:47,849 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2023-08-23 23:11:47,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 2039 events. 1328/2039 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9440 event pairs, 193 based on Foata normal form. 6/2045 useless extension candidates. Maximal degree in co-relation 5249. Up to 1039 conditions per place. [2023-08-23 23:11:47,859 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-23 23:11:47,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 252 flow [2023-08-23 23:11:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-08-23 23:11:47,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2023-08-23 23:11:47,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-08-23 23:11:47,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-08-23 23:11:47,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:47,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-08-23 23:11:47,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,864 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,864 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 390 transitions. [2023-08-23 23:11:47,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 252 flow [2023-08-23 23:11:47,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:47,869 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 140 flow [2023-08-23 23:11:47,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-23 23:11:47,870 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-23 23:11:47,870 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 140 flow [2023-08-23 23:11:47,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:47,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:47,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:11:47,871 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-08-23 23:11:47,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826680, now seen corresponding path program 1 times [2023-08-23 23:11:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:47,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565804478] [2023-08-23 23:11:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:47,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565804478] [2023-08-23 23:11:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565804478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:47,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:47,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:47,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333501525] [2023-08-23 23:11:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:47,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:47,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:47,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 198 [2023-08-23 23:11:47,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:47,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:47,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 198 [2023-08-23 23:11:47,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:48,196 INFO L124 PetriNetUnfolderBase]: 1206/1885 cut-off events. [2023-08-23 23:11:48,197 INFO L125 PetriNetUnfolderBase]: For 954/963 co-relation queries the response was YES. [2023-08-23 23:11:48,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5111 conditions, 1885 events. 1206/1885 cut-off events. For 954/963 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8825 event pairs, 474 based on Foata normal form. 5/1877 useless extension candidates. Maximal degree in co-relation 5097. Up to 1748 conditions per place. [2023-08-23 23:11:48,209 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 33 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2023-08-23 23:11:48,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 265 flow [2023-08-23 23:11:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-23 23:11:48,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084175084175084 [2023-08-23 23:11:48,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-23 23:11:48,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-23 23:11:48,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:48,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-23 23:11:48,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-08-23 23:11:48,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,214 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 140 flow. Second operand 3 states and 302 transitions. [2023-08-23 23:11:48,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 265 flow [2023-08-23 23:11:48,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 23:11:48,218 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 184 flow [2023-08-23 23:11:48,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2023-08-23 23:11:48,219 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-23 23:11:48,219 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 184 flow [2023-08-23 23:11:48,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:48,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:48,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:11:48,220 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-08-23 23:11:48,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1386050080, now seen corresponding path program 1 times [2023-08-23 23:11:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904333307] [2023-08-23 23:11:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:48,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904333307] [2023-08-23 23:11:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904333307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:48,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574324064] [2023-08-23 23:11:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:48,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:48,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-23 23:11:48,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:48,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-23 23:11:48,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:48,710 INFO L124 PetriNetUnfolderBase]: 808/1397 cut-off events. [2023-08-23 23:11:48,711 INFO L125 PetriNetUnfolderBase]: For 1140/1177 co-relation queries the response was YES. [2023-08-23 23:11:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 1397 events. 808/1397 cut-off events. For 1140/1177 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7359 event pairs, 138 based on Foata normal form. 161/1552 useless extension candidates. Maximal degree in co-relation 3944. Up to 809 conditions per place. [2023-08-23 23:11:48,719 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 59 selfloop transitions, 8 changer transitions 7/82 dead transitions. [2023-08-23 23:11:48,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 82 transitions, 569 flow [2023-08-23 23:11:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-23 23:11:48,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919191919191919 [2023-08-23 23:11:48,722 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-23 23:11:48,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-23 23:11:48,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:48,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-23 23:11:48,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,726 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 184 flow. Second operand 5 states and 487 transitions. [2023-08-23 23:11:48,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 82 transitions, 569 flow [2023-08-23 23:11:48,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 82 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:48,730 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 238 flow [2023-08-23 23:11:48,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-23 23:11:48,730 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-23 23:11:48,731 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 238 flow [2023-08-23 23:11:48,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:48,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:48,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:11:48,731 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-08-23 23:11:48,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2003984615, now seen corresponding path program 1 times [2023-08-23 23:11:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100714962] [2023-08-23 23:11:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100714962] [2023-08-23 23:11:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100714962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:11:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93358365] [2023-08-23 23:11:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:48,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:48,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:48,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-23 23:11:48,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:48,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-23 23:11:48,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:49,123 INFO L124 PetriNetUnfolderBase]: 623/1121 cut-off events. [2023-08-23 23:11:49,123 INFO L125 PetriNetUnfolderBase]: For 1375/1400 co-relation queries the response was YES. [2023-08-23 23:11:49,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3990 conditions, 1121 events. 623/1121 cut-off events. For 1375/1400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5921 event pairs, 77 based on Foata normal form. 99/1214 useless extension candidates. Maximal degree in co-relation 3969. Up to 384 conditions per place. [2023-08-23 23:11:49,130 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 67 selfloop transitions, 15 changer transitions 17/107 dead transitions. [2023-08-23 23:11:49,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 788 flow [2023-08-23 23:11:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-08-23 23:11:49,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2023-08-23 23:11:49,133 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-08-23 23:11:49,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-08-23 23:11:49,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:49,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-08-23 23:11:49,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,139 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 238 flow. Second operand 7 states and 682 transitions. [2023-08-23 23:11:49,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 107 transitions, 788 flow [2023-08-23 23:11:49,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 107 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:49,145 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 333 flow [2023-08-23 23:11:49,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-23 23:11:49,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-08-23 23:11:49,148 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 333 flow [2023-08-23 23:11:49,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:49,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:49,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:11:49,149 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-08-23 23:11:49,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -18789196, now seen corresponding path program 1 times [2023-08-23 23:11:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379668687] [2023-08-23 23:11:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379668687] [2023-08-23 23:11:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379668687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:49,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039281325] [2023-08-23 23:11:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:49,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 198 [2023-08-23 23:11:49,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:49,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 198 [2023-08-23 23:11:49,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:49,532 INFO L124 PetriNetUnfolderBase]: 937/1689 cut-off events. [2023-08-23 23:11:49,532 INFO L125 PetriNetUnfolderBase]: For 4428/4430 co-relation queries the response was YES. [2023-08-23 23:11:49,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6976 conditions, 1689 events. 937/1689 cut-off events. For 4428/4430 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9563 event pairs, 344 based on Foata normal form. 11/1690 useless extension candidates. Maximal degree in co-relation 6951. Up to 854 conditions per place. [2023-08-23 23:11:49,540 INFO L140 encePairwiseOnDemand]: 195/198 looper letters, 41 selfloop transitions, 5 changer transitions 25/73 dead transitions. [2023-08-23 23:11:49,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 662 flow [2023-08-23 23:11:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-23 23:11:49,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084175084175084 [2023-08-23 23:11:49,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-23 23:11:49,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-23 23:11:49,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:49,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-23 23:11:49,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-08-23 23:11:49,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,544 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 333 flow. Second operand 3 states and 302 transitions. [2023-08-23 23:11:49,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 662 flow [2023-08-23 23:11:49,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 593 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:49,572 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 243 flow [2023-08-23 23:11:49,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-23 23:11:49,572 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2023-08-23 23:11:49,572 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 243 flow [2023-08-23 23:11:49,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:49,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:49,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:11:49,573 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-08-23 23:11:49,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 975386157, now seen corresponding path program 1 times [2023-08-23 23:11:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625279380] [2023-08-23 23:11:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11: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-08-23 23:11:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625279380] [2023-08-23 23:11:49,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625279380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814558185] [2023-08-23 23:11:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:49,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:49,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 198 [2023-08-23 23:11:49,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:49,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 198 [2023-08-23 23:11:49,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:49,852 INFO L124 PetriNetUnfolderBase]: 485/970 cut-off events. [2023-08-23 23:11:49,853 INFO L125 PetriNetUnfolderBase]: For 1802/1806 co-relation queries the response was YES. [2023-08-23 23:11:49,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 970 events. 485/970 cut-off events. For 1802/1806 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5226 event pairs, 202 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 3718. Up to 558 conditions per place. [2023-08-23 23:11:49,858 INFO L140 encePairwiseOnDemand]: 195/198 looper letters, 39 selfloop transitions, 3 changer transitions 6/51 dead transitions. [2023-08-23 23:11:49,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 425 flow [2023-08-23 23:11:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-08-23 23:11:49,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2023-08-23 23:11:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-08-23 23:11:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-08-23 23:11:49,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:49,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-08-23 23:11:49,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,862 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 243 flow. Second operand 3 states and 300 transitions. [2023-08-23 23:11:49,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 425 flow [2023-08-23 23:11:49,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 406 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-23 23:11:49,870 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 234 flow [2023-08-23 23:11:49,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-23 23:11:49,870 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-08-23 23:11:49,870 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 234 flow [2023-08-23 23:11:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:49,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:11:49,871 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-08-23 23:11:49,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1638738903, now seen corresponding path program 2 times [2023-08-23 23:11:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591164893] [2023-08-23 23:11:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591164893] [2023-08-23 23:11:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591164893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314730492] [2023-08-23 23:11:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:11:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:11:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:11:50,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-23 23:11:50,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:50,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-23 23:11:50,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:50,222 INFO L124 PetriNetUnfolderBase]: 389/796 cut-off events. [2023-08-23 23:11:50,222 INFO L125 PetriNetUnfolderBase]: For 1096/1104 co-relation queries the response was YES. [2023-08-23 23:11:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 796 events. 389/796 cut-off events. For 1096/1104 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4314 event pairs, 92 based on Foata normal form. 60/849 useless extension candidates. Maximal degree in co-relation 2889. Up to 282 conditions per place. [2023-08-23 23:11:50,226 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 25 selfloop transitions, 10 changer transitions 34/71 dead transitions. [2023-08-23 23:11:50,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 561 flow [2023-08-23 23:11:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2023-08-23 23:11:50,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47835497835497837 [2023-08-23 23:11:50,228 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2023-08-23 23:11:50,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2023-08-23 23:11:50,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:50,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2023-08-23 23:11:50,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,233 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 234 flow. Second operand 7 states and 663 transitions. [2023-08-23 23:11:50,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 561 flow [2023-08-23 23:11:50,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 527 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:50,239 INFO L231 Difference]: Finished difference. Result has 54 places, 26 transitions, 176 flow [2023-08-23 23:11:50,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=54, PETRI_TRANSITIONS=26} [2023-08-23 23:11:50,239 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-08-23 23:11:50,239 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 26 transitions, 176 flow [2023-08-23 23:11:50,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:50,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:50,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:11:50,240 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-08-23 23:11:50,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 844360217, now seen corresponding path program 1 times [2023-08-23 23:11:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106990126] [2023-08-23 23:11:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106990126] [2023-08-23 23:11:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106990126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:50,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:50,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:50,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999025966] [2023-08-23 23:11:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:50,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:50,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:50,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:50,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 198 [2023-08-23 23:11:50,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 26 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:50,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 198 [2023-08-23 23:11:50,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:51,076 INFO L124 PetriNetUnfolderBase]: 56/128 cut-off events. [2023-08-23 23:11:51,077 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2023-08-23 23:11:51,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 128 events. 56/128 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 345 event pairs, 14 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 505. Up to 65 conditions per place. [2023-08-23 23:11:51,078 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 27 selfloop transitions, 4 changer transitions 17/50 dead transitions. [2023-08-23 23:11:51,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 433 flow [2023-08-23 23:11:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 623 transitions. [2023-08-23 23:11:51,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2023-08-23 23:11:51,080 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 623 transitions. [2023-08-23 23:11:51,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 623 transitions. [2023-08-23 23:11:51,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:51,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 623 transitions. [2023-08-23 23:11:51,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,084 INFO L175 Difference]: Start difference. First operand has 54 places, 26 transitions, 176 flow. Second operand 7 states and 623 transitions. [2023-08-23 23:11:51,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 433 flow [2023-08-23 23:11:51,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 299 flow, removed 24 selfloop flow, removed 18 redundant places. [2023-08-23 23:11:51,088 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 112 flow [2023-08-23 23:11:51,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-23 23:11:51,089 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-23 23:11:51,089 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 112 flow [2023-08-23 23:11:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:51,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:11:51,091 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-08-23 23:11:51,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 556323559, now seen corresponding path program 2 times [2023-08-23 23:11:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:51,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892490271] [2023-08-23 23:11:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:51,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:11:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:51,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:11:51,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:11:51,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:11:51,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:11:51,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:11:51,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:11:51,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:11:51,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:11:51,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:11:51,215 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:51,220 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:11:51,220 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:11:51,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:11:51 BasicIcfg [2023-08-23 23:11:51,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:11:51,291 INFO L158 Benchmark]: Toolchain (without parser) took 10005.00ms. Allocated memory was 398.5MB in the beginning and 635.4MB in the end (delta: 237.0MB). Free memory was 373.4MB in the beginning and 376.1MB in the end (delta: -2.7MB). Peak memory consumption was 235.8MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 398.5MB. Free memory is still 374.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:11:51,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.97ms. Allocated memory is still 398.5MB. Free memory was 373.4MB in the beginning and 350.2MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 398.5MB. Free memory was 350.2MB in the beginning and 347.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,292 INFO L158 Benchmark]: Boogie Preprocessor took 38.36ms. Allocated memory is still 398.5MB. Free memory was 347.7MB in the beginning and 346.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,292 INFO L158 Benchmark]: RCFGBuilder took 571.70ms. Allocated memory is still 398.5MB. Free memory was 346.1MB in the beginning and 363.8MB in the end (delta: -17.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,292 INFO L158 Benchmark]: TraceAbstraction took 8791.40ms. Allocated memory was 398.5MB in the beginning and 635.4MB in the end (delta: 237.0MB). Free memory was 362.7MB in the beginning and 376.1MB in the end (delta: -13.5MB). Peak memory consumption was 223.5MB. Max. memory is 16.0GB. [2023-08-23 23:11:51,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 398.5MB. Free memory is still 374.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 524.97ms. Allocated memory is still 398.5MB. Free memory was 373.4MB in the beginning and 350.2MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 398.5MB. Free memory was 350.2MB in the beginning and 347.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.36ms. Allocated memory is still 398.5MB. Free memory was 347.7MB in the beginning and 346.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 571.70ms. Allocated memory is still 398.5MB. Free memory was 346.1MB in the beginning and 363.8MB in the end (delta: -17.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.0GB. * TraceAbstraction took 8791.40ms. Allocated memory was 398.5MB in the beginning and 635.4MB in the end (delta: 237.0MB). Free memory was 362.7MB in the beginning and 376.1MB in the end (delta: -13.5MB). Peak memory consumption was 223.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 111 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 4493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2111, independent: 1945, independent conditional: 0, independent unconditional: 1945, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 988, independent: 951, independent conditional: 0, independent unconditional: 951, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2111, independent: 994, independent conditional: 0, independent unconditional: 994, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 988, unknown conditional: 0, unknown unconditional: 988] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-2, t2513={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, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-1, t2513={5:0}, t2514={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, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=0, t2513={5:0}, t2514={6:0}, t2515={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, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$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, z=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$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, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$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, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={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, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, 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, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 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: 8.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 9 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-08-23 23:11:51,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...