/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:47:56,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:47:56,311 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-24 11:47:56,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:47:56,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:47:56,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:47:56,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:47:56,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:47:56,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:47:56,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:47:56,347 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:47:56,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:47:56,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:47:56,348 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:47:56,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:47:56,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:47:56,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:47:56,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:47:56,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:47:56,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:47:56,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:47:56,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:47:56,350 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:47:56,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:47:56,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:47:56,350 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:47:56,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:47:56,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:47:56,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:47:56,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:47:56,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:47:56,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:47:56,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:47:56,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:47:56,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:47:56,352 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:47:56,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:47:56,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:47:56,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:47:56,619 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:47:56,621 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:47:56,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-24 11:47:57,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:47:57,770 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:47:57,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-24 11:47:57,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d9cc340/a3d639d66c3c4f1681660c630f49c339/FLAGa85d01140 [2023-08-24 11:47:57,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d9cc340/a3d639d66c3c4f1681660c630f49c339 [2023-08-24 11:47:57,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:47:57,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:47:57,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:47:57,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:47:57,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:47:57,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:47:57" (1/1) ... [2023-08-24 11:47:57,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b7e5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:57, skipping insertion in model container [2023-08-24 11:47:57,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:47:57" (1/1) ... [2023-08-24 11:47:57,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:47:57,937 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-08-24 11:47:58,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:47:58,112 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:47:58,121 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-08-24 11:47:58,136 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:47:58,137 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:47:58,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:47:58,193 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:47:58,193 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:47:58,198 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:47:58,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58 WrapperNode [2023-08-24 11:47:58,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:47:58,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:47:58,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:47:58,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:47:58,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,246 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-24 11:47:58,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:47:58,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:47:58,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:47:58,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:47:58,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:47:58,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:47:58,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:47:58,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:47:58,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (1/1) ... [2023-08-24 11:47:58,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:47:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:47:58,303 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-24 11:47:58,341 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-24 11:47:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:47:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:47:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:47:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:47:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:47:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:47:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:47:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:47:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:47:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:47:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:47:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:47:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:47:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:47:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:47:58,360 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:47:58,483 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:47:58,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:47:58,693 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:47:58,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:47:58,803 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:47:58,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:47:58 BoogieIcfgContainer [2023-08-24 11:47:58,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:47:58,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:47:58,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:47:58,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:47:58,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:47:57" (1/3) ... [2023-08-24 11:47:58,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5074e8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:47:58, skipping insertion in model container [2023-08-24 11:47:58,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:58" (2/3) ... [2023-08-24 11:47:58,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5074e8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:47:58, skipping insertion in model container [2023-08-24 11:47:58,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:47:58" (3/3) ... [2023-08-24 11:47:58,816 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-24 11:47:58,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:47:58,828 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:47:58,828 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:47:58,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:47:58,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 11:47:58,930 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 11:47:58,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:58,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 11:47:58,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 11:47:58,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-24 11:47:58,938 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:47:58,944 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 11:47:58,946 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 11:47:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-24 11:47:58,963 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 11:47:58,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 11:47:58,964 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-24 11:48:02,154 INFO L134 LiptonReduction]: Checked pairs total: 4735 [2023-08-24 11:48:02,154 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-24 11:48:02,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:48:02,166 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;@4da165a4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:48:02,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 11:48:02,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:48:02,168 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 11:48:02,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:48:02,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:02,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 11:48:02,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:02,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 469687, now seen corresponding path program 1 times [2023-08-24 11:48:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337057612] [2023-08-24 11:48:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:02,413 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-24 11:48:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337057612] [2023-08-24 11:48:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337057612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:48:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463832775] [2023-08-24 11:48:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:48:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:48:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:48:02,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-08-24 11:48:02,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:02,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:02,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-08-24 11:48:02,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:02,587 INFO L124 PetriNetUnfolderBase]: 711/1170 cut-off events. [2023-08-24 11:48:02,587 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-24 11:48:02,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1170 events. 711/1170 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6125 event pairs, 111 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 2278. Up to 871 conditions per place. [2023-08-24 11:48:02,593 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-24 11:48:02,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-08-24 11:48:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:48:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:48:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-08-24 11:48:02,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190713101160862 [2023-08-24 11:48:02,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-08-24 11:48:02,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-08-24 11:48:02,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:02,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-08-24 11:48:02,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:02,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 11:48:02,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 11:48:02,612 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 313 transitions. [2023-08-24 11:48:02,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-08-24 11:48:02,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 11:48:02,615 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-24 11:48:02,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-24 11:48:02,618 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-24 11:48:02,618 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-24 11:48:02,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:02,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:02,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:02,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:48:02,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:02,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash -205373446, now seen corresponding path program 1 times [2023-08-24 11:48:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234165104] [2023-08-24 11:48:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:03,245 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-24 11:48:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234165104] [2023-08-24 11:48:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234165104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:03,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:03,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:48:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150110763] [2023-08-24 11:48:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:03,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:48:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:48:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:48:03,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 11:48:03,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:03,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:03,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 11:48:03,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:03,460 INFO L124 PetriNetUnfolderBase]: 1042/1647 cut-off events. [2023-08-24 11:48:03,460 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-24 11:48:03,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1647 events. 1042/1647 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7978 event pairs, 166 based on Foata normal form. 30/1677 useless extension candidates. Maximal degree in co-relation 3346. Up to 1323 conditions per place. [2023-08-24 11:48:03,467 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-08-24 11:48:03,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 210 flow [2023-08-24 11:48:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:48:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:48:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions. [2023-08-24 11:48:03,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639303482587065 [2023-08-24 11:48:03,469 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions. [2023-08-24 11:48:03,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions. [2023-08-24 11:48:03,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:03,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions. [2023-08-24 11:48:03,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-24 11:48:03,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:03,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:03,472 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 373 transitions. [2023-08-24 11:48:03,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 210 flow [2023-08-24 11:48:03,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:48:03,474 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2023-08-24 11:48:03,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-08-24 11:48:03,475 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-08-24 11:48:03,476 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2023-08-24 11:48:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:03,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:03,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:03,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:48:03,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:03,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2071610583, now seen corresponding path program 1 times [2023-08-24 11:48:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695013482] [2023-08-24 11:48:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:03,942 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-24 11:48:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695013482] [2023-08-24 11:48:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695013482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:03,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:48:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89452223] [2023-08-24 11:48:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:03,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:48:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:48:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:48:03,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 11:48:03,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-24 11:48:03,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:03,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 11:48:03,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:04,103 INFO L124 PetriNetUnfolderBase]: 992/1504 cut-off events. [2023-08-24 11:48:04,103 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2023-08-24 11:48:04,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 1504 events. 992/1504 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6494 event pairs, 181 based on Foata normal form. 18/1520 useless extension candidates. Maximal degree in co-relation 4173. Up to 1076 conditions per place. [2023-08-24 11:48:04,110 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-08-24 11:48:04,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 273 flow [2023-08-24 11:48:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:48:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:48:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2023-08-24 11:48:04,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-08-24 11:48:04,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 363 transitions. [2023-08-24 11:48:04,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 363 transitions. [2023-08-24 11:48:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:04,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 363 transitions. [2023-08-24 11:48:04,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-24 11:48:04,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:04,114 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:04,115 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 4 states and 363 transitions. [2023-08-24 11:48:04,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 273 flow [2023-08-24 11:48:04,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:48:04,117 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 196 flow [2023-08-24 11:48:04,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-08-24 11:48:04,117 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-24 11:48:04,117 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 196 flow [2023-08-24 11:48:04,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-24 11:48:04,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:04,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:04,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:48:04,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:04,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1204847949, now seen corresponding path program 1 times [2023-08-24 11:48:04,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:04,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802766887] [2023-08-24 11:48:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:04,477 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-24 11:48:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802766887] [2023-08-24 11:48:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802766887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:48:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891266797] [2023-08-24 11:48:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:48:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:48:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:48:04,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-24 11:48:04,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-24 11:48:04,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:04,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-24 11:48:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:04,775 INFO L124 PetriNetUnfolderBase]: 1477/2184 cut-off events. [2023-08-24 11:48:04,776 INFO L125 PetriNetUnfolderBase]: For 2229/2229 co-relation queries the response was YES. [2023-08-24 11:48:04,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6759 conditions, 2184 events. 1477/2184 cut-off events. For 2229/2229 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9776 event pairs, 159 based on Foata normal form. 26/2210 useless extension candidates. Maximal degree in co-relation 6742. Up to 1157 conditions per place. [2023-08-24 11:48:04,786 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 50 selfloop transitions, 36 changer transitions 0/86 dead transitions. [2023-08-24 11:48:04,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 86 transitions, 593 flow [2023-08-24 11:48:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:48:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:48:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-08-24 11:48:04,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45870646766169154 [2023-08-24 11:48:04,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-08-24 11:48:04,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-08-24 11:48:04,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:04,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-08-24 11:48:04,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 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-24 11:48:04,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:04,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:04,791 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 196 flow. Second operand 5 states and 461 transitions. [2023-08-24 11:48:04,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 86 transitions, 593 flow [2023-08-24 11:48:04,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 86 transitions, 587 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:48:04,801 INFO L231 Difference]: Finished difference. Result has 46 places, 58 transitions, 507 flow [2023-08-24 11:48:04,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=46, PETRI_TRANSITIONS=58} [2023-08-24 11:48:04,803 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-08-24 11:48:04,803 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 58 transitions, 507 flow [2023-08-24 11:48:04,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-24 11:48:04,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:04,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:04,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:48:04,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:04,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 203032577, now seen corresponding path program 2 times [2023-08-24 11:48:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132040359] [2023-08-24 11:48:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:05,167 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-24 11:48:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132040359] [2023-08-24 11:48:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132040359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:48:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561231432] [2023-08-24 11:48:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:48:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:05,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:48:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:48:05,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-24 11:48:05,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 58 transitions, 507 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-24 11:48:05,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:05,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-24 11:48:05,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:05,472 INFO L124 PetriNetUnfolderBase]: 1804/2691 cut-off events. [2023-08-24 11:48:05,472 INFO L125 PetriNetUnfolderBase]: For 7221/7221 co-relation queries the response was YES. [2023-08-24 11:48:05,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11230 conditions, 2691 events. 1804/2691 cut-off events. For 7221/7221 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12475 event pairs, 275 based on Foata normal form. 92/2783 useless extension candidates. Maximal degree in co-relation 11208. Up to 1122 conditions per place. [2023-08-24 11:48:05,481 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 48 selfloop transitions, 10 changer transitions 31/89 dead transitions. [2023-08-24 11:48:05,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 870 flow [2023-08-24 11:48:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:48:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:48:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-08-24 11:48:05,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44676616915422884 [2023-08-24 11:48:05,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-08-24 11:48:05,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-08-24 11:48:05,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:05,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-08-24 11:48:05,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-24 11:48:05,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:05,485 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:05,485 INFO L175 Difference]: Start difference. First operand has 46 places, 58 transitions, 507 flow. Second operand 5 states and 449 transitions. [2023-08-24 11:48:05,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 870 flow [2023-08-24 11:48:05,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:48:05,496 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 351 flow [2023-08-24 11:48:05,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-24 11:48:05,497 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-08-24 11:48:05,497 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 351 flow [2023-08-24 11:48:05,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-24 11:48:05,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:05,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:05,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:48:05,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:05,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1304463760, now seen corresponding path program 1 times [2023-08-24 11:48:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52870156] [2023-08-24 11:48:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:05,719 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-24 11:48:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:05,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52870156] [2023-08-24 11:48:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52870156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:05,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:05,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:48:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327117254] [2023-08-24 11:48:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:48:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:48:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:48:05,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-08-24 11:48:05,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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-24 11:48:05,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:05,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-08-24 11:48:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:05,845 INFO L124 PetriNetUnfolderBase]: 722/1136 cut-off events. [2023-08-24 11:48:05,845 INFO L125 PetriNetUnfolderBase]: For 4011/4070 co-relation queries the response was YES. [2023-08-24 11:48:05,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 1136 events. 722/1136 cut-off events. For 4011/4070 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4709 event pairs, 324 based on Foata normal form. 56/1191 useless extension candidates. Maximal degree in co-relation 5204. Up to 1007 conditions per place. [2023-08-24 11:48:05,851 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 42 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-24 11:48:05,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 500 flow [2023-08-24 11:48:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:48:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:48:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-24 11:48:05,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49585406301824214 [2023-08-24 11:48:05,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-24 11:48:05,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-24 11:48:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:05,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-24 11:48:05,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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-24 11:48:05,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 11:48:05,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 11:48:05,855 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 351 flow. Second operand 3 states and 299 transitions. [2023-08-24 11:48:05,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 500 flow [2023-08-24 11:48:05,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 429 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-24 11:48:05,861 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 311 flow [2023-08-24 11:48:05,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-08-24 11:48:05,863 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-08-24 11:48:05,863 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 311 flow [2023-08-24 11:48:05,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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-24 11:48:05,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:05,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:05,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:48:05,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:05,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1809220271, now seen corresponding path program 1 times [2023-08-24 11:48:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828846871] [2023-08-24 11:48:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:06,312 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-24 11:48:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828846871] [2023-08-24 11:48:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828846871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:48:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336780658] [2023-08-24 11:48:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:06,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:48:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:48:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:48:06,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2023-08-24 11:48:06,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 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-24 11:48:06,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:06,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2023-08-24 11:48:06,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:06,467 INFO L124 PetriNetUnfolderBase]: 792/1227 cut-off events. [2023-08-24 11:48:06,467 INFO L125 PetriNetUnfolderBase]: For 3186/3186 co-relation queries the response was YES. [2023-08-24 11:48:06,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5196 conditions, 1227 events. 792/1227 cut-off events. For 3186/3186 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4900 event pairs, 277 based on Foata normal form. 5/1231 useless extension candidates. Maximal degree in co-relation 5174. Up to 1074 conditions per place. [2023-08-24 11:48:06,473 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 54 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2023-08-24 11:48:06,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 713 flow [2023-08-24 11:48:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:48:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:48:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2023-08-24 11:48:06,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601990049751244 [2023-08-24 11:48:06,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 370 transitions. [2023-08-24 11:48:06,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 370 transitions. [2023-08-24 11:48:06,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:06,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 370 transitions. [2023-08-24 11:48:06,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-24 11:48:06,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:06,476 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:06,476 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 311 flow. Second operand 4 states and 370 transitions. [2023-08-24 11:48:06,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 713 flow [2023-08-24 11:48:06,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:48:06,482 INFO L231 Difference]: Finished difference. Result has 51 places, 57 transitions, 523 flow [2023-08-24 11:48:06,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=51, PETRI_TRANSITIONS=57} [2023-08-24 11:48:06,483 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-08-24 11:48:06,483 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 57 transitions, 523 flow [2023-08-24 11:48:06,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 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-24 11:48:06,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:06,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:06,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:48:06,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:06,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1871948014, now seen corresponding path program 1 times [2023-08-24 11:48:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514905793] [2023-08-24 11:48:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:06,738 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-24 11:48:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514905793] [2023-08-24 11:48:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514905793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:06,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:48:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957414982] [2023-08-24 11:48:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:48:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:48:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:48:06,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-08-24 11:48:06,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:06,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:06,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-08-24 11:48:06,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:06,922 INFO L124 PetriNetUnfolderBase]: 715/1127 cut-off events. [2023-08-24 11:48:06,922 INFO L125 PetriNetUnfolderBase]: For 4130/4183 co-relation queries the response was YES. [2023-08-24 11:48:06,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 1127 events. 715/1127 cut-off events. For 4130/4183 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4666 event pairs, 301 based on Foata normal form. 58/1184 useless extension candidates. Maximal degree in co-relation 5430. Up to 920 conditions per place. [2023-08-24 11:48:06,928 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 60 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2023-08-24 11:48:06,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 799 flow [2023-08-24 11:48:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:48:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:48:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-24 11:48:06,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925373134328358 [2023-08-24 11:48:06,930 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-24 11:48:06,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-24 11:48:06,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:06,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-24 11:48:06,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-24 11:48:06,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:06,932 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:06,932 INFO L175 Difference]: Start difference. First operand has 51 places, 57 transitions, 523 flow. Second operand 4 states and 396 transitions. [2023-08-24 11:48:06,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 799 flow [2023-08-24 11:48:06,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:48:06,938 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 639 flow [2023-08-24 11:48:06,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=639, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2023-08-24 11:48:06,938 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-08-24 11:48:06,938 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 639 flow [2023-08-24 11:48:06,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:06,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:06,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:06,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:48:06,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:06,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 249941479, now seen corresponding path program 1 times [2023-08-24 11:48:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277818905] [2023-08-24 11:48:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:07,241 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-24 11:48:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277818905] [2023-08-24 11:48:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277818905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:48:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519092747] [2023-08-24 11:48:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:07,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:48:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:48:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:48:07,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 11:48:07,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-24 11:48:07,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:07,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 11:48:07,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:07,411 INFO L124 PetriNetUnfolderBase]: 702/1108 cut-off events. [2023-08-24 11:48:07,411 INFO L125 PetriNetUnfolderBase]: For 5139/5192 co-relation queries the response was YES. [2023-08-24 11:48:07,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 1108 events. 702/1108 cut-off events. For 5139/5192 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4572 event pairs, 202 based on Foata normal form. 51/1158 useless extension candidates. Maximal degree in co-relation 5720. Up to 818 conditions per place. [2023-08-24 11:48:07,437 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 66 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2023-08-24 11:48:07,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 936 flow [2023-08-24 11:48:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:48:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:48:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2023-08-24 11:48:07,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2023-08-24 11:48:07,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2023-08-24 11:48:07,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2023-08-24 11:48:07,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:07,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2023-08-24 11:48:07,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-24 11:48:07,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:07,440 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-24 11:48:07,441 INFO L175 Difference]: Start difference. First operand has 56 places, 63 transitions, 639 flow. Second operand 4 states and 392 transitions. [2023-08-24 11:48:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 936 flow [2023-08-24 11:48:07,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 897 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 11:48:07,448 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 677 flow [2023-08-24 11:48:07,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=677, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2023-08-24 11:48:07,449 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-08-24 11:48:07,449 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 677 flow [2023-08-24 11:48:07,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-24 11:48:07,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:07,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:07,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:48:07,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:07,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash 251167405, now seen corresponding path program 1 times [2023-08-24 11:48:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795089714] [2023-08-24 11:48:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:07,792 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-24 11:48:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795089714] [2023-08-24 11:48:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795089714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:48:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20946531] [2023-08-24 11:48:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:48:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:48:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:48:07,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-24 11:48:07,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 677 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-24 11:48:07,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:07,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-24 11:48:07,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:08,068 INFO L124 PetriNetUnfolderBase]: 888/1386 cut-off events. [2023-08-24 11:48:08,068 INFO L125 PetriNetUnfolderBase]: For 7347/7347 co-relation queries the response was YES. [2023-08-24 11:48:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7378 conditions, 1386 events. 888/1386 cut-off events. For 7347/7347 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5787 event pairs, 187 based on Foata normal form. 21/1407 useless extension candidates. Maximal degree in co-relation 7347. Up to 927 conditions per place. [2023-08-24 11:48:08,075 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 66 selfloop transitions, 52 changer transitions 0/120 dead transitions. [2023-08-24 11:48:08,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 1356 flow [2023-08-24 11:48:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:48:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:48:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2023-08-24 11:48:08,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577114427860697 [2023-08-24 11:48:08,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2023-08-24 11:48:08,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2023-08-24 11:48:08,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:08,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2023-08-24 11:48:08,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:08,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:08,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:08,080 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 677 flow. Second operand 7 states and 644 transitions. [2023-08-24 11:48:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 1356 flow [2023-08-24 11:48:08,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 1316 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-24 11:48:08,090 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 1144 flow [2023-08-24 11:48:08,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-08-24 11:48:08,090 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2023-08-24 11:48:08,091 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 1144 flow [2023-08-24 11:48:08,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-24 11:48:08,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:08,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:08,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:48:08,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:08,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1607975649, now seen corresponding path program 2 times [2023-08-24 11:48:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471356948] [2023-08-24 11:48:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:08,410 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-24 11:48:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471356948] [2023-08-24 11:48:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471356948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:48:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374756666] [2023-08-24 11:48:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:48:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:48:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:48:08,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-24 11:48:08,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 1144 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-24 11:48:08,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:08,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-24 11:48:08,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:08,655 INFO L124 PetriNetUnfolderBase]: 921/1435 cut-off events. [2023-08-24 11:48:08,656 INFO L125 PetriNetUnfolderBase]: For 11063/11063 co-relation queries the response was YES. [2023-08-24 11:48:08,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8889 conditions, 1435 events. 921/1435 cut-off events. For 11063/11063 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5989 event pairs, 253 based on Foata normal form. 3/1438 useless extension candidates. Maximal degree in co-relation 8855. Up to 1208 conditions per place. [2023-08-24 11:48:08,664 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 96 selfloop transitions, 33 changer transitions 0/131 dead transitions. [2023-08-24 11:48:08,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1761 flow [2023-08-24 11:48:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:48:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:48:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-08-24 11:48:08,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562899786780384 [2023-08-24 11:48:08,666 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-08-24 11:48:08,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-08-24 11:48:08,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:08,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-08-24 11:48:08,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-24 11:48:08,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:08,669 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:08,669 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 1144 flow. Second operand 7 states and 642 transitions. [2023-08-24 11:48:08,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1761 flow [2023-08-24 11:48:08,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 1754 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 11:48:08,683 INFO L231 Difference]: Finished difference. Result has 73 places, 100 transitions, 1408 flow [2023-08-24 11:48:08,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1408, PETRI_PLACES=73, PETRI_TRANSITIONS=100} [2023-08-24 11:48:08,683 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-08-24 11:48:08,683 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 100 transitions, 1408 flow [2023-08-24 11:48:08,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-24 11:48:08,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:08,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:08,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:48:08,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:08,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1608024939, now seen corresponding path program 3 times [2023-08-24 11:48:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513018448] [2023-08-24 11:48:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:08,960 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-24 11:48:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513018448] [2023-08-24 11:48:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513018448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:48:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513595857] [2023-08-24 11:48:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:48:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:48:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:48:08,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 11:48:08,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 100 transitions, 1408 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 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-24 11:48:08,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:08,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 11:48:08,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:09,214 INFO L124 PetriNetUnfolderBase]: 928/1474 cut-off events. [2023-08-24 11:48:09,214 INFO L125 PetriNetUnfolderBase]: For 14349/14395 co-relation queries the response was YES. [2023-08-24 11:48:09,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9951 conditions, 1474 events. 928/1474 cut-off events. For 14349/14395 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6618 event pairs, 290 based on Foata normal form. 46/1512 useless extension candidates. Maximal degree in co-relation 9914. Up to 1127 conditions per place. [2023-08-24 11:48:09,222 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 94 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2023-08-24 11:48:09,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 130 transitions, 1955 flow [2023-08-24 11:48:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:48:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:48:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2023-08-24 11:48:09,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48258706467661694 [2023-08-24 11:48:09,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions. [2023-08-24 11:48:09,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions. [2023-08-24 11:48:09,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:09,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions. [2023-08-24 11:48:09,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-24 11:48:09,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:09,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:09,226 INFO L175 Difference]: Start difference. First operand has 73 places, 100 transitions, 1408 flow. Second operand 5 states and 485 transitions. [2023-08-24 11:48:09,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 130 transitions, 1955 flow [2023-08-24 11:48:09,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 130 transitions, 1892 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-24 11:48:09,245 INFO L231 Difference]: Finished difference. Result has 73 places, 108 transitions, 1588 flow [2023-08-24 11:48:09,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1588, PETRI_PLACES=73, PETRI_TRANSITIONS=108} [2023-08-24 11:48:09,246 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-08-24 11:48:09,246 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 1588 flow [2023-08-24 11:48:09,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 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-24 11:48:09,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:09,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:09,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:48:09,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:09,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1792423090, now seen corresponding path program 1 times [2023-08-24 11:48:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:09,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571727432] [2023-08-24 11:48:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:09,329 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-24 11:48:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571727432] [2023-08-24 11:48:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571727432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:48:09,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965353436] [2023-08-24 11:48:09,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:09,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:48:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:48:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:48:09,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 11:48:09,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 1588 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-24 11:48:09,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:09,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 11:48:09,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:09,496 INFO L124 PetriNetUnfolderBase]: 673/1100 cut-off events. [2023-08-24 11:48:09,496 INFO L125 PetriNetUnfolderBase]: For 16982/17220 co-relation queries the response was YES. [2023-08-24 11:48:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 1100 events. 673/1100 cut-off events. For 16982/17220 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5134 event pairs, 96 based on Foata normal form. 313/1402 useless extension candidates. Maximal degree in co-relation 7783. Up to 594 conditions per place. [2023-08-24 11:48:09,502 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 119 selfloop transitions, 6 changer transitions 80/219 dead transitions. [2023-08-24 11:48:09,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 219 transitions, 3752 flow [2023-08-24 11:48:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:48:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:48:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-24 11:48:09,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-08-24 11:48:09,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-24 11:48:09,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-24 11:48:09,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:09,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-24 11:48:09,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:48:09,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:09,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:09,506 INFO L175 Difference]: Start difference. First operand has 73 places, 108 transitions, 1588 flow. Second operand 5 states and 487 transitions. [2023-08-24 11:48:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 219 transitions, 3752 flow [2023-08-24 11:48:09,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 219 transitions, 3601 flow, removed 44 selfloop flow, removed 2 redundant places. [2023-08-24 11:48:09,521 INFO L231 Difference]: Finished difference. Result has 78 places, 98 transitions, 1376 flow [2023-08-24 11:48:09,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1376, PETRI_PLACES=78, PETRI_TRANSITIONS=98} [2023-08-24 11:48:09,522 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-08-24 11:48:09,522 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 98 transitions, 1376 flow [2023-08-24 11:48:09,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-24 11:48:09,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:09,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:09,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:48:09,523 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:09,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1767515392, now seen corresponding path program 1 times [2023-08-24 11:48:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951657191] [2023-08-24 11:48:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:09,607 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-24 11:48:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:09,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951657191] [2023-08-24 11:48:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951657191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:09,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:09,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:48:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473530745] [2023-08-24 11:48:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:09,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:48:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:48:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:48:09,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 11:48:09,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 98 transitions, 1376 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-24 11:48:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 11:48:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:09,784 INFO L124 PetriNetUnfolderBase]: 478/815 cut-off events. [2023-08-24 11:48:09,785 INFO L125 PetriNetUnfolderBase]: For 11282/11458 co-relation queries the response was YES. [2023-08-24 11:48:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 815 events. 478/815 cut-off events. For 11282/11458 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3701 event pairs, 33 based on Foata normal form. 203/1008 useless extension candidates. Maximal degree in co-relation 5753. Up to 400 conditions per place. [2023-08-24 11:48:09,789 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 119 selfloop transitions, 10 changer transitions 89/232 dead transitions. [2023-08-24 11:48:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 232 transitions, 3827 flow [2023-08-24 11:48:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:48:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:48:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-08-24 11:48:09,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48187633262260127 [2023-08-24 11:48:09,791 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-08-24 11:48:09,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-08-24 11:48:09,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:09,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-08-24 11:48:09,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-24 11:48:09,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:09,794 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:09,794 INFO L175 Difference]: Start difference. First operand has 78 places, 98 transitions, 1376 flow. Second operand 7 states and 678 transitions. [2023-08-24 11:48:09,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 232 transitions, 3827 flow [2023-08-24 11:48:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 232 transitions, 3803 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-24 11:48:09,806 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 1285 flow [2023-08-24 11:48:09,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1285, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2023-08-24 11:48:09,807 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2023-08-24 11:48:09,807 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 1285 flow [2023-08-24 11:48:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-24 11:48:09,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:09,807 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-24 11:48:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:48:09,807 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:09,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1963671497, now seen corresponding path program 1 times [2023-08-24 11:48:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890367350] [2023-08-24 11:48:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:09,910 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-24 11:48:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890367350] [2023-08-24 11:48:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890367350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:48:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40845460] [2023-08-24 11:48:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:48:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:48:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:48:09,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 11:48:09,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 1285 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-24 11:48:09,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:09,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 11:48:09,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:10,070 INFO L124 PetriNetUnfolderBase]: 427/718 cut-off events. [2023-08-24 11:48:10,071 INFO L125 PetriNetUnfolderBase]: For 9350/9461 co-relation queries the response was YES. [2023-08-24 11:48:10,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 718 events. 427/718 cut-off events. For 9350/9461 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3210 event pairs, 30 based on Foata normal form. 100/808 useless extension candidates. Maximal degree in co-relation 5297. Up to 352 conditions per place. [2023-08-24 11:48:10,074 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 113 selfloop transitions, 13 changer transitions 87/227 dead transitions. [2023-08-24 11:48:10,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 227 transitions, 3788 flow [2023-08-24 11:48:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:48:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:48:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 850 transitions. [2023-08-24 11:48:10,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987285793255945 [2023-08-24 11:48:10,077 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 850 transitions. [2023-08-24 11:48:10,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 850 transitions. [2023-08-24 11:48:10,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:10,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 850 transitions. [2023-08-24 11:48:10,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.44444444444444) internal successors, (850), 9 states have internal predecessors, (850), 0 states have call successors, (0), 0 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-24 11:48:10,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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-24 11:48:10,080 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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-24 11:48:10,081 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 1285 flow. Second operand 9 states and 850 transitions. [2023-08-24 11:48:10,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 227 transitions, 3788 flow [2023-08-24 11:48:10,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 227 transitions, 3644 flow, removed 49 selfloop flow, removed 7 redundant places. [2023-08-24 11:48:10,095 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 1185 flow [2023-08-24 11:48:10,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1185, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2023-08-24 11:48:10,095 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 57 predicate places. [2023-08-24 11:48:10,095 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 1185 flow [2023-08-24 11:48:10,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-24 11:48:10,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:10,096 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-24 11:48:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:48:10,096 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:10,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash 509861693, now seen corresponding path program 1 times [2023-08-24 11:48:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782525776] [2023-08-24 11:48:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:10,462 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-24 11:48:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782525776] [2023-08-24 11:48:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782525776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:10,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:10,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:48:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796773756] [2023-08-24 11:48:10,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:10,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:48:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:10,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:48:10,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:48:10,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 11:48:10,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 1185 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 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-24 11:48:10,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:10,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 11:48:10,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:10,680 INFO L124 PetriNetUnfolderBase]: 523/940 cut-off events. [2023-08-24 11:48:10,680 INFO L125 PetriNetUnfolderBase]: For 8419/8445 co-relation queries the response was YES. [2023-08-24 11:48:10,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 940 events. 523/940 cut-off events. For 8419/8445 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4669 event pairs, 45 based on Foata normal form. 20/953 useless extension candidates. Maximal degree in co-relation 6617. Up to 450 conditions per place. [2023-08-24 11:48:10,685 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 60 selfloop transitions, 51 changer transitions 25/143 dead transitions. [2023-08-24 11:48:10,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 143 transitions, 1965 flow [2023-08-24 11:48:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:48:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:48:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-08-24 11:48:10,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47405828002842926 [2023-08-24 11:48:10,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-08-24 11:48:10,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-08-24 11:48:10,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:10,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-08-24 11:48:10,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-24 11:48:10,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:10,691 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 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-24 11:48:10,691 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 1185 flow. Second operand 7 states and 667 transitions. [2023-08-24 11:48:10,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 143 transitions, 1965 flow [2023-08-24 11:48:10,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 143 transitions, 1834 flow, removed 27 selfloop flow, removed 8 redundant places. [2023-08-24 11:48:10,707 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 1293 flow [2023-08-24 11:48:10,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1293, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2023-08-24 11:48:10,708 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2023-08-24 11:48:10,708 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 1293 flow [2023-08-24 11:48:10,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 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-24 11:48:10,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:10,710 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-24 11:48:10,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:48:10,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:10,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1312093447, now seen corresponding path program 2 times [2023-08-24 11:48:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650043022] [2023-08-24 11:48:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:48:11,200 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-24 11:48:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:48:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650043022] [2023-08-24 11:48:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650043022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:48:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:48:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:48:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661057563] [2023-08-24 11:48:11,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:48:11,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:48:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:48:11,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:48:11,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:48:11,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-08-24 11:48:11,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 1293 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-24 11:48:11,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:48:11,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-08-24 11:48:11,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:48:11,405 INFO L124 PetriNetUnfolderBase]: 441/845 cut-off events. [2023-08-24 11:48:11,405 INFO L125 PetriNetUnfolderBase]: For 8412/8426 co-relation queries the response was YES. [2023-08-24 11:48:11,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5957 conditions, 845 events. 441/845 cut-off events. For 8412/8426 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4274 event pairs, 69 based on Foata normal form. 10/852 useless extension candidates. Maximal degree in co-relation 5916. Up to 427 conditions per place. [2023-08-24 11:48:11,408 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 76 selfloop transitions, 16 changer transitions 24/123 dead transitions. [2023-08-24 11:48:11,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 1741 flow [2023-08-24 11:48:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:48:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:48:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2023-08-24 11:48:11,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46368159203980097 [2023-08-24 11:48:11,410 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 466 transitions. [2023-08-24 11:48:11,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 466 transitions. [2023-08-24 11:48:11,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:48:11,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 466 transitions. [2023-08-24 11:48:11,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 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-24 11:48:11,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:11,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-24 11:48:11,412 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 1293 flow. Second operand 5 states and 466 transitions. [2023-08-24 11:48:11,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 1741 flow [2023-08-24 11:48:11,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 1690 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 11:48:11,425 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 1153 flow [2023-08-24 11:48:11,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1153, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2023-08-24 11:48:11,425 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2023-08-24 11:48:11,425 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 1153 flow [2023-08-24 11:48:11,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-24 11:48:11,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:48:11,426 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-24 11:48:11,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:48:11,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 11:48:11,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:48:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2121850611, now seen corresponding path program 3 times [2023-08-24 11:48:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:48:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918001027] [2023-08-24 11:48:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:48:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:48:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:48:11,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:48:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:48:11,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:48:11,488 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 11:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 11:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 11:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 11:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 11:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 11:48:11,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 11:48:11,491 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:48:11,494 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:48:11,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:48:11,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:48:11 BasicIcfg [2023-08-24 11:48:11,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:48:11,547 INFO L158 Benchmark]: Toolchain (without parser) took 13752.21ms. Allocated memory was 358.6MB in the beginning and 771.8MB in the end (delta: 413.1MB). Free memory was 332.8MB in the beginning and 667.7MB in the end (delta: -335.0MB). Peak memory consumption was 79.2MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,547 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 358.6MB. Free memory was 336.3MB in the beginning and 336.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:48:11,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.97ms. Allocated memory is still 358.6MB. Free memory was 332.2MB in the beginning and 308.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.15ms. Allocated memory is still 358.6MB. Free memory was 308.9MB in the beginning and 306.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,548 INFO L158 Benchmark]: Boogie Preprocessor took 29.94ms. Allocated memory is still 358.6MB. Free memory was 306.5MB in the beginning and 304.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,548 INFO L158 Benchmark]: RCFGBuilder took 527.48ms. Allocated memory is still 358.6MB. Free memory was 304.7MB in the beginning and 266.7MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,548 INFO L158 Benchmark]: TraceAbstraction took 12739.99ms. Allocated memory was 358.6MB in the beginning and 771.8MB in the end (delta: 413.1MB). Free memory was 265.4MB in the beginning and 667.7MB in the end (delta: -402.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.0GB. [2023-08-24 11:48:11,549 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.11ms. Allocated memory is still 358.6MB. Free memory was 336.3MB in the beginning and 336.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 402.97ms. Allocated memory is still 358.6MB. Free memory was 332.2MB in the beginning and 308.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.15ms. Allocated memory is still 358.6MB. Free memory was 308.9MB in the beginning and 306.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.94ms. Allocated memory is still 358.6MB. Free memory was 306.5MB in the beginning and 304.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 527.48ms. Allocated memory is still 358.6MB. Free memory was 304.7MB in the beginning and 266.7MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 12739.99ms. Allocated memory was 358.6MB in the beginning and 771.8MB in the end (delta: 413.1MB). Free memory was 265.4MB in the beginning and 667.7MB in the end (delta: -402.3MB). Peak memory consumption was 12.0MB. 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.2s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2327, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1065, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2327, independent: 1147, independent conditional: 0, independent unconditional: 1147, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1065, unknown conditional: 0, unknown unconditional: 1065] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 823]: 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: 821]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 30 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1588occurred in iteration=12, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 2865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-24 11:48:11,574 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...