/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/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:02:16,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:02:16,425 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:02:16,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:02:16,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:02:16,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:02:16,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:02:16,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:02:16,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:02:16,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:02:16,452 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:02:16,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:02:16,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:02:16,453 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:02:16,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:02:16,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:02:16,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:02:16,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:02:16,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:02:16,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:02:16,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:02:16,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:02:16,459 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:02:16,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:02:16,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:02:16,460 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:02:16,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:02:16,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:02:16,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:02:16,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:02:16,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:02:16,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:02:16,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:02:16,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:02:16,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:02:16,463 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:02:16,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:02:16,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:02:16,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:02:16,819 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:02:16,819 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:02:16,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:02:18,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:02:18,381 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:02:18,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:02:18,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3af25262/5e3a6b6137974de18459f923cee51bcf/FLAGe427bbf0e [2023-08-23 23:02:18,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3af25262/5e3a6b6137974de18459f923cee51bcf [2023-08-23 23:02:18,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:02:18,429 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:02:18,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:02:18,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:02:18,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:02:18,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:18,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66927770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18, skipping insertion in model container [2023-08-23 23:02:18,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:18,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:02:18,648 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-23 23:02:18,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:02:18,845 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:02:18,855 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-23 23:02:18,863 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:02:18,869 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:02:18,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:02:18,959 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:02:18,960 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:02:18,966 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:02:18,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18 WrapperNode [2023-08-23 23:02:18,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:02:18,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:02:18,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:02:18,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:02:18,973 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:02:18" (1/1) ... [2023-08-23 23:02:18,987 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:02:18" (1/1) ... [2023-08-23 23:02:19,011 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-23 23:02:19,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:02:19,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:02:19,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:02:19,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:02:19,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:02:19,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:02:19,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:02:19,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:02:19,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (1/1) ... [2023-08-23 23:02:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:02:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:02:19,082 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:02:19,104 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:02:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:02:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:02:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:02:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:02:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:02:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:02:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:02:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:02:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:02:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:02:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:02:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:02:19,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:02:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:02:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:02:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:02:19,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:02:19,128 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:02:19,275 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:02:19,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:02:19,557 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:02:19,700 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:02:19,700 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:02:19,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:02:19 BoogieIcfgContainer [2023-08-23 23:02:19,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:02:19,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:02:19,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:02:19,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:02:19,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:02:18" (1/3) ... [2023-08-23 23:02:19,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6301b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:02:19, skipping insertion in model container [2023-08-23 23:02:19,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:02:18" (2/3) ... [2023-08-23 23:02:19,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6301b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:02:19, skipping insertion in model container [2023-08-23 23:02:19,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:02:19" (3/3) ... [2023-08-23 23:02:19,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:02:19,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:02:19,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:02:19,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:02:19,785 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:02:19,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 23:02:19,893 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 23:02:19,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:02:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:02:19,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 23:02:19,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-23 23:02:19,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:02:19,922 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 23:02:19,925 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 23:02:19,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-23 23:02:19,966 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 23:02:19,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:02:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:02:19,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 2986 [2023-08-23 23:02:23,727 INFO L134 LiptonReduction]: Checked pairs total: 8489 [2023-08-23 23:02:23,727 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-23 23:02:23,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:02:23,742 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;@48d42b7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:02:23,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 23:02:23,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:02:23,745 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-23 23:02:23,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:02:23,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:23,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:23,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:23,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1745103999, now seen corresponding path program 1 times [2023-08-23 23:02:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154442460] [2023-08-23 23:02:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:24,168 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:02:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154442460] [2023-08-23 23:02:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154442460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:02:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521900471] [2023-08-23 23:02:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:24,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:02:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:24,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:02:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:02:24,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-23 23:02:24,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:02:24,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:24,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-23 23:02:24,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:24,900 INFO L124 PetriNetUnfolderBase]: 3975/5715 cut-off events. [2023-08-23 23:02:24,900 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-23 23:02:24,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 5715 events. 3975/5715 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30661 event pairs, 1089 based on Foata normal form. 192/5483 useless extension candidates. Maximal degree in co-relation 11283. Up to 4303 conditions per place. [2023-08-23 23:02:24,935 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2023-08-23 23:02:24,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2023-08-23 23:02:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:02:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:02:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-23 23:02:24,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475177304964539 [2023-08-23 23:02:24,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-23 23:02:24,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-23 23:02:24,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:24,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-23 23:02:24,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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:02:24,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:02:24,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:02:24,969 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 386 transitions. [2023-08-23 23:02:24,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2023-08-23 23:02:24,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:02:24,976 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-23 23:02:24,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-23 23:02:24,981 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-23 23:02:24,981 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-23 23:02:24,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:02:24,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:24,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:24,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:02:24,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:24,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2095058766, now seen corresponding path program 1 times [2023-08-23 23:02:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860206666] [2023-08-23 23:02:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:26,212 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:02:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860206666] [2023-08-23 23:02:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860206666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:02:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165112775] [2023-08-23 23:02:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:26,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-23 23:02:26,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 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:02:26,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:26,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-23 23:02:26,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:27,948 INFO L124 PetriNetUnfolderBase]: 12629/17088 cut-off events. [2023-08-23 23:02:27,948 INFO L125 PetriNetUnfolderBase]: For 708/708 co-relation queries the response was YES. [2023-08-23 23:02:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35178 conditions, 17088 events. 12629/17088 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 83208 event pairs, 1959 based on Foata normal form. 714/17802 useless extension candidates. Maximal degree in co-relation 35168. Up to 12329 conditions per place. [2023-08-23 23:02:28,038 INFO L140 encePairwiseOnDemand]: 223/235 looper letters, 48 selfloop transitions, 12 changer transitions 41/101 dead transitions. [2023-08-23 23:02:28,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 101 transitions, 426 flow [2023-08-23 23:02:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:02:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:02:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2023-08-23 23:02:28,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717325227963526 [2023-08-23 23:02:28,041 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 776 transitions. [2023-08-23 23:02:28,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 776 transitions. [2023-08-23 23:02:28,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:28,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 776 transitions. [2023-08-23 23:02:28,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 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:02:28,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:28,048 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:28,048 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 776 transitions. [2023-08-23 23:02:28,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 101 transitions, 426 flow [2023-08-23 23:02:28,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 101 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:02:28,053 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-08-23 23:02:28,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-23 23:02:28,054 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-23 23:02:28,055 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-08-23 23:02:28,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 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:02:28,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:28,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:28,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:02:28,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:28,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash 522280250, now seen corresponding path program 1 times [2023-08-23 23:02:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:28,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135841833] [2023-08-23 23:02:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:28,251 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:02:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135841833] [2023-08-23 23:02:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135841833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:02:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026945624] [2023-08-23 23:02:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:02:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:02:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:02:28,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-23 23:02:28,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:28,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:28,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-23 23:02:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:29,420 INFO L124 PetriNetUnfolderBase]: 7268/10269 cut-off events. [2023-08-23 23:02:29,421 INFO L125 PetriNetUnfolderBase]: For 7911/8257 co-relation queries the response was YES. [2023-08-23 23:02:29,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30545 conditions, 10269 events. 7268/10269 cut-off events. For 7911/8257 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 56210 event pairs, 2228 based on Foata normal form. 607/10669 useless extension candidates. Maximal degree in co-relation 30530. Up to 5433 conditions per place. [2023-08-23 23:02:29,488 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 41 selfloop transitions, 3 changer transitions 27/78 dead transitions. [2023-08-23 23:02:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 448 flow [2023-08-23 23:02:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:02:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:02:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-23 23:02:29,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208510638297872 [2023-08-23 23:02:29,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-23 23:02:29,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-23 23:02:29,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:29,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-23 23:02:29,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 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:02:29,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:29,495 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:29,495 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 5 states and 612 transitions. [2023-08-23 23:02:29,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 448 flow [2023-08-23 23:02:29,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 444 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 23:02:29,661 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 170 flow [2023-08-23 23:02:29,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-23 23:02:29,663 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-23 23:02:29,665 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 170 flow [2023-08-23 23:02:29,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:29,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:29,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:29,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:02:29,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:29,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1629075003, now seen corresponding path program 1 times [2023-08-23 23:02:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162588977] [2023-08-23 23:02:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:30,046 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:02:30,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:30,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162588977] [2023-08-23 23:02:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162588977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:30,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:02:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593040988] [2023-08-23 23:02:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:30,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-23 23:02:30,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:02:30,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:30,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-23 23:02:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:30,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][44], [Black: 155#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 114#L864true, 172#true, 162#true, 104#L754true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 167#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork2InUse, 97#P1EXITtrue, P1Thread1of1ForFork1InUse, 147#true, 12#L829true, Black: 149#(= ~z~0 0), 23#L796true]) [2023-08-23 23:02:30,796 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,796 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,796 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,796 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L864-->L18: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd0~0_74 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd0~0_76 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_166 256) 0)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_141 256) 0) .cse3)) (.cse5 (and .cse10 .cse3))) (let ((.cse8 (or .cse12 .cse7 .cse5)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse0 (ite .cse8 v_~y~0_94 (ite .cse9 v_~y$w_buff0~0_78 v_~y$w_buff1~0_73))) (.cse1 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_165 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_140 256) 0))) (and (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2) (= .cse0 2) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1)) (= v_~y$r_buff0_thd0~0_75 (ite .cse1 v_~y$r_buff0_thd0~0_76 (ite (or (and .cse2 .cse3) .cse4 .cse5) v_~y$r_buff0_thd0~0_76 (ite (and .cse6 (not .cse4)) 0 v_~y$r_buff0_thd0~0_76)))) (= v_~y~0_94 v_~y$mem_tmp~0_24) (= v_~y$w_buff1~0_73 v_~y$w_buff1~0_72) (= v_~y$w_buff1_used~0_140 (ite .cse1 v_~y$w_buff1_used~0_141 (ite (or .cse7 .cse4 .cse5) v_~y$w_buff1_used~0_141 0))) (= v_~y$w_buff0_used~0_165 (ite .cse1 v_~y$w_buff0_used~0_166 (ite .cse8 v_~y$w_buff0_used~0_166 (ite .cse9 0 v_~y$w_buff0_used~0_166)))) (= v_~y$w_buff0~0_78 v_~y$w_buff0~0_77) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| (mod v_~main$tmp_guard1~0_18 256)) (= 0 v_~y$flush_delayed~0_29) (= (ite .cse1 v_~y$mem_tmp~0_24 .cse0) v_~y~0_93) (= (ite .cse1 v_~y$r_buff1_thd0~0_74 (ite (let ((.cse11 (= (mod v_~y$r_buff0_thd0~0_75 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse2))) v_~y$r_buff1_thd0~0_74 0)) v_~y$r_buff1_thd0~0_73)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_73, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~z~0=v_~z~0_20, ~y~0=v_~y~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_23|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$flush_delayed~0=v_~y$flush_delayed~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_20, ~y~0=v_~y~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][47], [Black: 155#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 172#true, 162#true, 104#L754true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 167#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork2InUse, 97#P1EXITtrue, P1Thread1of1ForFork1InUse, 147#true, 98#L18true, 45#L822true, Black: 149#(= ~z~0 0), 23#L796true]) [2023-08-23 23:02:30,797 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,797 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,797 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:30,797 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:02:31,155 INFO L124 PetriNetUnfolderBase]: 8058/11500 cut-off events. [2023-08-23 23:02:31,155 INFO L125 PetriNetUnfolderBase]: For 11129/11720 co-relation queries the response was YES. [2023-08-23 23:02:31,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34726 conditions, 11500 events. 8058/11500 cut-off events. For 11129/11720 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 63749 event pairs, 2805 based on Foata normal form. 590/11657 useless extension candidates. Maximal degree in co-relation 34708. Up to 8221 conditions per place. [2023-08-23 23:02:31,224 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 41 selfloop transitions, 3 changer transitions 22/74 dead transitions. [2023-08-23 23:02:31,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 418 flow [2023-08-23 23:02:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:02:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:02:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-23 23:02:31,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505531914893617 [2023-08-23 23:02:31,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-23 23:02:31,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-23 23:02:31,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:31,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-23 23:02:31,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 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:02:31,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:31,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:31,232 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 170 flow. Second operand 5 states and 594 transitions. [2023-08-23 23:02:31,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 418 flow [2023-08-23 23:02:31,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 400 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-23 23:02:31,402 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 182 flow [2023-08-23 23:02:31,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-23 23:02:31,403 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-23 23:02:31,403 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 182 flow [2023-08-23 23:02:31,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:02:31,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:31,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:31,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:02:31,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:31,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1038300100, now seen corresponding path program 1 times [2023-08-23 23:02:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259057091] [2023-08-23 23:02:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:31,911 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:02:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259057091] [2023-08-23 23:02:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259057091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273476777] [2023-08-23 23:02:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:31,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:02:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:02:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:02:31,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-23 23:02:31,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:02:31,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:31,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-23 23:02:31,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:32,916 INFO L124 PetriNetUnfolderBase]: 7701/11003 cut-off events. [2023-08-23 23:02:32,916 INFO L125 PetriNetUnfolderBase]: For 10509/11204 co-relation queries the response was YES. [2023-08-23 23:02:32,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34278 conditions, 11003 events. 7701/11003 cut-off events. For 10509/11204 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 60654 event pairs, 2727 based on Foata normal form. 539/11140 useless extension candidates. Maximal degree in co-relation 34260. Up to 7708 conditions per place. [2023-08-23 23:02:32,975 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 52 selfloop transitions, 9 changer transitions 22/91 dead transitions. [2023-08-23 23:02:32,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 549 flow [2023-08-23 23:02:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:02:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:02:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-23 23:02:32,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2023-08-23 23:02:32,978 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-23 23:02:32,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-23 23:02:32,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:32,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-23 23:02:32,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:02:32,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:32,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:32,982 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 182 flow. Second operand 6 states and 715 transitions. [2023-08-23 23:02:32,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 549 flow [2023-08-23 23:02:33,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 542 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:02:33,071 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 275 flow [2023-08-23 23:02:33,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-23 23:02:33,072 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-08-23 23:02:33,072 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 275 flow [2023-08-23 23:02:33,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:02:33,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:33,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:33,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:02:33,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:33,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1835132831, now seen corresponding path program 1 times [2023-08-23 23:02:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838126178] [2023-08-23 23:02:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:33,288 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:02:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838126178] [2023-08-23 23:02:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838126178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:02:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355974854] [2023-08-23 23:02:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:33,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:33,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:02:33,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:33,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:33,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:34,288 INFO L124 PetriNetUnfolderBase]: 7673/10950 cut-off events. [2023-08-23 23:02:34,288 INFO L125 PetriNetUnfolderBase]: For 20010/20875 co-relation queries the response was YES. [2023-08-23 23:02:34,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38566 conditions, 10950 events. 7673/10950 cut-off events. For 20010/20875 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 59604 event pairs, 1997 based on Foata normal form. 472/11070 useless extension candidates. Maximal degree in co-relation 38544. Up to 7132 conditions per place. [2023-08-23 23:02:34,360 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 57 selfloop transitions, 10 changer transitions 19/94 dead transitions. [2023-08-23 23:02:34,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 650 flow [2023-08-23 23:02:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:02:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:02:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-08-23 23:02:34,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134751773049645 [2023-08-23 23:02:34,363 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-08-23 23:02:34,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-08-23 23:02:34,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:34,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-08-23 23:02:34,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:02:34,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:34,367 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:34,367 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 275 flow. Second operand 6 states and 724 transitions. [2023-08-23 23:02:34,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 650 flow [2023-08-23 23:02:34,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 642 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-23 23:02:34,468 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 331 flow [2023-08-23 23:02:34,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-08-23 23:02:34,470 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-08-23 23:02:34,470 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 331 flow [2023-08-23 23:02:34,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:02:34,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:34,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:34,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:02:34,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:34,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1790878781, now seen corresponding path program 2 times [2023-08-23 23:02:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379791920] [2023-08-23 23:02:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:34,795 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:02:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379791920] [2023-08-23 23:02:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379791920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541669807] [2023-08-23 23:02:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:02:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:02:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:02:34,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-23 23:02:34,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:02:34,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:34,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-23 23:02:34,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:35,838 INFO L124 PetriNetUnfolderBase]: 7626/10879 cut-off events. [2023-08-23 23:02:35,838 INFO L125 PetriNetUnfolderBase]: For 28088/29251 co-relation queries the response was YES. [2023-08-23 23:02:35,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41404 conditions, 10879 events. 7626/10879 cut-off events. For 28088/29251 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 59186 event pairs, 2106 based on Foata normal form. 589/11126 useless extension candidates. Maximal degree in co-relation 41378. Up to 7124 conditions per place. [2023-08-23 23:02:35,891 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 58 selfloop transitions, 12 changer transitions 25/103 dead transitions. [2023-08-23 23:02:35,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 780 flow [2023-08-23 23:02:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:02:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:02:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-23 23:02:35,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-23 23:02:35,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-23 23:02:35,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-23 23:02:35,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:35,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-23 23:02:35,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 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:02:35,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:35,902 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:35,902 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 331 flow. Second operand 7 states and 826 transitions. [2023-08-23 23:02:35,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 780 flow [2023-08-23 23:02:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 758 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-23 23:02:36,032 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 389 flow [2023-08-23 23:02:36,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-23 23:02:36,033 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-08-23 23:02:36,033 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 389 flow [2023-08-23 23:02:36,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:02:36,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:36,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:02:36,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:36,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1168469844, now seen corresponding path program 1 times [2023-08-23 23:02:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491249695] [2023-08-23 23:02:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:36,520 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:02:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491249695] [2023-08-23 23:02:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491249695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215572680] [2023-08-23 23:02:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:36,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:02:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:02:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:02:36,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-23 23:02:36,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:36,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:36,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-23 23:02:36,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:37,514 INFO L124 PetriNetUnfolderBase]: 7368/10552 cut-off events. [2023-08-23 23:02:37,514 INFO L125 PetriNetUnfolderBase]: For 37058/38421 co-relation queries the response was YES. [2023-08-23 23:02:37,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42803 conditions, 10552 events. 7368/10552 cut-off events. For 37058/38421 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 57736 event pairs, 1588 based on Foata normal form. 559/10760 useless extension candidates. Maximal degree in co-relation 42774. Up to 7070 conditions per place. [2023-08-23 23:02:37,565 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 59 selfloop transitions, 13 changer transitions 20/100 dead transitions. [2023-08-23 23:02:37,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 822 flow [2023-08-23 23:02:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:02:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:02:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2023-08-23 23:02:37,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2023-08-23 23:02:37,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2023-08-23 23:02:37,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2023-08-23 23:02:37,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:37,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2023-08-23 23:02:37,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 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:02:37,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:37,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:37,572 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 389 flow. Second operand 6 states and 700 transitions. [2023-08-23 23:02:37,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 822 flow [2023-08-23 23:02:37,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 778 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-23 23:02:37,804 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 446 flow [2023-08-23 23:02:37,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-23 23:02:37,805 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2023-08-23 23:02:37,805 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 446 flow [2023-08-23 23:02:37,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:37,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:37,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:02:37,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:37,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1066294364, now seen corresponding path program 1 times [2023-08-23 23:02:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:37,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489946641] [2023-08-23 23:02:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:38,272 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:02:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489946641] [2023-08-23 23:02:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489946641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:38,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553618230] [2023-08-23 23:02:38,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:38,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:02:38,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:02:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:02:38,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-23 23:02:38,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:38,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:38,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-23 23:02:38,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:39,741 INFO L124 PetriNetUnfolderBase]: 9110/12697 cut-off events. [2023-08-23 23:02:39,742 INFO L125 PetriNetUnfolderBase]: For 49848/52311 co-relation queries the response was YES. [2023-08-23 23:02:39,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53712 conditions, 12697 events. 9110/12697 cut-off events. For 49848/52311 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 68940 event pairs, 4664 based on Foata normal form. 898/13004 useless extension candidates. Maximal degree in co-relation 53681. Up to 9126 conditions per place. [2023-08-23 23:02:39,824 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 65 selfloop transitions, 24 changer transitions 21/118 dead transitions. [2023-08-23 23:02:39,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 118 transitions, 1046 flow [2023-08-23 23:02:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:02:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:02:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-08-23 23:02:39,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015197568389058 [2023-08-23 23:02:39,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-08-23 23:02:39,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-08-23 23:02:39,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:39,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-08-23 23:02:39,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:02:39,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:39,832 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:39,832 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 446 flow. Second operand 7 states and 825 transitions. [2023-08-23 23:02:39,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 118 transitions, 1046 flow [2023-08-23 23:02:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 1010 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-23 23:02:39,971 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 657 flow [2023-08-23 23:02:39,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=657, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-23 23:02:39,972 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2023-08-23 23:02:39,972 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 657 flow [2023-08-23 23:02:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:39,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:39,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:39,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:02:39,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:39,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 317314996, now seen corresponding path program 2 times [2023-08-23 23:02:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457163306] [2023-08-23 23:02:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:40,323 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:02:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457163306] [2023-08-23 23:02:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457163306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546734131] [2023-08-23 23:02:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:40,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:02:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:02:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:02:40,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-23 23:02:40,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 657 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 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:02:40,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:40,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-23 23:02:40,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:41,672 INFO L124 PetriNetUnfolderBase]: 9283/13050 cut-off events. [2023-08-23 23:02:41,672 INFO L125 PetriNetUnfolderBase]: For 69903/74014 co-relation queries the response was YES. [2023-08-23 23:02:41,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60917 conditions, 13050 events. 9283/13050 cut-off events. For 69903/74014 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 71446 event pairs, 2468 based on Foata normal form. 1186/13795 useless extension candidates. Maximal degree in co-relation 60885. Up to 9110 conditions per place. [2023-08-23 23:02:41,753 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 82 selfloop transitions, 27 changer transitions 12/129 dead transitions. [2023-08-23 23:02:41,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 1272 flow [2023-08-23 23:02:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:02:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:02:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-08-23 23:02:41,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014184397163121 [2023-08-23 23:02:41,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-08-23 23:02:41,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-08-23 23:02:41,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:41,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-08-23 23:02:41,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 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:02:41,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:41,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:41,759 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 657 flow. Second operand 6 states and 707 transitions. [2023-08-23 23:02:41,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 1272 flow [2023-08-23 23:02:41,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 1217 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-08-23 23:02:41,977 INFO L231 Difference]: Finished difference. Result has 72 places, 87 transitions, 865 flow [2023-08-23 23:02:41,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=72, PETRI_TRANSITIONS=87} [2023-08-23 23:02:41,977 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-08-23 23:02:41,977 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 865 flow [2023-08-23 23:02:41,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 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:02:41,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:41,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:41,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:02:41,978 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:41,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1052455964, now seen corresponding path program 3 times [2023-08-23 23:02:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679810402] [2023-08-23 23:02:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:43,076 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:02:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679810402] [2023-08-23 23:02:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679810402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263551184] [2023-08-23 23:02:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:43,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:02:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:02:43,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:02:43,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-23 23:02:43,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 865 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 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:02:43,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:43,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-23 23:02:43,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:45,080 INFO L124 PetriNetUnfolderBase]: 13641/18564 cut-off events. [2023-08-23 23:02:45,081 INFO L125 PetriNetUnfolderBase]: For 82660/82660 co-relation queries the response was YES. [2023-08-23 23:02:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87943 conditions, 18564 events. 13641/18564 cut-off events. For 82660/82660 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 93492 event pairs, 1767 based on Foata normal form. 424/18988 useless extension candidates. Maximal degree in co-relation 87910. Up to 12075 conditions per place. [2023-08-23 23:02:45,182 INFO L140 encePairwiseOnDemand]: 221/235 looper letters, 97 selfloop transitions, 56 changer transitions 37/190 dead transitions. [2023-08-23 23:02:45,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 190 transitions, 2034 flow [2023-08-23 23:02:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:02:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:02:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2023-08-23 23:02:45,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46595744680851064 [2023-08-23 23:02:45,185 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 876 transitions. [2023-08-23 23:02:45,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 876 transitions. [2023-08-23 23:02:45,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:45,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 876 transitions. [2023-08-23 23:02:45,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 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:02:45,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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:02:45,190 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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:02:45,191 INFO L175 Difference]: Start difference. First operand has 72 places, 87 transitions, 865 flow. Second operand 8 states and 876 transitions. [2023-08-23 23:02:45,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 190 transitions, 2034 flow [2023-08-23 23:02:45,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 190 transitions, 1937 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-23 23:02:45,384 INFO L231 Difference]: Finished difference. Result has 79 places, 115 transitions, 1360 flow [2023-08-23 23:02:45,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1360, PETRI_PLACES=79, PETRI_TRANSITIONS=115} [2023-08-23 23:02:45,384 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-08-23 23:02:45,384 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 115 transitions, 1360 flow [2023-08-23 23:02:45,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 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:02:45,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:45,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:45,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:02:45,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:45,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1734036894, now seen corresponding path program 4 times [2023-08-23 23:02:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336824328] [2023-08-23 23:02:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:45,629 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:02:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336824328] [2023-08-23 23:02:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336824328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543219231] [2023-08-23 23:02:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:45,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:02:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:02:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:02:45,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-23 23:02:45,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 115 transitions, 1360 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:02:45,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:45,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-23 23:02:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:47,148 INFO L124 PetriNetUnfolderBase]: 10828/15351 cut-off events. [2023-08-23 23:02:47,149 INFO L125 PetriNetUnfolderBase]: For 122774/124394 co-relation queries the response was YES. [2023-08-23 23:02:47,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89363 conditions, 15351 events. 10828/15351 cut-off events. For 122774/124394 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 84838 event pairs, 1886 based on Foata normal form. 1452/16747 useless extension candidates. Maximal degree in co-relation 89326. Up to 9307 conditions per place. [2023-08-23 23:02:47,258 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 95 selfloop transitions, 40 changer transitions 12/161 dead transitions. [2023-08-23 23:02:47,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 161 transitions, 1949 flow [2023-08-23 23:02:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:02:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:02:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-23 23:02:47,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49969604863221884 [2023-08-23 23:02:47,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-23 23:02:47,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-23 23:02:47,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:47,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-23 23:02:47,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:02:47,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:47,266 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:47,266 INFO L175 Difference]: Start difference. First operand has 79 places, 115 transitions, 1360 flow. Second operand 7 states and 822 transitions. [2023-08-23 23:02:47,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 161 transitions, 1949 flow [2023-08-23 23:02:47,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 161 transitions, 1886 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-08-23 23:02:47,510 INFO L231 Difference]: Finished difference. Result has 82 places, 114 transitions, 1374 flow [2023-08-23 23:02:47,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1374, PETRI_PLACES=82, PETRI_TRANSITIONS=114} [2023-08-23 23:02:47,511 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2023-08-23 23:02:47,511 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 114 transitions, 1374 flow [2023-08-23 23:02:47,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:02:47,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:47,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:47,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:02:47,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:47,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash -348755394, now seen corresponding path program 5 times [2023-08-23 23:02:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735758751] [2023-08-23 23:02:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:48,740 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:02:48,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:48,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735758751] [2023-08-23 23:02:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735758751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:48,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:48,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:02:48,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205397420] [2023-08-23 23:02:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:48,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:02:48,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:02:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:02:48,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-23 23:02:48,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 114 transitions, 1374 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 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:02:48,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:48,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-23 23:02:48,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:50,783 INFO L124 PetriNetUnfolderBase]: 13541/18466 cut-off events. [2023-08-23 23:02:50,784 INFO L125 PetriNetUnfolderBase]: For 114768/114768 co-relation queries the response was YES. [2023-08-23 23:02:50,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103344 conditions, 18466 events. 13541/18466 cut-off events. For 114768/114768 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 93487 event pairs, 1732 based on Foata normal form. 276/18742 useless extension candidates. Maximal degree in co-relation 103306. Up to 10972 conditions per place. [2023-08-23 23:02:50,904 INFO L140 encePairwiseOnDemand]: 221/235 looper letters, 116 selfloop transitions, 88 changer transitions 36/240 dead transitions. [2023-08-23 23:02:50,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 240 transitions, 2941 flow [2023-08-23 23:02:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 23:02:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 23:02:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1094 transitions. [2023-08-23 23:02:50,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465531914893617 [2023-08-23 23:02:50,907 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1094 transitions. [2023-08-23 23:02:50,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1094 transitions. [2023-08-23 23:02:50,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:50,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1094 transitions. [2023-08-23 23:02:50,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 109.4) internal successors, (1094), 10 states have internal predecessors, (1094), 0 states have call successors, (0), 0 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:02:50,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 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:02:50,913 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 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:02:50,913 INFO L175 Difference]: Start difference. First operand has 82 places, 114 transitions, 1374 flow. Second operand 10 states and 1094 transitions. [2023-08-23 23:02:50,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 240 transitions, 2941 flow [2023-08-23 23:02:51,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 240 transitions, 2882 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-23 23:02:51,198 INFO L231 Difference]: Finished difference. Result has 94 places, 151 transitions, 2224 flow [2023-08-23 23:02:51,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2224, PETRI_PLACES=94, PETRI_TRANSITIONS=151} [2023-08-23 23:02:51,199 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-08-23 23:02:51,199 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 151 transitions, 2224 flow [2023-08-23 23:02:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 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:02:51,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:51,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:51,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:02:51,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:51,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash -845889079, now seen corresponding path program 1 times [2023-08-23 23:02:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494955267] [2023-08-23 23:02:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:51,309 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:02:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494955267] [2023-08-23 23:02:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494955267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:51,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:51,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:02:51,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639964721] [2023-08-23 23:02:51,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:51,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:02:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:02:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:02:51,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:51,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 151 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:02:51,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:51,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:51,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:52,422 INFO L124 PetriNetUnfolderBase]: 6065/8775 cut-off events. [2023-08-23 23:02:52,422 INFO L125 PetriNetUnfolderBase]: For 126236/129123 co-relation queries the response was YES. [2023-08-23 23:02:52,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60262 conditions, 8775 events. 6065/8775 cut-off events. For 126236/129123 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 48401 event pairs, 1036 based on Foata normal form. 1367/9796 useless extension candidates. Maximal degree in co-relation 60217. Up to 6490 conditions per place. [2023-08-23 23:02:52,491 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 168 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2023-08-23 23:02:52,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 208 transitions, 3352 flow [2023-08-23 23:02:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:02:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:02:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-23 23:02:52,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-08-23 23:02:52,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-23 23:02:52,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-23 23:02:52,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:52,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-23 23:02:52,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:02:52,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:02:52,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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:02:52,495 INFO L175 Difference]: Start difference. First operand has 94 places, 151 transitions, 2224 flow. Second operand 3 states and 368 transitions. [2023-08-23 23:02:52,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 208 transitions, 3352 flow [2023-08-23 23:02:52,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 208 transitions, 3237 flow, removed 57 selfloop flow, removed 2 redundant places. [2023-08-23 23:02:52,677 INFO L231 Difference]: Finished difference. Result has 92 places, 153 transitions, 2127 flow [2023-08-23 23:02:52,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=92, PETRI_TRANSITIONS=153} [2023-08-23 23:02:52,677 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-08-23 23:02:52,677 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 153 transitions, 2127 flow [2023-08-23 23:02:52,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:02:52,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:52,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 23:02:52,678 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:52,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash -455219962, now seen corresponding path program 1 times [2023-08-23 23:02:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451116911] [2023-08-23 23:02:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:52,926 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:02:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451116911] [2023-08-23 23:02:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451116911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:52,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:52,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:02:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271663562] [2023-08-23 23:02:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:52,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:02:52,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:02:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:02:52,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:52,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 153 transitions, 2127 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:52,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:52,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:53,604 INFO L124 PetriNetUnfolderBase]: 2958/4511 cut-off events. [2023-08-23 23:02:53,605 INFO L125 PetriNetUnfolderBase]: For 53558/54824 co-relation queries the response was YES. [2023-08-23 23:02:53,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31133 conditions, 4511 events. 2958/4511 cut-off events. For 53558/54824 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 23661 event pairs, 378 based on Foata normal form. 771/5165 useless extension candidates. Maximal degree in co-relation 31087. Up to 2110 conditions per place. [2023-08-23 23:02:53,643 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 194 selfloop transitions, 9 changer transitions 0/238 dead transitions. [2023-08-23 23:02:53,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 238 transitions, 3720 flow [2023-08-23 23:02:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:02:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:02:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-23 23:02:53,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2023-08-23 23:02:53,645 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-23 23:02:53,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-23 23:02:53,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:53,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-23 23:02:53,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 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:02:53,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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:02:53,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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:02:53,648 INFO L175 Difference]: Start difference. First operand has 92 places, 153 transitions, 2127 flow. Second operand 4 states and 492 transitions. [2023-08-23 23:02:53,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 238 transitions, 3720 flow [2023-08-23 23:02:53,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 238 transitions, 3711 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-23 23:02:53,705 INFO L231 Difference]: Finished difference. Result has 95 places, 146 transitions, 2002 flow [2023-08-23 23:02:53,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2002, PETRI_PLACES=95, PETRI_TRANSITIONS=146} [2023-08-23 23:02:53,706 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2023-08-23 23:02:53,706 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 146 transitions, 2002 flow [2023-08-23 23:02:53,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:53,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:53,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-23 23:02:53,707 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:53,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1148278625, now seen corresponding path program 1 times [2023-08-23 23:02:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827612349] [2023-08-23 23:02:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:53,846 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:02:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827612349] [2023-08-23 23:02:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827612349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169457962] [2023-08-23 23:02:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:53,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:53,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:53,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:53,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 146 transitions, 2002 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:53,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:53,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:53,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:54,365 INFO L124 PetriNetUnfolderBase]: 2152/3266 cut-off events. [2023-08-23 23:02:54,365 INFO L125 PetriNetUnfolderBase]: For 36507/37404 co-relation queries the response was YES. [2023-08-23 23:02:54,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22886 conditions, 3266 events. 2152/3266 cut-off events. For 36507/37404 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16475 event pairs, 251 based on Foata normal form. 496/3672 useless extension candidates. Maximal degree in co-relation 22838. Up to 1474 conditions per place. [2023-08-23 23:02:54,394 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 181 selfloop transitions, 13 changer transitions 0/227 dead transitions. [2023-08-23 23:02:54,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 227 transitions, 3486 flow [2023-08-23 23:02:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:02:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:02:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-08-23 23:02:54,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225531914893617 [2023-08-23 23:02:54,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-08-23 23:02:54,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-08-23 23:02:54,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:54,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-08-23 23:02:54,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 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:02:54,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:54,400 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:54,400 INFO L175 Difference]: Start difference. First operand has 95 places, 146 transitions, 2002 flow. Second operand 5 states and 614 transitions. [2023-08-23 23:02:54,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 227 transitions, 3486 flow [2023-08-23 23:02:54,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 227 transitions, 3334 flow, removed 21 selfloop flow, removed 8 redundant places. [2023-08-23 23:02:54,466 INFO L231 Difference]: Finished difference. Result has 92 places, 122 transitions, 1562 flow [2023-08-23 23:02:54,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1562, PETRI_PLACES=92, PETRI_TRANSITIONS=122} [2023-08-23 23:02:54,466 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-08-23 23:02:54,466 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 122 transitions, 1562 flow [2023-08-23 23:02:54,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:02:54,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:54,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:54,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-23 23:02:54,467 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:54,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 853407513, now seen corresponding path program 1 times [2023-08-23 23:02:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:54,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679303960] [2023-08-23 23:02:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:55,205 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:02:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679303960] [2023-08-23 23:02:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679303960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:55,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700252961] [2023-08-23 23:02:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:02:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:02:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:02:55,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-08-23 23:02:55,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 122 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:55,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-08-23 23:02:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:55,966 INFO L124 PetriNetUnfolderBase]: 3858/5704 cut-off events. [2023-08-23 23:02:55,966 INFO L125 PetriNetUnfolderBase]: For 52964/52964 co-relation queries the response was YES. [2023-08-23 23:02:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38993 conditions, 5704 events. 3858/5704 cut-off events. For 52964/52964 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28177 event pairs, 453 based on Foata normal form. 14/5718 useless extension candidates. Maximal degree in co-relation 38948. Up to 3067 conditions per place. [2023-08-23 23:02:56,000 INFO L140 encePairwiseOnDemand]: 221/235 looper letters, 186 selfloop transitions, 59 changer transitions 96/341 dead transitions. [2023-08-23 23:02:56,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 341 transitions, 5005 flow [2023-08-23 23:02:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:02:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:02:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 775 transitions. [2023-08-23 23:02:56,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47112462006079026 [2023-08-23 23:02:56,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 775 transitions. [2023-08-23 23:02:56,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 775 transitions. [2023-08-23 23:02:56,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:56,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 775 transitions. [2023-08-23 23:02:56,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 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:02:56,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:56,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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:02:56,007 INFO L175 Difference]: Start difference. First operand has 92 places, 122 transitions, 1562 flow. Second operand 7 states and 775 transitions. [2023-08-23 23:02:56,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 341 transitions, 5005 flow [2023-08-23 23:02:56,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 341 transitions, 4873 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-23 23:02:56,159 INFO L231 Difference]: Finished difference. Result has 97 places, 148 transitions, 2069 flow [2023-08-23 23:02:56,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2069, PETRI_PLACES=97, PETRI_TRANSITIONS=148} [2023-08-23 23:02:56,160 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2023-08-23 23:02:56,160 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 148 transitions, 2069 flow [2023-08-23 23:02:56,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:56,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:56,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:56,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-23 23:02:56,161 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:56,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash 26939791, now seen corresponding path program 2 times [2023-08-23 23:02:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533885407] [2023-08-23 23:02:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:56,817 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:02:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533885407] [2023-08-23 23:02:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533885407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673021527] [2023-08-23 23:02:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:56,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:56,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:56,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-23 23:02:56,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 148 transitions, 2069 flow. Second operand has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:02:56,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:56,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-23 23:02:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:57,691 INFO L124 PetriNetUnfolderBase]: 4794/7217 cut-off events. [2023-08-23 23:02:57,691 INFO L125 PetriNetUnfolderBase]: For 64044/64044 co-relation queries the response was YES. [2023-08-23 23:02:57,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49424 conditions, 7217 events. 4794/7217 cut-off events. For 64044/64044 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 38116 event pairs, 774 based on Foata normal form. 17/7234 useless extension candidates. Maximal degree in co-relation 49377. Up to 3783 conditions per place. [2023-08-23 23:02:57,731 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 139 selfloop transitions, 21 changer transitions 60/220 dead transitions. [2023-08-23 23:02:57,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 220 transitions, 3278 flow [2023-08-23 23:02:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:02:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:02:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-23 23:02:57,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714893617021277 [2023-08-23 23:02:57,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-23 23:02:57,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-23 23:02:57,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:57,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-23 23:02:57,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:02:57,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:57,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:57,736 INFO L175 Difference]: Start difference. First operand has 97 places, 148 transitions, 2069 flow. Second operand 5 states and 554 transitions. [2023-08-23 23:02:57,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 220 transitions, 3278 flow [2023-08-23 23:02:58,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 220 transitions, 3274 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-23 23:02:58,034 INFO L231 Difference]: Finished difference. Result has 101 places, 121 transitions, 1680 flow [2023-08-23 23:02:58,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1680, PETRI_PLACES=101, PETRI_TRANSITIONS=121} [2023-08-23 23:02:58,035 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2023-08-23 23:02:58,035 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 121 transitions, 1680 flow [2023-08-23 23:02:58,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:02:58,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:58,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:58,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-23 23:02:58,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:58,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1137799991, now seen corresponding path program 3 times [2023-08-23 23:02:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699076672] [2023-08-23 23:02:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:58,185 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:02:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699076672] [2023-08-23 23:02:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699076672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:58,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:58,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:02:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180621679] [2023-08-23 23:02:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:58,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:02:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:02:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:02:58,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:58,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 121 transitions, 1680 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 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:02:58,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:58,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:58,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:58,751 INFO L124 PetriNetUnfolderBase]: 3045/4725 cut-off events. [2023-08-23 23:02:58,751 INFO L125 PetriNetUnfolderBase]: For 54099/55121 co-relation queries the response was YES. [2023-08-23 23:02:58,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32568 conditions, 4725 events. 3045/4725 cut-off events. For 54099/55121 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27366 event pairs, 272 based on Foata normal form. 564/5150 useless extension candidates. Maximal degree in co-relation 32530. Up to 2127 conditions per place. [2023-08-23 23:02:58,775 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 88 selfloop transitions, 17 changer transitions 96/213 dead transitions. [2023-08-23 23:02:58,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 213 transitions, 3345 flow [2023-08-23 23:02:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:02:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:02:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2023-08-23 23:02:58,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127659574468085 [2023-08-23 23:02:58,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2023-08-23 23:02:58,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2023-08-23 23:02:58,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:58,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2023-08-23 23:02:58,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:02:58,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:58,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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:02:58,780 INFO L175 Difference]: Start difference. First operand has 101 places, 121 transitions, 1680 flow. Second operand 6 states and 723 transitions. [2023-08-23 23:02:58,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 213 transitions, 3345 flow [2023-08-23 23:02:58,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 213 transitions, 3001 flow, removed 58 selfloop flow, removed 8 redundant places. [2023-08-23 23:02:58,930 INFO L231 Difference]: Finished difference. Result has 98 places, 71 transitions, 811 flow [2023-08-23 23:02:58,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=98, PETRI_TRANSITIONS=71} [2023-08-23 23:02:58,930 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-23 23:02:58,930 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 71 transitions, 811 flow [2023-08-23 23:02:58,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 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:02:58,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:58,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:58,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-23 23:02:58,931 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:58,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 979306285, now seen corresponding path program 1 times [2023-08-23 23:02:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002970139] [2023-08-23 23:02:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:02:59,071 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:02:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:02:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002970139] [2023-08-23 23:02:59,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002970139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:02:59,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:02:59,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:02:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277509578] [2023-08-23 23:02:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:02:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:02:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:02:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:02:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:02:59,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-23 23:02:59,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 71 transitions, 811 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:02:59,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:02:59,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-23 23:02:59,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:02:59,423 INFO L124 PetriNetUnfolderBase]: 1385/2244 cut-off events. [2023-08-23 23:02:59,423 INFO L125 PetriNetUnfolderBase]: For 19468/19614 co-relation queries the response was YES. [2023-08-23 23:02:59,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14184 conditions, 2244 events. 1385/2244 cut-off events. For 19468/19614 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11571 event pairs, 207 based on Foata normal form. 51/2212 useless extension candidates. Maximal degree in co-relation 14144. Up to 1083 conditions per place. [2023-08-23 23:02:59,437 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 55 selfloop transitions, 1 changer transitions 73/134 dead transitions. [2023-08-23 23:02:59,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1678 flow [2023-08-23 23:02:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:02:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:02:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-23 23:02:59,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097872340425532 [2023-08-23 23:02:59,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-23 23:02:59,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-23 23:02:59,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:02:59,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-23 23:02:59,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 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:02:59,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:59,444 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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:02:59,444 INFO L175 Difference]: Start difference. First operand has 98 places, 71 transitions, 811 flow. Second operand 5 states and 599 transitions. [2023-08-23 23:02:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1678 flow [2023-08-23 23:02:59,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 134 transitions, 1265 flow, removed 91 selfloop flow, removed 27 redundant places. [2023-08-23 23:02:59,493 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 341 flow [2023-08-23 23:02:59,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2023-08-23 23:02:59,493 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-08-23 23:02:59,494 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 341 flow [2023-08-23 23:02:59,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:02:59,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:02:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:02:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-23 23:02:59,494 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:02:59,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:02:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 851531083, now seen corresponding path program 2 times [2023-08-23 23:02:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:02:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153746517] [2023-08-23 23:02:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:02:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:02:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:00,210 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:03:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153746517] [2023-08-23 23:03:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153746517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:00,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:03:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119642364] [2023-08-23 23:03:00,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:00,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:03:00,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:03:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:03:00,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-08-23 23:03:00,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 341 flow. Second operand has 9 states, 9 states have (on average 106.66666666666667) internal successors, (960), 9 states have internal predecessors, (960), 0 states have call successors, (0), 0 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:03:00,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:00,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-08-23 23:03:00,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:00,553 INFO L124 PetriNetUnfolderBase]: 981/1693 cut-off events. [2023-08-23 23:03:00,553 INFO L125 PetriNetUnfolderBase]: For 5269/5290 co-relation queries the response was YES. [2023-08-23 23:03:00,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 1693 events. 981/1693 cut-off events. For 5269/5290 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8581 event pairs, 136 based on Foata normal form. 1/1666 useless extension candidates. Maximal degree in co-relation 7561. Up to 556 conditions per place. [2023-08-23 23:03:00,559 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 67 selfloop transitions, 7 changer transitions 55/133 dead transitions. [2023-08-23 23:03:00,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 1096 flow [2023-08-23 23:03:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:03:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:03:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 904 transitions. [2023-08-23 23:03:00,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-08-23 23:03:00,561 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 904 transitions. [2023-08-23 23:03:00,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 904 transitions. [2023-08-23 23:03:00,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:00,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 904 transitions. [2023-08-23 23:03:00,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 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:03:00,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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:03:00,565 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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:03:00,565 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 341 flow. Second operand 8 states and 904 transitions. [2023-08-23 23:03:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 1096 flow [2023-08-23 23:03:00,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 987 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-23 23:03:00,588 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 310 flow [2023-08-23 23:03:00,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2023-08-23 23:03:00,589 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-08-23 23:03:00,589 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 310 flow [2023-08-23 23:03:00,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.66666666666667) internal successors, (960), 9 states have internal predecessors, (960), 0 states have call successors, (0), 0 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:03:00,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:00,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:00,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-23 23:03:00,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:03:00,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1123201989, now seen corresponding path program 3 times [2023-08-23 23:03:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729166000] [2023-08-23 23:03:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:00,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:03:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:00,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:03:00,683 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:03:00,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:03:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:03:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:03:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:03:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:03:00,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:03:00,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:03:00,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-23 23:03:00,687 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:00,692 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:03:00,692 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:03:00,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:03:00 BasicIcfg [2023-08-23 23:03:00,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:03:00,753 INFO L158 Benchmark]: Toolchain (without parser) took 42323.78ms. Allocated memory was 367.0MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 341.8MB in the beginning and 2.8GB in the end (delta: -2.4GB). Peak memory consumption was 378.6MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,753 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 367.0MB. Free memory is still 343.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:03:00,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.29ms. Allocated memory is still 367.0MB. Free memory was 341.3MB in the beginning and 317.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.40ms. Allocated memory is still 367.0MB. Free memory was 317.7MB in the beginning and 315.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,754 INFO L158 Benchmark]: Boogie Preprocessor took 38.48ms. Allocated memory is still 367.0MB. Free memory was 315.1MB in the beginning and 312.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,754 INFO L158 Benchmark]: RCFGBuilder took 651.73ms. Allocated memory is still 367.0MB. Free memory was 312.9MB in the beginning and 326.6MB in the end (delta: -13.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,754 INFO L158 Benchmark]: TraceAbstraction took 41046.80ms. Allocated memory was 367.0MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 326.6MB in the beginning and 2.8GB in the end (delta: -2.4GB). Peak memory consumption was 361.8MB. Max. memory is 16.0GB. [2023-08-23 23:03:00,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 367.0MB. Free memory is still 343.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 535.29ms. Allocated memory is still 367.0MB. Free memory was 341.3MB in the beginning and 317.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.40ms. Allocated memory is still 367.0MB. Free memory was 317.7MB in the beginning and 315.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.48ms. Allocated memory is still 367.0MB. Free memory was 315.1MB in the beginning and 312.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 651.73ms. Allocated memory is still 367.0MB. Free memory was 312.9MB in the beginning and 326.6MB in the end (delta: -13.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 41046.80ms. Allocated memory was 367.0MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 326.6MB in the beginning and 2.8GB in the end (delta: -2.4GB). Peak memory consumption was 361.8MB. 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: 3.8s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3282, independent: 3048, independent conditional: 0, independent unconditional: 3048, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1531, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1531, unknown conditional: 0, unknown unconditional: 1531] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-4, t773={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-3, t773={5:0}, t774={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-2, t773={5:0}, t774={6:0}, t775={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, t776={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 939 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 939 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3178 IncrementalHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 84 mSDtfsCounter, 3178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2224occurred in iteration=13, InterpolantAutomatonStates: 126, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 3431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:03:00,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...