/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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:11:55,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:11:55,375 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:55,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:11:55,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:11:55,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:11:55,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:11:55,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:11:55,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:11:55,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:11:55,412 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:11:55,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:11:55,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:11:55,413 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:11:55,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:11:55,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:11:55,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:11:55,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:11:55,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:11:55,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:11:55,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:11:55,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:11:55,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:11:55,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:11:55,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:11:55,415 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:11:55,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:11:55,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:55,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:11:55,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:11:55,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:11:55,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:11:55,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:11:55,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:11:55,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:11:55,417 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:55,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:11:55,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:11:55,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:11:55,676 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:11:55,676 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:11:55,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:56,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:11:56,943 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:11:56,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:56,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23e1cd3a/46ff48a81cc741ba99cf3faa4aa3f69e/FLAG928cbedeb [2023-08-23 23:11:56,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23e1cd3a/46ff48a81cc741ba99cf3faa4aa3f69e [2023-08-23 23:11:56,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:11:56,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:11:56,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:56,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:11:56,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:11:56,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:56" (1/1) ... [2023-08-23 23:11:56,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bfbeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:56, skipping insertion in model container [2023-08-23 23:11:56,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:56" (1/1) ... [2023-08-23 23:11:57,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:11:57,138 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-23 23:11:57,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:57,324 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:11:57,332 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-23 23:11:57,353 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:11:57,354 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:11:57,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:57,411 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:57,411 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:57,416 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:11:57,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:57 WrapperNode [2023-08-23 23:11:57,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:57,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:57,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:11:57,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:11:57,422 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:57" (1/1) ... [2023-08-23 23:11:57,447 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:57" (1/1) ... [2023-08-23 23:11:57,476 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-23 23:11:57,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:57,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:11:57,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:11:57,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:11:57,483 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:57" (1/1) ... [2023-08-23 23:11:57,483 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:57" (1/1) ... [2023-08-23 23:11:57,495 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:57" (1/1) ... [2023-08-23 23:11:57,496 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:57" (1/1) ... [2023-08-23 23:11:57,500 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:57" (1/1) ... [2023-08-23 23:11:57,501 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:57" (1/1) ... [2023-08-23 23:11:57,503 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:57" (1/1) ... [2023-08-23 23:11:57,504 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:57" (1/1) ... [2023-08-23 23:11:57,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:11:57,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:11:57,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:11:57,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:11:57,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:57" (1/1) ... [2023-08-23 23:11:57,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:11:57,550 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:57,560 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:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:11:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:11:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:11:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:11:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:11:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:11:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:11:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:11:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:11:57,611 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:57,737 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:11:57,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:11:58,035 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:11:58,125 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:11:58,125 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:11:58,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:58 BoogieIcfgContainer [2023-08-23 23:11:58,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:11:58,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:11:58,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:11:58,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:11:58,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:11:56" (1/3) ... [2023-08-23 23:11:58,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a79126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:58, skipping insertion in model container [2023-08-23 23:11:58,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:57" (2/3) ... [2023-08-23 23:11:58,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a79126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:58, skipping insertion in model container [2023-08-23 23:11:58,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:58" (3/3) ... [2023-08-23 23:11:58,134 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:58,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:11:58,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:11:58,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:11:58,190 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:11:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:58,258 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:58,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:58,263 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 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-23 23:11:58,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:58,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:58,269 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:11:58,279 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:58,282 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:58,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:58,301 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:58,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:58,301 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 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-23 23:11:58,302 INFO L119 LiptonReduction]: Number of co-enabled transitions 1676 [2023-08-23 23:12:00,774 INFO L134 LiptonReduction]: Checked pairs total: 4017 [2023-08-23 23:12:00,774 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-23 23:12:00,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:12:00,805 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;@24e7ea8e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:12:00,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:12:00,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:12:00,808 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-23 23:12:00,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:12:00,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:00,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:00,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:00,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2110564132, now seen corresponding path program 1 times [2023-08-23 23:12:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396307432] [2023-08-23 23:12:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:01,119 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:12:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396307432] [2023-08-23 23:12:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396307432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:12:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687832247] [2023-08-23 23:12:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:12:01,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:12:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:12:01,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-23 23:12:01,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:12:01,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:01,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-23 23:12:01,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:01,260 INFO L124 PetriNetUnfolderBase]: 511/844 cut-off events. [2023-08-23 23:12:01,260 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-23 23:12:01,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 844 events. 511/844 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3914 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1652. Up to 580 conditions per place. [2023-08-23 23:12:01,265 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-08-23 23:12:01,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2023-08-23 23:12:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:12:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:12:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-08-23 23:12:01,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-08-23 23:12:01,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-08-23 23:12:01,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-08-23 23:12:01,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:01,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-08-23 23:12:01,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:12:01,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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:12:01,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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:12:01,282 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 3 states and 312 transitions. [2023-08-23 23:12:01,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2023-08-23 23:12:01,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:12:01,285 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-08-23 23:12:01,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-08-23 23:12:01,288 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-23 23:12:01,289 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-08-23 23:12:01,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:12:01,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:01,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:01,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:12:01,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:01,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1027505935, now seen corresponding path program 1 times [2023-08-23 23:12:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966170994] [2023-08-23 23:12:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:01,457 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:12:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:01,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966170994] [2023-08-23 23:12:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966170994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:01,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:12:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615870633] [2023-08-23 23:12:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:12:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:12:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:12:01,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 200 [2023-08-23 23:12:01,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:12:01,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:01,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 200 [2023-08-23 23:12:01,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:01,536 INFO L124 PetriNetUnfolderBase]: 489/786 cut-off events. [2023-08-23 23:12:01,536 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-23 23:12:01,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 786 events. 489/786 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3321 event pairs, 117 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1608. Up to 689 conditions per place. [2023-08-23 23:12:01,539 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-08-23 23:12:01,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2023-08-23 23:12:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:12:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:12:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-23 23:12:01,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-08-23 23:12:01,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-23 23:12:01,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-23 23:12:01,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:01,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-23 23:12:01,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:12:01,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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:12:01,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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:12:01,545 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 304 transitions. [2023-08-23 23:12:01,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2023-08-23 23:12:01,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:12:01,546 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-08-23 23:12:01,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-23 23:12:01,546 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-23 23:12:01,546 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-08-23 23:12:01,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:12:01,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:01,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:01,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:12:01,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:01,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1787914235, now seen corresponding path program 1 times [2023-08-23 23:12:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317043365] [2023-08-23 23:12:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:01,637 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:12:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317043365] [2023-08-23 23:12:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317043365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054658848] [2023-08-23 23:12:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:01,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:01,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:01,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-23 23:12:01,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 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:12:01,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:01,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-23 23:12:01,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:01,804 INFO L124 PetriNetUnfolderBase]: 351/600 cut-off events. [2023-08-23 23:12:01,804 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-23 23:12:01,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 600 events. 351/600 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2631 event pairs, 70 based on Foata normal form. 56/650 useless extension candidates. Maximal degree in co-relation 1359. Up to 368 conditions per place. [2023-08-23 23:12:01,822 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 27 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-08-23 23:12:01,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 246 flow [2023-08-23 23:12:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:12:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:12:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-08-23 23:12:01,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478 [2023-08-23 23:12:01,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-08-23 23:12:01,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-08-23 23:12:01,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:01,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-08-23 23:12:01,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 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:12:01,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:12:01,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:12:01,828 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 5 states and 478 transitions. [2023-08-23 23:12:01,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 246 flow [2023-08-23 23:12:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:12:01,829 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2023-08-23 23:12:01,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-08-23 23:12:01,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-23 23:12:01,830 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2023-08-23 23:12:01,830 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:12:01,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:01,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:01,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:12:01,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:01,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1225705439, now seen corresponding path program 1 times [2023-08-23 23:12:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433175522] [2023-08-23 23:12:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:01,916 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:12:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433175522] [2023-08-23 23:12:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433175522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694031748] [2023-08-23 23:12:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:01,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:12:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:01,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:12:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:12:01,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-23 23:12:01,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:12:01,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:01,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-23 23:12:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:02,025 INFO L124 PetriNetUnfolderBase]: 172/324 cut-off events. [2023-08-23 23:12:02,026 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2023-08-23 23:12:02,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 324 events. 172/324 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1227 event pairs, 33 based on Foata normal form. 32/354 useless extension candidates. Maximal degree in co-relation 947. Up to 119 conditions per place. [2023-08-23 23:12:02,027 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 34 selfloop transitions, 7 changer transitions 18/62 dead transitions. [2023-08-23 23:12:02,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 346 flow [2023-08-23 23:12:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2023-08-23 23:12:02,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47833333333333333 [2023-08-23 23:12:02,029 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 574 transitions. [2023-08-23 23:12:02,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions. [2023-08-23 23:12:02,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:02,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions. [2023-08-23 23:12:02,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:12:02,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:12:02,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:12:02,033 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 6 states and 574 transitions. [2023-08-23 23:12:02,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 346 flow [2023-08-23 23:12:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 340 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:12:02,035 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 146 flow [2023-08-23 23:12:02,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-23 23:12:02,036 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-23 23:12:02,036 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 146 flow [2023-08-23 23:12:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:12:02,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:02,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:02,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:12:02,037 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:02,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1049778953, now seen corresponding path program 1 times [2023-08-23 23:12:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674648838] [2023-08-23 23:12:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:02,159 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:12:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674648838] [2023-08-23 23:12:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674648838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29173717] [2023-08-23 23:12:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:02,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-23 23:12:02,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 146 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:12:02,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:02,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-23 23:12:02,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:02,289 INFO L124 PetriNetUnfolderBase]: 282/528 cut-off events. [2023-08-23 23:12:02,289 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-08-23 23:12:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 528 events. 282/528 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2242 event pairs, 3 based on Foata normal form. 11/539 useless extension candidates. Maximal degree in co-relation 1733. Up to 255 conditions per place. [2023-08-23 23:12:02,291 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 63 selfloop transitions, 13 changer transitions 2/78 dead transitions. [2023-08-23 23:12:02,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 78 transitions, 568 flow [2023-08-23 23:12:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:12:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:12:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-08-23 23:12:02,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489 [2023-08-23 23:12:02,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-08-23 23:12:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-08-23 23:12:02,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:02,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-08-23 23:12:02,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 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:12:02,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:12:02,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:12:02,296 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 146 flow. Second operand 5 states and 489 transitions. [2023-08-23 23:12:02,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 78 transitions, 568 flow [2023-08-23 23:12:02,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 78 transitions, 478 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-23 23:12:02,299 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 210 flow [2023-08-23 23:12:02,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2023-08-23 23:12:02,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-23 23:12:02,300 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 210 flow [2023-08-23 23:12:02,300 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:12:02,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:02,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:02,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:12:02,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:02,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash -303048525, now seen corresponding path program 2 times [2023-08-23 23:12:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:02,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986984003] [2023-08-23 23:12:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:02,407 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:12:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986984003] [2023-08-23 23:12:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986984003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:02,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:02,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:02,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656554684] [2023-08-23 23:12:02,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:02,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:02,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:02,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:02,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-23 23:12:02,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 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:12:02,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:02,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-23 23:12:02,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:02,508 INFO L124 PetriNetUnfolderBase]: 197/390 cut-off events. [2023-08-23 23:12:02,508 INFO L125 PetriNetUnfolderBase]: For 543/548 co-relation queries the response was YES. [2023-08-23 23:12:02,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 390 events. 197/390 cut-off events. For 543/548 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1709 event pairs, 35 based on Foata normal form. 25/403 useless extension candidates. Maximal degree in co-relation 1333. Up to 146 conditions per place. [2023-08-23 23:12:02,510 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 35 selfloop transitions, 10 changer transitions 20/72 dead transitions. [2023-08-23 23:12:02,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 510 flow [2023-08-23 23:12:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2023-08-23 23:12:02,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2023-08-23 23:12:02,512 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2023-08-23 23:12:02,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2023-08-23 23:12:02,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:02,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2023-08-23 23:12:02,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:12:02,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:12:02,515 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:12:02,515 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 210 flow. Second operand 7 states and 652 transitions. [2023-08-23 23:12:02,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 510 flow [2023-08-23 23:12:02,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 492 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-23 23:12:02,517 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 216 flow [2023-08-23 23:12:02,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-08-23 23:12:02,517 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-08-23 23:12:02,518 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 216 flow [2023-08-23 23:12:02,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 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:12:02,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:02,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:02,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:12:02,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:02,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1045390772, now seen corresponding path program 1 times [2023-08-23 23:12:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030875634] [2023-08-23 23:12:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:02,640 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:12:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030875634] [2023-08-23 23:12:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030875634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59235518] [2023-08-23 23:12:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:02,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-23 23:12:02,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 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:12:02,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:02,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-23 23:12:02,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:02,719 INFO L124 PetriNetUnfolderBase]: 254/492 cut-off events. [2023-08-23 23:12:02,719 INFO L125 PetriNetUnfolderBase]: For 938/938 co-relation queries the response was YES. [2023-08-23 23:12:02,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 492 events. 254/492 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2152 event pairs, 45 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1872. Up to 304 conditions per place. [2023-08-23 23:12:02,720 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 28 selfloop transitions, 4 changer transitions 27/59 dead transitions. [2023-08-23 23:12:02,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 477 flow [2023-08-23 23:12:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:12:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:12:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-08-23 23:12:02,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2023-08-23 23:12:02,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-08-23 23:12:02,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-08-23 23:12:02,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:02,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-08-23 23:12:02,723 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:12:02,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:12:02,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:12:02,724 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 216 flow. Second operand 4 states and 390 transitions. [2023-08-23 23:12:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 477 flow [2023-08-23 23:12:02,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 415 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-23 23:12:02,726 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 162 flow [2023-08-23 23:12:02,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-08-23 23:12:02,727 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-23 23:12:02,727 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 162 flow [2023-08-23 23:12:02,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 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:12:02,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:02,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:02,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:12:02,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:02,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1706584140, now seen corresponding path program 2 times [2023-08-23 23:12:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:02,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914623919] [2023-08-23 23:12:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:03,132 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:12:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914623919] [2023-08-23 23:12:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914623919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:03,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378999189] [2023-08-23 23:12:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:03,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:03,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-23 23:12:03,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:12:03,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:03,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-23 23:12:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:03,220 INFO L124 PetriNetUnfolderBase]: 66/165 cut-off events. [2023-08-23 23:12:03,220 INFO L125 PetriNetUnfolderBase]: For 284/287 co-relation queries the response was YES. [2023-08-23 23:12:03,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 165 events. 66/165 cut-off events. For 284/287 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 637 event pairs, 9 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 596. Up to 59 conditions per place. [2023-08-23 23:12:03,221 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 24 selfloop transitions, 4 changer transitions 22/53 dead transitions. [2023-08-23 23:12:03,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 402 flow [2023-08-23 23:12:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-08-23 23:12:03,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46214285714285713 [2023-08-23 23:12:03,223 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-08-23 23:12:03,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-08-23 23:12:03,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:03,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-08-23 23:12:03,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:12:03,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:12:03,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:12:03,226 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 162 flow. Second operand 7 states and 647 transitions. [2023-08-23 23:12:03,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 402 flow [2023-08-23 23:12:03,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 361 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-23 23:12:03,228 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 151 flow [2023-08-23 23:12:03,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-23 23:12:03,228 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-08-23 23:12:03,228 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 151 flow [2023-08-23 23:12:03,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:12:03,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:03,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:03,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:12:03,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:03,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 953831248, now seen corresponding path program 3 times [2023-08-23 23:12:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33898918] [2023-08-23 23:12:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:03,785 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:12:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33898918] [2023-08-23 23:12:03,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33898918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:03,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:03,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:12:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699647690] [2023-08-23 23:12:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:03,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:12:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:12:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:12:03,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-23 23:12:03,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 151 flow. Second operand has 9 states, 9 states have (on average 81.11111111111111) internal successors, (730), 9 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:12:03,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:03,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-23 23:12:03,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:04,006 INFO L124 PetriNetUnfolderBase]: 59/158 cut-off events. [2023-08-23 23:12:04,007 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-08-23 23:12:04,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 158 events. 59/158 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 559 event pairs, 10 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 596. Up to 86 conditions per place. [2023-08-23 23:12:04,007 INFO L140 encePairwiseOnDemand]: 192/200 looper letters, 25 selfloop transitions, 4 changer transitions 29/58 dead transitions. [2023-08-23 23:12:04,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 437 flow [2023-08-23 23:12:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:12:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:12:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 753 transitions. [2023-08-23 23:12:04,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41833333333333333 [2023-08-23 23:12:04,009 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 753 transitions. [2023-08-23 23:12:04,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 753 transitions. [2023-08-23 23:12:04,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:04,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 753 transitions. [2023-08-23 23:12:04,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.66666666666667) internal successors, (753), 9 states have internal predecessors, (753), 0 states have call successors, (0), 0 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:12:04,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:12:04,014 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:12:04,014 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 151 flow. Second operand 9 states and 753 transitions. [2023-08-23 23:12:04,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 437 flow [2023-08-23 23:12:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 421 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-23 23:12:04,016 INFO L231 Difference]: Finished difference. Result has 55 places, 29 transitions, 169 flow [2023-08-23 23:12:04,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=29} [2023-08-23 23:12:04,017 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-08-23 23:12:04,017 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 29 transitions, 169 flow [2023-08-23 23:12:04,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.11111111111111) internal successors, (730), 9 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:12:04,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:04,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:04,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:12:04,018 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:04,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash 975147574, now seen corresponding path program 4 times [2023-08-23 23:12:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372721180] [2023-08-23 23:12:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:04,125 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:12:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372721180] [2023-08-23 23:12:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372721180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684459584] [2023-08-23 23:12:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:04,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-23 23:12:04,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 29 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:12:04,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:04,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-23 23:12:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:04,170 INFO L124 PetriNetUnfolderBase]: 38/104 cut-off events. [2023-08-23 23:12:04,170 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-23 23:12:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 104 events. 38/104 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 325 event pairs, 7 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 424. Up to 54 conditions per place. [2023-08-23 23:12:04,171 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 24 selfloop transitions, 1 changer transitions 16/42 dead transitions. [2023-08-23 23:12:04,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 323 flow [2023-08-23 23:12:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:12:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:12:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-23 23:12:04,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48625 [2023-08-23 23:12:04,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-23 23:12:04,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-23 23:12:04,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:04,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-23 23:12:04,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:12:04,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:12:04,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:12:04,175 INFO L175 Difference]: Start difference. First operand has 55 places, 29 transitions, 169 flow. Second operand 4 states and 389 transitions. [2023-08-23 23:12:04,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 323 flow [2023-08-23 23:12:04,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 304 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-23 23:12:04,177 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 123 flow [2023-08-23 23:12:04,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-08-23 23:12:04,179 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-08-23 23:12:04,179 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 123 flow [2023-08-23 23:12:04,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:12:04,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:04,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:04,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:12:04,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:04,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -948963652, now seen corresponding path program 5 times [2023-08-23 23:12:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261239117] [2023-08-23 23:12:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:12:04,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:12:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:12:04,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:12:04,262 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:12:04,263 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:12:04,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:12:04,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:12:04,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:12:04,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:12:04,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:12:04,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:12:04,266 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2023-08-23 23:12:04,269 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:12:04,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:12:04,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:12:04 BasicIcfg [2023-08-23 23:12:04,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:12:04,321 INFO L158 Benchmark]: Toolchain (without parser) took 7354.63ms. Allocated memory was 388.0MB in the beginning and 633.3MB in the end (delta: 245.4MB). Free memory was 362.5MB in the beginning and 458.0MB in the end (delta: -95.5MB). Peak memory consumption was 151.8MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,321 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 388.0MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:12:04,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.26ms. Allocated memory is still 388.0MB. Free memory was 362.5MB in the beginning and 339.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.83ms. Allocated memory is still 388.0MB. Free memory was 339.8MB in the beginning and 337.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,322 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 388.0MB. Free memory was 337.4MB in the beginning and 335.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,322 INFO L158 Benchmark]: RCFGBuilder took 611.39ms. Allocated memory is still 388.0MB. Free memory was 335.3MB in the beginning and 348.4MB in the end (delta: -13.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,322 INFO L158 Benchmark]: TraceAbstraction took 6191.34ms. Allocated memory was 388.0MB in the beginning and 633.3MB in the end (delta: 245.4MB). Free memory was 347.5MB in the beginning and 458.0MB in the end (delta: -110.5MB). Peak memory consumption was 135.7MB. Max. memory is 16.0GB. [2023-08-23 23:12:04,323 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.09ms. Allocated memory is still 388.0MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 449.26ms. Allocated memory is still 388.0MB. Free memory was 362.5MB in the beginning and 339.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.83ms. Allocated memory is still 388.0MB. Free memory was 339.8MB in the beginning and 337.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 388.0MB. Free memory was 337.4MB in the beginning and 335.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 611.39ms. Allocated memory is still 388.0MB. Free memory was 335.3MB in the beginning and 348.4MB in the end (delta: -13.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. * TraceAbstraction took 6191.34ms. Allocated memory was 388.0MB in the beginning and 633.3MB in the end (delta: 245.4MB). Free memory was 347.5MB in the beginning and 458.0MB in the end (delta: -110.5MB). Peak memory consumption was 135.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 111 PlacesBefore, 31 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 4017 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1866, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 920, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1866, independent: 841, independent conditional: 0, independent unconditional: 841, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 920, unknown conditional: 0, unknown unconditional: 920] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-3, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-2, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: 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: 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. - UnprovableResult [Line: 828]: 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, 131 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: 6.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 12 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 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:12:04,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...