/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/mix004.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:33:07,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:33:07,393 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:33:07,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:33:07,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:33:07,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:33:07,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:33:07,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:33:07,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:33:07,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:33:07,429 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:33:07,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:33:07,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:33:07,430 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:33:07,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:33:07,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:33:07,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:33:07,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:33:07,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:33:07,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:33:07,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:33:07,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:33:07,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:33:07,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:33:07,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:33:07,434 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:33:07,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:33:07,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:33:07,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:33:07,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:33:07,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:33:07,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:33:07,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:33:07,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:33:07,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:33:07,437 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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:33:07,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:33:07,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:33:07,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:33:07,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:33:07,764 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:33:07,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2023-08-24 11:33:09,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:33:09,238 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:33:09,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2023-08-24 11:33:09,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2384acc/2b8eccdc6aa143da9a9e8f35112fe538/FLAG732d216ea [2023-08-24 11:33:09,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2384acc/2b8eccdc6aa143da9a9e8f35112fe538 [2023-08-24 11:33:09,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:33:09,264 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:33:09,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:33:09,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:33:09,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:33:09,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68887b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09, skipping insertion in model container [2023-08-24 11:33:09,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,304 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:33:09,445 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/mix004.opt.i[944,957] [2023-08-24 11:33:09,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:33:09,670 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:33:09,679 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/mix004.opt.i[944,957] [2023-08-24 11:33:09,698 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:33:09,699 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:33:09,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:33:09,793 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:33:09,793 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:33:09,799 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:33:09,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09 WrapperNode [2023-08-24 11:33:09,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:33:09,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:33:09,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:33:09,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:33:09,808 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:33:09" (1/1) ... [2023-08-24 11:33:09,836 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:33:09" (1/1) ... [2023-08-24 11:33:09,875 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-24 11:33:09,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:33:09,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:33:09,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:33:09,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:33:09,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:33:09,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:33:09,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:33:09,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:33:09,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (1/1) ... [2023-08-24 11:33:09,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:33:09,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:33:09,966 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:33:09,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 11:33:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:33:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:33:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:33:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:33:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:33:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:33:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:33:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:33:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:33:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:33:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:33:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:33:10,001 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:33:10,132 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:33:10,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:33:10,417 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:33:10,520 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:33:10,521 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:33:10,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:33:10 BoogieIcfgContainer [2023-08-24 11:33:10,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:33:10,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:33:10,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:33:10,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:33:10,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:33:09" (1/3) ... [2023-08-24 11:33:10,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d679822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:33:10, skipping insertion in model container [2023-08-24 11:33:10,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:33:09" (2/3) ... [2023-08-24 11:33:10,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d679822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:33:10, skipping insertion in model container [2023-08-24 11:33:10,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:33:10" (3/3) ... [2023-08-24 11:33:10,529 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2023-08-24 11:33:10,543 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:33:10,543 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:33:10,543 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:33:10,588 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:33:10,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-24 11:33:10,664 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-08-24 11:33:10,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:33:10,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-24 11:33:10,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-24 11:33:10,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-24 11:33:10,676 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:33:10,683 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-24 11:33:10,686 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-24 11:33:10,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-24 11:33:10,713 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-08-24 11:33:10,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:33:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-24 11:33:10,716 INFO L119 LiptonReduction]: Number of co-enabled transitions 2836 [2023-08-24 11:33:14,629 INFO L134 LiptonReduction]: Checked pairs total: 6966 [2023-08-24 11:33:14,629 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-24 11:33:14,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:33:14,646 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;@4c5636d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:33:14,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:33:14,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:33:14,654 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-24 11:33:14,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:33:14,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:14,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:14,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:14,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 956559065, now seen corresponding path program 1 times [2023-08-24 11:33:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:14,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110258981] [2023-08-24 11:33:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:15,087 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:33:15,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:15,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110258981] [2023-08-24 11:33:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110258981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:33:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150819263] [2023-08-24 11:33:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:15,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:33:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:33:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:33:15,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 241 [2023-08-24 11:33:15,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:33:15,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:15,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 241 [2023-08-24 11:33:15,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:15,692 INFO L124 PetriNetUnfolderBase]: 2594/3797 cut-off events. [2023-08-24 11:33:15,693 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-24 11:33:15,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7492 conditions, 3797 events. 2594/3797 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20226 event pairs, 518 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7480. Up to 2797 conditions per place. [2023-08-24 11:33:15,717 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-24 11:33:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-08-24 11:33:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:33:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:33:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-24 11:33:15,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366528354080221 [2023-08-24 11:33:15,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-24 11:33:15,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-24 11:33:15,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:15,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-24 11:33:15,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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:33:15,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:15,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:15,751 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 388 transitions. [2023-08-24 11:33:15,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-08-24 11:33:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:33:15,757 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-24 11:33:15,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-24 11:33:15,761 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 11:33:15,762 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-24 11:33:15,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:33:15,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:15,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:15,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:33:15,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:15,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 130318247, now seen corresponding path program 1 times [2023-08-24 11:33:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346150090] [2023-08-24 11:33:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:16,044 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:33:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:16,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346150090] [2023-08-24 11:33:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346150090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:33:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950192740] [2023-08-24 11:33:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:16,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:33:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:33:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:33:16,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:33:16,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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:33:16,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:16,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:33:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:16,816 INFO L124 PetriNetUnfolderBase]: 5895/8000 cut-off events. [2023-08-24 11:33:16,817 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2023-08-24 11:33:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16518 conditions, 8000 events. 5895/8000 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 34925 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16508. Up to 7809 conditions per place. [2023-08-24 11:33:16,855 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-08-24 11:33:16,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2023-08-24 11:33:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:33:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:33:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-24 11:33:16,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034578146611342 [2023-08-24 11:33:16,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-24 11:33:16,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-24 11:33:16,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:16,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-24 11:33:16,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:33:16,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:16,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:16,861 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 364 transitions. [2023-08-24 11:33:16,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2023-08-24 11:33:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:33:16,864 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2023-08-24 11:33:16,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-24 11:33:16,867 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 11:33:16,868 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2023-08-24 11:33:16,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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:33:16,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:16,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:16,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:33:16,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:16,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2083893735, now seen corresponding path program 1 times [2023-08-24 11:33:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517947921] [2023-08-24 11:33:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:17,015 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:33:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517947921] [2023-08-24 11:33:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517947921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:17,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:33:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64008404] [2023-08-24 11:33:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:17,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:33:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:33:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:33:17,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-08-24 11:33:17,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:33:17,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:17,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-08-24 11:33:17,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:17,590 INFO L124 PetriNetUnfolderBase]: 3671/5256 cut-off events. [2023-08-24 11:33:17,591 INFO L125 PetriNetUnfolderBase]: For 618/618 co-relation queries the response was YES. [2023-08-24 11:33:17,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11439 conditions, 5256 events. 3671/5256 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26409 event pairs, 1259 based on Foata normal form. 124/5270 useless extension candidates. Maximal degree in co-relation 11428. Up to 3507 conditions per place. [2023-08-24 11:33:17,624 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 34 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-24 11:33:17,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 195 flow [2023-08-24 11:33:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:33:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:33:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-24 11:33:17,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269709543568465 [2023-08-24 11:33:17,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-24 11:33:17,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-24 11:33:17,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:17,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-24 11:33:17,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:33:17,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:17,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:17,630 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 381 transitions. [2023-08-24 11:33:17,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 195 flow [2023-08-24 11:33:17,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:33:17,632 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2023-08-24 11:33:17,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-24 11:33:17,633 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-24 11:33:17,636 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2023-08-24 11:33:17,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:33:17,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:17,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:17,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:33:17,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:17,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1772084970, now seen corresponding path program 1 times [2023-08-24 11:33:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677955405] [2023-08-24 11:33:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:17,800 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:33:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:17,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677955405] [2023-08-24 11:33:17,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677955405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:17,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:17,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:33:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314159021] [2023-08-24 11:33:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:17,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:33:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:33:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:33:17,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:33:17,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:33:17,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:17,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:33:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:18,358 INFO L124 PetriNetUnfolderBase]: 5015/6848 cut-off events. [2023-08-24 11:33:18,359 INFO L125 PetriNetUnfolderBase]: For 2287/2287 co-relation queries the response was YES. [2023-08-24 11:33:18,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16403 conditions, 6848 events. 5015/6848 cut-off events. For 2287/2287 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28959 event pairs, 1571 based on Foata normal form. 96/6944 useless extension candidates. Maximal degree in co-relation 16390. Up to 4561 conditions per place. [2023-08-24 11:33:18,392 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-24 11:33:18,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 216 flow [2023-08-24 11:33:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:33:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:33:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-24 11:33:18,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979253112033195 [2023-08-24 11:33:18,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-24 11:33:18,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-24 11:33:18,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:18,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-24 11:33:18,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:33:18,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:18,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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:33:18,397 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 3 states and 360 transitions. [2023-08-24 11:33:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 216 flow [2023-08-24 11:33:18,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:33:18,401 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 104 flow [2023-08-24 11:33:18,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-24 11:33:18,402 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-24 11:33:18,402 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 104 flow [2023-08-24 11:33:18,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:33:18,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:18,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:33:18,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:18,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash -114956155, now seen corresponding path program 1 times [2023-08-24 11:33:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388764746] [2023-08-24 11:33:18,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:18,567 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:33:18,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:18,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388764746] [2023-08-24 11:33:18,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388764746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:18,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:18,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:33:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31476398] [2023-08-24 11:33:18,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:18,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:33:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:33:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:33:18,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-24 11:33:18,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:33:18,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:18,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-24 11:33:18,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:18,984 INFO L124 PetriNetUnfolderBase]: 2746/4177 cut-off events. [2023-08-24 11:33:18,984 INFO L125 PetriNetUnfolderBase]: For 1074/1121 co-relation queries the response was YES. [2023-08-24 11:33:18,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 4177 events. 2746/4177 cut-off events. For 1074/1121 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23396 event pairs, 458 based on Foata normal form. 317/4354 useless extension candidates. Maximal degree in co-relation 9590. Up to 1830 conditions per place. [2023-08-24 11:33:19,004 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-08-24 11:33:19,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 282 flow [2023-08-24 11:33:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:33:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:33:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-24 11:33:19,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114107883817427 [2023-08-24 11:33:19,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-24 11:33:19,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-24 11:33:19,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:19,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-24 11:33:19,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:33:19,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:19,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:19,011 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 104 flow. Second operand 4 states and 493 transitions. [2023-08-24 11:33:19,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 282 flow [2023-08-24 11:33:19,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:33:19,016 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 144 flow [2023-08-24 11:33:19,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-08-24 11:33:19,018 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-24 11:33:19,019 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 144 flow [2023-08-24 11:33:19,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:33:19,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:19,019 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:33:19,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:33:19,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:19,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -488720069, now seen corresponding path program 1 times [2023-08-24 11:33:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159140674] [2023-08-24 11:33:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:19,244 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:33:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159140674] [2023-08-24 11:33:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159140674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:33:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171433297] [2023-08-24 11:33:19,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:33:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:33:19,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:33:19,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-24 11:33:19,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:33:19,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:19,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-24 11:33:19,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:19,654 INFO L124 PetriNetUnfolderBase]: 2218/3533 cut-off events. [2023-08-24 11:33:19,654 INFO L125 PetriNetUnfolderBase]: For 1581/1632 co-relation queries the response was YES. [2023-08-24 11:33:19,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9868 conditions, 3533 events. 2218/3533 cut-off events. For 1581/1632 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20355 event pairs, 428 based on Foata normal form. 243/3652 useless extension candidates. Maximal degree in co-relation 9852. Up to 1265 conditions per place. [2023-08-24 11:33:19,673 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 58 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-08-24 11:33:19,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 398 flow [2023-08-24 11:33:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:33:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:33:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-24 11:33:19,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136929460580912 [2023-08-24 11:33:19,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-24 11:33:19,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-24 11:33:19,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:19,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-24 11:33:19,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:33:19,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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:33:19,680 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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:33:19,680 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 144 flow. Second operand 5 states and 619 transitions. [2023-08-24 11:33:19,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 398 flow [2023-08-24 11:33:19,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:33:19,683 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 209 flow [2023-08-24 11:33:19,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-24 11:33:19,683 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-24 11:33:19,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 209 flow [2023-08-24 11:33:19,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:33:19,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:19,684 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:33:19,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:33:19,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:19,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1532109445, now seen corresponding path program 1 times [2023-08-24 11:33:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134855849] [2023-08-24 11:33:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:19,822 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:33:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134855849] [2023-08-24 11:33:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134855849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:33:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587187292] [2023-08-24 11:33:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:33:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:33:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:33:19,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-24 11:33:19,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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:33:19,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:19,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-24 11:33:19,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:20,380 INFO L124 PetriNetUnfolderBase]: 4043/6194 cut-off events. [2023-08-24 11:33:20,381 INFO L125 PetriNetUnfolderBase]: For 10742/10742 co-relation queries the response was YES. [2023-08-24 11:33:20,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21176 conditions, 6194 events. 4043/6194 cut-off events. For 10742/10742 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 35793 event pairs, 419 based on Foata normal form. 32/6225 useless extension candidates. Maximal degree in co-relation 21157. Up to 3415 conditions per place. [2023-08-24 11:33:20,412 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 64 selfloop transitions, 2 changer transitions 18/87 dead transitions. [2023-08-24 11:33:20,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 648 flow [2023-08-24 11:33:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:33:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:33:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-24 11:33:20,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186721991701245 [2023-08-24 11:33:20,414 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-24 11:33:20,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-24 11:33:20,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:20,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-24 11:33:20,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:33:20,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:20,417 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:20,417 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 209 flow. Second operand 4 states and 500 transitions. [2023-08-24 11:33:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 648 flow [2023-08-24 11:33:20,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 610 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-24 11:33:20,424 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 211 flow [2023-08-24 11:33:20,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-24 11:33:20,425 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-24 11:33:20,425 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 211 flow [2023-08-24 11:33:20,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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:33:20,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:20,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] [2023-08-24 11:33:20,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:33:20,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:20,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1162129465, now seen corresponding path program 1 times [2023-08-24 11:33:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347100656] [2023-08-24 11:33:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:20,624 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:33:20,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347100656] [2023-08-24 11:33:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347100656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:20,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:20,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:33:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684079410] [2023-08-24 11:33:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:20,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:33:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:33:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:33:20,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-24 11:33:20,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 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:33:20,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:20,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-24 11:33:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:21,058 INFO L124 PetriNetUnfolderBase]: 2792/4500 cut-off events. [2023-08-24 11:33:21,058 INFO L125 PetriNetUnfolderBase]: For 5421/5550 co-relation queries the response was YES. [2023-08-24 11:33:21,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14564 conditions, 4500 events. 2792/4500 cut-off events. For 5421/5550 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 28038 event pairs, 483 based on Foata normal form. 188/4507 useless extension candidates. Maximal degree in co-relation 14544. Up to 1667 conditions per place. [2023-08-24 11:33:21,081 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 68 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2023-08-24 11:33:21,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 545 flow [2023-08-24 11:33:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:33:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:33:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-08-24 11:33:21,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138312586445366 [2023-08-24 11:33:21,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-08-24 11:33:21,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-08-24 11:33:21,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:21,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-08-24 11:33:21,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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:33:21,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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:33:21,088 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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:33:21,088 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 211 flow. Second operand 6 states and 743 transitions. [2023-08-24 11:33:21,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 545 flow [2023-08-24 11:33:21,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:33:21,095 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 295 flow [2023-08-24 11:33:21,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-24 11:33:21,095 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-24 11:33:21,095 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 295 flow [2023-08-24 11:33:21,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 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:33:21,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:21,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, 1, 1] [2023-08-24 11:33:21,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:33:21,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:21,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1251549145, now seen corresponding path program 1 times [2023-08-24 11:33:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789515222] [2023-08-24 11:33:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:21,263 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:33:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789515222] [2023-08-24 11:33:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789515222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:33:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895043435] [2023-08-24 11:33:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:21,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:33:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:33:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:33:21,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-08-24 11:33:21,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:33:21,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:21,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-08-24 11:33:21,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:22,000 INFO L124 PetriNetUnfolderBase]: 4442/7273 cut-off events. [2023-08-24 11:33:22,000 INFO L125 PetriNetUnfolderBase]: For 19314/19340 co-relation queries the response was YES. [2023-08-24 11:33:22,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27190 conditions, 7273 events. 4442/7273 cut-off events. For 19314/19340 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 49267 event pairs, 949 based on Foata normal form. 14/7164 useless extension candidates. Maximal degree in co-relation 27167. Up to 3525 conditions per place. [2023-08-24 11:33:22,026 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 66 selfloop transitions, 2 changer transitions 30/104 dead transitions. [2023-08-24 11:33:22,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 887 flow [2023-08-24 11:33:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:33:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:33:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-24 11:33:22,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269709543568465 [2023-08-24 11:33:22,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-24 11:33:22,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-24 11:33:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:22,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-24 11:33:22,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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:33:22,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:22,038 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:33:22,038 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 295 flow. Second operand 4 states and 508 transitions. [2023-08-24 11:33:22,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 887 flow [2023-08-24 11:33:22,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 805 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-24 11:33:22,129 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 281 flow [2023-08-24 11:33:22,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-24 11:33:22,130 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-24 11:33:22,130 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 281 flow [2023-08-24 11:33:22,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:33:22,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:22,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:33:22,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:22,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2048572967, now seen corresponding path program 2 times [2023-08-24 11:33:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170396020] [2023-08-24 11:33:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:22,400 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:33:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170396020] [2023-08-24 11:33:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170396020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:22,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:22,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:33:22,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235164042] [2023-08-24 11:33:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:22,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:33:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:33:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:33:22,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-24 11:33:22,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:33:22,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:22,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-24 11:33:22,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:23,010 INFO L124 PetriNetUnfolderBase]: 3743/6041 cut-off events. [2023-08-24 11:33:23,010 INFO L125 PetriNetUnfolderBase]: For 10550/10790 co-relation queries the response was YES. [2023-08-24 11:33:23,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21739 conditions, 6041 events. 3743/6041 cut-off events. For 10550/10790 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 40830 event pairs, 559 based on Foata normal form. 164/5901 useless extension candidates. Maximal degree in co-relation 21715. Up to 2078 conditions per place. [2023-08-24 11:33:23,035 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 49 selfloop transitions, 18 changer transitions 9/81 dead transitions. [2023-08-24 11:33:23,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 535 flow [2023-08-24 11:33:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:33:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:33:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-24 11:33:23,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4997036158861885 [2023-08-24 11:33:23,039 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-24 11:33:23,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-24 11:33:23,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:23,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-24 11:33:23,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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:33:23,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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:33:23,046 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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:33:23,046 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 281 flow. Second operand 7 states and 843 transitions. [2023-08-24 11:33:23,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 535 flow [2023-08-24 11:33:23,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 11:33:23,182 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 287 flow [2023-08-24 11:33:23,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-08-24 11:33:23,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-24 11:33:23,183 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 287 flow [2023-08-24 11:33:23,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:33:23,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:23,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:23,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:33:23,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:23,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1947023393, now seen corresponding path program 1 times [2023-08-24 11:33:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:23,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993045150] [2023-08-24 11:33:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:23,371 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:33:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993045150] [2023-08-24 11:33:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993045150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:23,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:33:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286286788] [2023-08-24 11:33:23,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:23,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:33:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:33:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:33:23,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-24 11:33:23,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:33:23,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:23,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-24 11:33:23,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:23,763 INFO L124 PetriNetUnfolderBase]: 3073/4799 cut-off events. [2023-08-24 11:33:23,764 INFO L125 PetriNetUnfolderBase]: For 13300/13300 co-relation queries the response was YES. [2023-08-24 11:33:23,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18164 conditions, 4799 events. 3073/4799 cut-off events. For 13300/13300 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 26512 event pairs, 784 based on Foata normal form. 1/4800 useless extension candidates. Maximal degree in co-relation 18144. Up to 2741 conditions per place. [2023-08-24 11:33:23,780 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 37 selfloop transitions, 3 changer transitions 69/109 dead transitions. [2023-08-24 11:33:23,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 927 flow [2023-08-24 11:33:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:33:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:33:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-08-24 11:33:23,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487551867219917 [2023-08-24 11:33:23,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-08-24 11:33:23,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-08-24 11:33:23,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:23,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-08-24 11:33:23,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:33:23,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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:33:23,788 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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:33:23,788 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 287 flow. Second operand 6 states and 705 transitions. [2023-08-24 11:33:23,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 927 flow [2023-08-24 11:33:23,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 710 flow, removed 34 selfloop flow, removed 12 redundant places. [2023-08-24 11:33:23,903 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 183 flow [2023-08-24 11:33:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-08-24 11:33:23,904 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-24 11:33:23,904 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 183 flow [2023-08-24 11:33:23,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:33:23,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:23,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:23,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:33:23,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:23,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -982350723, now seen corresponding path program 2 times [2023-08-24 11:33:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529411140] [2023-08-24 11:33:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:33:25,008 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:33:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:33:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529411140] [2023-08-24 11:33:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529411140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:33:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:33:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:33:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987300022] [2023-08-24 11:33:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:33:25,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:33:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:33:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:33:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:33:25,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-24 11:33:25,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:33:25,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:33:25,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-24 11:33:25,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:33:25,330 INFO L124 PetriNetUnfolderBase]: 401/729 cut-off events. [2023-08-24 11:33:25,331 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2023-08-24 11:33:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 729 events. 401/729 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3475 event pairs, 70 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 2449. Up to 303 conditions per place. [2023-08-24 11:33:25,333 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 38 selfloop transitions, 5 changer transitions 28/75 dead transitions. [2023-08-24 11:33:25,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 523 flow [2023-08-24 11:33:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:33:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:33:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 890 transitions. [2023-08-24 11:33:25,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616182572614108 [2023-08-24 11:33:25,339 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 890 transitions. [2023-08-24 11:33:25,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 890 transitions. [2023-08-24 11:33:25,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:33:25,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 890 transitions. [2023-08-24 11:33:25,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states 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:33:25,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states 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:33:25,345 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states 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:33:25,345 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 183 flow. Second operand 8 states and 890 transitions. [2023-08-24 11:33:25,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 523 flow [2023-08-24 11:33:25,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 425 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-24 11:33:25,350 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 155 flow [2023-08-24 11:33:25,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-24 11:33:25,350 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-08-24 11:33:25,350 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 155 flow [2023-08-24 11:33:25,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:33:25,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:33:25,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:25,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:33:25,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:33:25,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:33:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1396154401, now seen corresponding path program 3 times [2023-08-24 11:33:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:33:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057126191] [2023-08-24 11:33:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:33:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:33:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:33:25,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:33:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:33:25,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:33:25,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:33:25,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:33:25,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:33:25,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:33:25,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:33:25,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:33:25,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:33:25,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:33:25,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:33:25,443 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:33:25,448 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:33:25,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:33:25,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:33:25 BasicIcfg [2023-08-24 11:33:25,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:33:25,512 INFO L158 Benchmark]: Toolchain (without parser) took 16247.67ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 312.5MB in the beginning and 467.5MB in the end (delta: -155.0MB). Peak memory consumption was 284.4MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,512 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:33:25,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.36ms. Allocated memory is still 354.4MB. Free memory was 312.5MB in the beginning and 288.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.19ms. Allocated memory is still 354.4MB. Free memory was 288.4MB in the beginning and 285.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,513 INFO L158 Benchmark]: Boogie Preprocessor took 46.04ms. Allocated memory is still 354.4MB. Free memory was 285.2MB in the beginning and 283.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,513 INFO L158 Benchmark]: RCFGBuilder took 594.74ms. Allocated memory is still 354.4MB. Free memory was 283.1MB in the beginning and 241.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,513 INFO L158 Benchmark]: TraceAbstraction took 14986.87ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 240.1MB in the beginning and 467.5MB in the end (delta: -227.3MB). Peak memory consumption was 213.1MB. Max. memory is 16.0GB. [2023-08-24 11:33:25,514 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.13ms. Allocated memory is still 354.4MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 536.36ms. Allocated memory is still 354.4MB. Free memory was 312.5MB in the beginning and 288.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.19ms. Allocated memory is still 354.4MB. Free memory was 288.4MB in the beginning and 285.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.04ms. Allocated memory is still 354.4MB. Free memory was 285.2MB in the beginning and 283.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 594.74ms. Allocated memory is still 354.4MB. Free memory was 283.1MB in the beginning and 241.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 14986.87ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 240.1MB in the beginning and 467.5MB in the end (delta: -227.3MB). Peak memory consumption was 213.1MB. 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.9s, 138 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 29 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 6966 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3467, independent: 3263, independent conditional: 0, independent unconditional: 3263, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1554, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3467, independent: 1753, independent conditional: 0, independent unconditional: 1753, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1554, unknown conditional: 0, unknown unconditional: 1554] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-2, t93={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=-1, t93={5:0}, t94={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=0, t93={5:0}, t94={6:0}, t95={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=1, t93={5:0}, t94={6:0}, t95={7:0}, t96={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 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 [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 878]: 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: 874]: 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: 876]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 935 IncrementalHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 18 mSDtfsCounter, 935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:33:25,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...