/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:58:10,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:58:10,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 22:58:10,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:58:10,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:58:10,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:58:10,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:58:10,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:58:10,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:58:10,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:58:10,535 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:58:10,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:58:10,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:58:10,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:58:10,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:58:10,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:58:10,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:58:10,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:58:10,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:58:10,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:58:10,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:58:10,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:58:10,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:58:10,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:58:10,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:58:10,540 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:58:10,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:58:10,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:58:10,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:58:10,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:58:10,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:58:10,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:58:10,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:58:10,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:58:10,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:58:10,543 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 22:58:10,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:58:10,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:58:10,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:58:10,857 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:58:10,859 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:58:10,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 22:58:11,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:58:12,236 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:58:12,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 22:58:12,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3d6fa15/c043d20ebd844adc97b1b19148b1e9bc/FLAGd0c3f08ba [2023-08-23 22:58:12,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3d6fa15/c043d20ebd844adc97b1b19148b1e9bc [2023-08-23 22:58:12,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:58:12,285 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:58:12,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:58:12,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:58:12,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:58:12,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274b19be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12, skipping insertion in model container [2023-08-23 22:58:12,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,353 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:58:12,489 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-23 22:58:12,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:58:12,734 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:58:12,744 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-23 22:58:12,764 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:58:12,766 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:58:12,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:58:12,850 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:58:12,850 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:58:12,856 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:58:12,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12 WrapperNode [2023-08-23 22:58:12,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:58:12,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:58:12,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:58:12,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:58:12,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,924 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 22:58:12,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:58:12,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:58:12,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:58:12,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:58:12,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:58:12,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:58:12,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:58:12,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:58:12,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (1/1) ... [2023-08-23 22:58:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:58:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:58:13,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 22:58:13,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 22:58:13,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 22:58:13,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 22:58:13,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 22:58:13,061 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 22:58:13,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 22:58:13,062 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 22:58:13,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 22:58:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:58:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 22:58:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:58:13,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:58:13,064 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:58:13,226 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:58:13,228 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:58:13,540 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:58:13,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:58:13,711 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 22:58:13,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:58:13 BoogieIcfgContainer [2023-08-23 22:58:13,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:58:13,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:58:13,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:58:13,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:58:13,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:58:12" (1/3) ... [2023-08-23 22:58:13,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfd955b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:58:13, skipping insertion in model container [2023-08-23 22:58:13,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:58:12" (2/3) ... [2023-08-23 22:58:13,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfd955b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:58:13, skipping insertion in model container [2023-08-23 22:58:13,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:58:13" (3/3) ... [2023-08-23 22:58:13,722 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 22:58:13,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:58:13,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:58:13,739 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:58:13,804 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 22:58:13,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-23 22:58:13,911 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-23 22:58:13,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:58:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-23 22:58:13,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-23 22:58:13,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-23 22:58:13,929 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:58:13,942 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-23 22:58:13,946 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-23 22:58:13,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-23 22:58:13,990 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-23 22:58:13,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:58:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-23 22:58:13,995 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-08-23 22:58:17,897 INFO L134 LiptonReduction]: Checked pairs total: 9320 [2023-08-23 22:58:17,897 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-23 22:58:17,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:58:17,923 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;@7ae2796c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:58:17,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 22:58:17,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:58:17,938 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-23 22:58:17,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:58:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:17,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 22:58:17,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:17,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 550583, now seen corresponding path program 1 times [2023-08-23 22:58:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391226558] [2023-08-23 22:58:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391226558] [2023-08-23 22:58:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391226558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:58:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525016503] [2023-08-23 22:58:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:58:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:58:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:58:18,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 239 [2023-08-23 22:58:18,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:18,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:18,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 239 [2023-08-23 22:58:18,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:19,464 INFO L124 PetriNetUnfolderBase]: 5879/8061 cut-off events. [2023-08-23 22:58:19,464 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-23 22:58:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16205 conditions, 8061 events. 5879/8061 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 40811 event pairs, 3031 based on Foata normal form. 0/7718 useless extension candidates. Maximal degree in co-relation 16193. Up to 6367 conditions per place. [2023-08-23 22:58:19,517 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-23 22:58:19,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 219 flow [2023-08-23 22:58:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:58:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:58:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-23 22:58:19,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5550906555090656 [2023-08-23 22:58:19,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-23 22:58:19,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-23 22:58:19,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:19,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-23 22:58:19,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:19,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:19,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:19,554 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 398 transitions. [2023-08-23 22:58:19,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 219 flow [2023-08-23 22:58:19,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 22:58:19,562 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-08-23 22:58:19,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-23 22:58:19,566 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-08-23 22:58:19,567 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-08-23 22:58:19,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:19,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:19,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:19,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:58:19,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:19,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1379440190, now seen corresponding path program 1 times [2023-08-23 22:58:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401564878] [2023-08-23 22:58:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401564878] [2023-08-23 22:58:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401564878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:58:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807497015] [2023-08-23 22:58:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:19,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:58:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:58:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:58:19,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 239 [2023-08-23 22:58:19,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:19,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:19,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 239 [2023-08-23 22:58:19,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:20,926 INFO L124 PetriNetUnfolderBase]: 6835/9772 cut-off events. [2023-08-23 22:58:20,927 INFO L125 PetriNetUnfolderBase]: For 481/481 co-relation queries the response was YES. [2023-08-23 22:58:20,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19836 conditions, 9772 events. 6835/9772 cut-off events. For 481/481 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 57873 event pairs, 1611 based on Foata normal form. 400/10150 useless extension candidates. Maximal degree in co-relation 19826. Up to 7711 conditions per place. [2023-08-23 22:58:20,989 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 41 selfloop transitions, 3 changer transitions 25/73 dead transitions. [2023-08-23 22:58:20,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 308 flow [2023-08-23 22:58:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:58:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:58:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-23 22:58:20,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238493723849372 [2023-08-23 22:58:20,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-23 22:58:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-23 22:58:20,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:20,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-23 22:58:20,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:20,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:20,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:20,998 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 626 transitions. [2023-08-23 22:58:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 308 flow [2023-08-23 22:58:20,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:58:21,001 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 95 flow [2023-08-23 22:58:21,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=68, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-23 22:58:21,003 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-23 22:58:21,005 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 95 flow [2023-08-23 22:58:21,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:21,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:21,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:21,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:58:21,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:21,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash 186974941, now seen corresponding path program 1 times [2023-08-23 22:58:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265610039] [2023-08-23 22:58:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265610039] [2023-08-23 22:58:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265610039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:58:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616956432] [2023-08-23 22:58:21,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:21,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:21,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:21,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-23 22:58:21,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:21,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:21,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-23 22:58:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:23,881 INFO L124 PetriNetUnfolderBase]: 22331/30204 cut-off events. [2023-08-23 22:58:23,882 INFO L125 PetriNetUnfolderBase]: For 10865/10865 co-relation queries the response was YES. [2023-08-23 22:58:23,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69137 conditions, 30204 events. 22331/30204 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 159497 event pairs, 3787 based on Foata normal form. 1332/31536 useless extension candidates. Maximal degree in co-relation 69124. Up to 12807 conditions per place. [2023-08-23 22:58:24,068 INFO L140 encePairwiseOnDemand]: 228/239 looper letters, 58 selfloop transitions, 10 changer transitions 49/117 dead transitions. [2023-08-23 22:58:24,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 553 flow [2023-08-23 22:58:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:58:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:58:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-08-23 22:58:24,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919306634787806 [2023-08-23 22:58:24,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-08-23 22:58:24,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-08-23 22:58:24,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:24,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-08-23 22:58:24,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:24,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:24,077 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:24,077 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 95 flow. Second operand 7 states and 823 transitions. [2023-08-23 22:58:24,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 553 flow [2023-08-23 22:58:24,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 117 transitions, 544 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 22:58:24,548 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 196 flow [2023-08-23 22:58:24,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-23 22:58:24,549 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2023-08-23 22:58:24,549 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 196 flow [2023-08-23 22:58:24,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:24,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:24,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:24,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:58:24,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:24,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -138876974, now seen corresponding path program 1 times [2023-08-23 22:58:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042549814] [2023-08-23 22:58:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042549814] [2023-08-23 22:58:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042549814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:58:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676565261] [2023-08-23 22:58:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:24,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:24,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-23 22:58:24,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:24,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:24,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-23 22:58:24,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:27,321 INFO L124 PetriNetUnfolderBase]: 22660/30874 cut-off events. [2023-08-23 22:58:27,321 INFO L125 PetriNetUnfolderBase]: For 48983/48983 co-relation queries the response was YES. [2023-08-23 22:58:27,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92279 conditions, 30874 events. 22660/30874 cut-off events. For 48983/48983 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 171188 event pairs, 2479 based on Foata normal form. 969/31843 useless extension candidates. Maximal degree in co-relation 92260. Up to 16187 conditions per place. [2023-08-23 22:58:27,533 INFO L140 encePairwiseOnDemand]: 228/239 looper letters, 67 selfloop transitions, 21 changer transitions 45/133 dead transitions. [2023-08-23 22:58:27,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 133 transitions, 880 flow [2023-08-23 22:58:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:58:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:58:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-08-23 22:58:27,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919306634787806 [2023-08-23 22:58:27,536 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-08-23 22:58:27,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-08-23 22:58:27,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:27,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-08-23 22:58:27,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:27,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:27,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:27,542 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 196 flow. Second operand 7 states and 823 transitions. [2023-08-23 22:58:27,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 133 transitions, 880 flow [2023-08-23 22:58:27,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 133 transitions, 872 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 22:58:27,656 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 425 flow [2023-08-23 22:58:27,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-23 22:58:27,657 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-08-23 22:58:27,657 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 425 flow [2023-08-23 22:58:27,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:27,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:27,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:27,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:58:27,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:27,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash -10739995, now seen corresponding path program 1 times [2023-08-23 22:58:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146238320] [2023-08-23 22:58:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146238320] [2023-08-23 22:58:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146238320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:58:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886052342] [2023-08-23 22:58:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:27,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:27,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-23 22:58:27,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:27,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:27,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-23 22:58:27,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:31,642 INFO L124 PetriNetUnfolderBase]: 30872/42221 cut-off events. [2023-08-23 22:58:31,642 INFO L125 PetriNetUnfolderBase]: For 128158/128158 co-relation queries the response was YES. [2023-08-23 22:58:31,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142383 conditions, 42221 events. 30872/42221 cut-off events. For 128158/128158 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 244754 event pairs, 5516 based on Foata normal form. 1056/43277 useless extension candidates. Maximal degree in co-relation 142358. Up to 17539 conditions per place. [2023-08-23 22:58:31,996 INFO L140 encePairwiseOnDemand]: 228/239 looper letters, 72 selfloop transitions, 31 changer transitions 48/151 dead transitions. [2023-08-23 22:58:31,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 151 transitions, 1210 flow [2023-08-23 22:58:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:58:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:58:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-23 22:58:31,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943215780035864 [2023-08-23 22:58:31,998 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-23 22:58:31,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-23 22:58:31,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:31,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-23 22:58:32,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:32,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:32,004 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:32,004 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 425 flow. Second operand 7 states and 827 transitions. [2023-08-23 22:58:32,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 151 transitions, 1210 flow [2023-08-23 22:58:32,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 151 transitions, 1190 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-23 22:58:32,472 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 675 flow [2023-08-23 22:58:32,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-08-23 22:58:32,473 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2023-08-23 22:58:32,473 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 675 flow [2023-08-23 22:58:32,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:32,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:32,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:32,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:58:32,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:32,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1387523075, now seen corresponding path program 1 times [2023-08-23 22:58:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264782099] [2023-08-23 22:58:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264782099] [2023-08-23 22:58:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264782099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:58:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794533148] [2023-08-23 22:58:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:32,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-23 22:58:32,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 675 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:32,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:32,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-23 22:58:32,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:36,066 INFO L124 PetriNetUnfolderBase]: 27188/37508 cut-off events. [2023-08-23 22:58:36,066 INFO L125 PetriNetUnfolderBase]: For 175752/175752 co-relation queries the response was YES. [2023-08-23 22:58:36,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137862 conditions, 37508 events. 27188/37508 cut-off events. For 175752/175752 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 217730 event pairs, 5090 based on Foata normal form. 1285/38793 useless extension candidates. Maximal degree in co-relation 137831. Up to 16374 conditions per place. [2023-08-23 22:58:36,318 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 89 selfloop transitions, 18 changer transitions 54/161 dead transitions. [2023-08-23 22:58:36,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 161 transitions, 1696 flow [2023-08-23 22:58:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:58:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:58:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2023-08-23 22:58:36,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48894202032277345 [2023-08-23 22:58:36,321 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2023-08-23 22:58:36,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2023-08-23 22:58:36,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:36,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2023-08-23 22:58:36,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:36,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:36,329 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:36,329 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 675 flow. Second operand 7 states and 818 transitions. [2023-08-23 22:58:36,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 161 transitions, 1696 flow [2023-08-23 22:58:36,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 161 transitions, 1678 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-23 22:58:36,654 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 922 flow [2023-08-23 22:58:36,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=922, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2023-08-23 22:58:36,655 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-08-23 22:58:36,655 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 922 flow [2023-08-23 22:58:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:36,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:36,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:58:36,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:36,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1092509711, now seen corresponding path program 1 times [2023-08-23 22:58:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885784951] [2023-08-23 22:58:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:36,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885784951] [2023-08-23 22:58:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885784951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:58:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478072118] [2023-08-23 22:58:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:58:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:58:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:58:36,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:58:36,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 922 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:36,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:36,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:58:36,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:39,032 INFO L124 PetriNetUnfolderBase]: 14586/21755 cut-off events. [2023-08-23 22:58:39,032 INFO L125 PetriNetUnfolderBase]: For 96447/99343 co-relation queries the response was YES. [2023-08-23 22:58:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73271 conditions, 21755 events. 14586/21755 cut-off events. For 96447/99343 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 146226 event pairs, 2830 based on Foata normal form. 2210/23424 useless extension candidates. Maximal degree in co-relation 73235. Up to 13917 conditions per place. [2023-08-23 22:58:39,161 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 117 selfloop transitions, 10 changer transitions 14/173 dead transitions. [2023-08-23 22:58:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 173 transitions, 2210 flow [2023-08-23 22:58:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:58:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:58:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-08-23 22:58:39,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171548117154812 [2023-08-23 22:58:39,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-08-23 22:58:39,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-08-23 22:58:39,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:39,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-08-23 22:58:39,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:39,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:39,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:39,168 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 922 flow. Second operand 5 states and 618 transitions. [2023-08-23 22:58:39,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 173 transitions, 2210 flow [2023-08-23 22:58:39,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 173 transitions, 2178 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-23 22:58:39,293 INFO L231 Difference]: Finished difference. Result has 74 places, 84 transitions, 974 flow [2023-08-23 22:58:39,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=974, PETRI_PLACES=74, PETRI_TRANSITIONS=84} [2023-08-23 22:58:39,294 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-08-23 22:58:39,294 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 84 transitions, 974 flow [2023-08-23 22:58:39,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:39,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:39,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:39,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:58:39,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:39,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash 663374484, now seen corresponding path program 1 times [2023-08-23 22:58:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058044] [2023-08-23 22:58:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058044] [2023-08-23 22:58:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:58:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649449740] [2023-08-23 22:58:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:39,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:39,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-23 22:58:39,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 84 transitions, 974 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:39,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:39,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-23 22:58:39,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:43,600 INFO L124 PetriNetUnfolderBase]: 27091/39128 cut-off events. [2023-08-23 22:58:43,601 INFO L125 PetriNetUnfolderBase]: For 207778/207778 co-relation queries the response was YES. [2023-08-23 22:58:43,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170298 conditions, 39128 events. 27091/39128 cut-off events. For 207778/207778 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 253084 event pairs, 8047 based on Foata normal form. 528/39656 useless extension candidates. Maximal degree in co-relation 170261. Up to 19775 conditions per place. [2023-08-23 22:58:43,830 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 94 selfloop transitions, 29 changer transitions 66/189 dead transitions. [2023-08-23 22:58:43,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 189 transitions, 2057 flow [2023-08-23 22:58:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:58:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:58:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-23 22:58:43,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913329348475792 [2023-08-23 22:58:43,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-23 22:58:43,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-23 22:58:43,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:43,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-23 22:58:43,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:43,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:43,838 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:43,838 INFO L175 Difference]: Start difference. First operand has 74 places, 84 transitions, 974 flow. Second operand 7 states and 822 transitions. [2023-08-23 22:58:43,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 189 transitions, 2057 flow [2023-08-23 22:58:44,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 189 transitions, 2022 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-23 22:58:44,097 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 1014 flow [2023-08-23 22:58:44,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1014, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-08-23 22:58:44,100 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2023-08-23 22:58:44,100 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 1014 flow [2023-08-23 22:58:44,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:44,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:44,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 22:58:44,102 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:44,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 686602672, now seen corresponding path program 1 times [2023-08-23 22:58:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792407669] [2023-08-23 22:58:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792407669] [2023-08-23 22:58:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792407669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:44,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:58:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384736149] [2023-08-23 22:58:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:44,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:58:44,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 1014 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:44,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:44,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:58:44,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:45,860 INFO L124 PetriNetUnfolderBase]: 8233/12979 cut-off events. [2023-08-23 22:58:45,860 INFO L125 PetriNetUnfolderBase]: For 64295/65446 co-relation queries the response was YES. [2023-08-23 22:58:45,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50915 conditions, 12979 events. 8233/12979 cut-off events. For 64295/65446 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 87704 event pairs, 1249 based on Foata normal form. 1530/14273 useless extension candidates. Maximal degree in co-relation 50872. Up to 4938 conditions per place. [2023-08-23 22:58:45,940 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 148 selfloop transitions, 14 changer transitions 8/198 dead transitions. [2023-08-23 22:58:45,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 198 transitions, 2754 flow [2023-08-23 22:58:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:58:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:58:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-08-23 22:58:45,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188284518828452 [2023-08-23 22:58:45,942 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-08-23 22:58:45,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-08-23 22:58:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:45,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-08-23 22:58:45,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:45,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:45,947 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:45,947 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 1014 flow. Second operand 6 states and 744 transitions. [2023-08-23 22:58:45,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 198 transitions, 2754 flow [2023-08-23 22:58:46,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 198 transitions, 2660 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-23 22:58:46,104 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 1076 flow [2023-08-23 22:58:46,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1076, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2023-08-23 22:58:46,104 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2023-08-23 22:58:46,105 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 1076 flow [2023-08-23 22:58:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:46,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:46,105 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-23 22:58:46,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 22:58:46,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:46,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash -379689411, now seen corresponding path program 1 times [2023-08-23 22:58:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197902344] [2023-08-23 22:58:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197902344] [2023-08-23 22:58:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197902344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:58:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954964723] [2023-08-23 22:58:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:46,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:58:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:58:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:58:46,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:58:46,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 1076 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:46,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:46,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:58:46,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:47,661 INFO L124 PetriNetUnfolderBase]: 7024/11128 cut-off events. [2023-08-23 22:58:47,661 INFO L125 PetriNetUnfolderBase]: For 51862/52584 co-relation queries the response was YES. [2023-08-23 22:58:47,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49316 conditions, 11128 events. 7024/11128 cut-off events. For 51862/52584 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 74827 event pairs, 862 based on Foata normal form. 689/11593 useless extension candidates. Maximal degree in co-relation 49271. Up to 4453 conditions per place. [2023-08-23 22:58:47,734 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 153 selfloop transitions, 22 changer transitions 31/230 dead transitions. [2023-08-23 22:58:47,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 230 transitions, 3048 flow [2023-08-23 22:58:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 22:58:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 22:58:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 991 transitions. [2023-08-23 22:58:47,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518305439330544 [2023-08-23 22:58:47,736 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 991 transitions. [2023-08-23 22:58:47,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 991 transitions. [2023-08-23 22:58:47,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:47,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 991 transitions. [2023-08-23 22:58:47,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:47,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:47,743 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:47,743 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 1076 flow. Second operand 8 states and 991 transitions. [2023-08-23 22:58:47,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 230 transitions, 3048 flow [2023-08-23 22:58:48,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 230 transitions, 2996 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-08-23 22:58:48,522 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 1084 flow [2023-08-23 22:58:48,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1084, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2023-08-23 22:58:48,523 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2023-08-23 22:58:48,523 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 1084 flow [2023-08-23 22:58:48,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:48,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:48,524 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-23 22:58:48,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 22:58:48,524 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:48,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -127019374, now seen corresponding path program 1 times [2023-08-23 22:58:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432048171] [2023-08-23 22:58:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432048171] [2023-08-23 22:58:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432048171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 22:58:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300030151] [2023-08-23 22:58:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:48,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:58:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:58:48,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:58:48,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:58:48,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 1084 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:48,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:48,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:58:48,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:49,861 INFO L124 PetriNetUnfolderBase]: 6077/9742 cut-off events. [2023-08-23 22:58:49,861 INFO L125 PetriNetUnfolderBase]: For 47967/48639 co-relation queries the response was YES. [2023-08-23 22:58:49,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42927 conditions, 9742 events. 6077/9742 cut-off events. For 47967/48639 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 66076 event pairs, 784 based on Foata normal form. 306/9830 useless extension candidates. Maximal degree in co-relation 42880. Up to 2421 conditions per place. [2023-08-23 22:58:49,921 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 102 selfloop transitions, 26 changer transitions 81/219 dead transitions. [2023-08-23 22:58:49,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 219 transitions, 2842 flow [2023-08-23 22:58:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 22:58:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 22:58:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1209 transitions. [2023-08-23 22:58:49,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505857740585774 [2023-08-23 22:58:49,924 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1209 transitions. [2023-08-23 22:58:49,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1209 transitions. [2023-08-23 22:58:49,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:49,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1209 transitions. [2023-08-23 22:58:49,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.9) internal successors, (1209), 10 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:49,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:49,931 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:49,931 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 1084 flow. Second operand 10 states and 1209 transitions. [2023-08-23 22:58:49,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 219 transitions, 2842 flow [2023-08-23 22:58:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 219 transitions, 2507 flow, removed 75 selfloop flow, removed 11 redundant places. [2023-08-23 22:58:50,883 INFO L231 Difference]: Finished difference. Result has 92 places, 62 transitions, 555 flow [2023-08-23 22:58:50,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=92, PETRI_TRANSITIONS=62} [2023-08-23 22:58:50,883 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2023-08-23 22:58:50,883 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 62 transitions, 555 flow [2023-08-23 22:58:50,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:50,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:50,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:50,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 22:58:50,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:50,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1919495576, now seen corresponding path program 1 times [2023-08-23 22:58:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:50,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810716501] [2023-08-23 22:58:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810716501] [2023-08-23 22:58:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810716501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:51,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:51,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 22:58:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641524608] [2023-08-23 22:58:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:51,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 22:58:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 22:58:51,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-23 22:58:51,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-08-23 22:58:51,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 62 transitions, 555 flow. Second operand has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:51,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:51,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-08-23 22:58:51,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:52,268 INFO L124 PetriNetUnfolderBase]: 1724/2877 cut-off events. [2023-08-23 22:58:52,268 INFO L125 PetriNetUnfolderBase]: For 10295/10356 co-relation queries the response was YES. [2023-08-23 22:58:52,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 2877 events. 1724/2877 cut-off events. For 10295/10356 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16001 event pairs, 337 based on Foata normal form. 21/2842 useless extension candidates. Maximal degree in co-relation 12716. Up to 1421 conditions per place. [2023-08-23 22:58:52,286 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 79 selfloop transitions, 4 changer transitions 49/142 dead transitions. [2023-08-23 22:58:52,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 142 transitions, 1454 flow [2023-08-23 22:58:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 22:58:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 22:58:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 882 transitions. [2023-08-23 22:58:52,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46129707112970714 [2023-08-23 22:58:52,289 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 882 transitions. [2023-08-23 22:58:52,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 882 transitions. [2023-08-23 22:58:52,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:52,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 882 transitions. [2023-08-23 22:58:52,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:52,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:52,293 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:52,294 INFO L175 Difference]: Start difference. First operand has 92 places, 62 transitions, 555 flow. Second operand 8 states and 882 transitions. [2023-08-23 22:58:52,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 142 transitions, 1454 flow [2023-08-23 22:58:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 142 transitions, 1130 flow, removed 79 selfloop flow, removed 19 redundant places. [2023-08-23 22:58:52,331 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 420 flow [2023-08-23 22:58:52,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2023-08-23 22:58:52,332 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2023-08-23 22:58:52,332 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 420 flow [2023-08-23 22:58:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:52,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:52,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 22:58:52,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:52,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -633606004, now seen corresponding path program 2 times [2023-08-23 22:58:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350961113] [2023-08-23 22:58:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:52,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-23 22:58:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350961113] [2023-08-23 22:58:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350961113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:58:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118592990] [2023-08-23 22:58:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:52,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:52,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-23 22:58:52,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:52,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:52,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-23 22:58:52,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:53,019 INFO L124 PetriNetUnfolderBase]: 2169/3438 cut-off events. [2023-08-23 22:58:53,019 INFO L125 PetriNetUnfolderBase]: For 7706/7706 co-relation queries the response was YES. [2023-08-23 22:58:53,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12983 conditions, 3438 events. 2169/3438 cut-off events. For 7706/7706 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17337 event pairs, 378 based on Foata normal form. 1/3439 useless extension candidates. Maximal degree in co-relation 12958. Up to 1745 conditions per place. [2023-08-23 22:58:53,036 INFO L140 encePairwiseOnDemand]: 228/239 looper letters, 61 selfloop transitions, 19 changer transitions 58/138 dead transitions. [2023-08-23 22:58:53,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 1140 flow [2023-08-23 22:58:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:58:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:58:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2023-08-23 22:58:53,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46443514644351463 [2023-08-23 22:58:53,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2023-08-23 22:58:53,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2023-08-23 22:58:53,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:53,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2023-08-23 22:58:53,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,042 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 420 flow. Second operand 6 states and 666 transitions. [2023-08-23 22:58:53,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 1140 flow [2023-08-23 22:58:53,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 138 transitions, 1118 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-23 22:58:53,072 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 450 flow [2023-08-23 22:58:53,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-23 22:58:53,073 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2023-08-23 22:58:53,073 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 450 flow [2023-08-23 22:58:53,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:53,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:53,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 22:58:53,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:53,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1797435210, now seen corresponding path program 3 times [2023-08-23 22:58:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317430025] [2023-08-23 22:58:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:58:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:58:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:58:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317430025] [2023-08-23 22:58:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317430025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:58:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:58:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:58:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104130585] [2023-08-23 22:58:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:58:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:58:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:58:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:58:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:58:53,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:58:53,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 450 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:58:53,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:58:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:58:53,660 INFO L124 PetriNetUnfolderBase]: 1319/2123 cut-off events. [2023-08-23 22:58:53,660 INFO L125 PetriNetUnfolderBase]: For 5095/5108 co-relation queries the response was YES. [2023-08-23 22:58:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8061 conditions, 2123 events. 1319/2123 cut-off events. For 5095/5108 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10031 event pairs, 444 based on Foata normal form. 11/2116 useless extension candidates. Maximal degree in co-relation 8035. Up to 899 conditions per place. [2023-08-23 22:58:53,668 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 44 selfloop transitions, 1 changer transitions 47/95 dead transitions. [2023-08-23 22:58:53,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 824 flow [2023-08-23 22:58:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:58:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:58:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-23 22:58:53,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2023-08-23 22:58:53,670 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-23 22:58:53,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-23 22:58:53,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:58:53,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-23 22:58:53,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,674 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,674 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 450 flow. Second operand 5 states and 596 transitions. [2023-08-23 22:58:53,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 824 flow [2023-08-23 22:58:53,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 95 transitions, 797 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-23 22:58:53,694 INFO L231 Difference]: Finished difference. Result has 75 places, 42 transitions, 237 flow [2023-08-23 22:58:53,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=75, PETRI_TRANSITIONS=42} [2023-08-23 22:58:53,695 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-08-23 22:58:53,695 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 42 transitions, 237 flow [2023-08-23 22:58:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:58:53,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:58:53,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:53,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 22:58:53,696 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:58:53,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:58:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 756944794, now seen corresponding path program 4 times [2023-08-23 22:58:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:58:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052796130] [2023-08-23 22:58:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:58:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:58:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:58:53,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 22:58:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:58:53,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 22:58:53,813 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 22:58:53,814 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 22:58:53,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 22:58:53,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 22:58:53,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 22:58:53,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 22:58:53,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 22:58:53,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 22:58:53,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-23 22:58:53,817 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:58:53,822 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:58:53,823 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:58:53,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:58:53 BasicIcfg [2023-08-23 22:58:53,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:58:53,899 INFO L158 Benchmark]: Toolchain (without parser) took 41614.46ms. Allocated memory was 350.2MB in the beginning and 12.0GB in the end (delta: 11.6GB). Free memory was 325.7MB in the beginning and 7.2GB in the end (delta: -6.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-23 22:58:53,899 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 350.2MB. Free memory is still 327.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:58:53,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.36ms. Allocated memory is still 350.2MB. Free memory was 325.7MB in the beginning and 301.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 22:58:53,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.33ms. Allocated memory is still 350.2MB. Free memory was 301.5MB in the beginning and 298.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:58:53,900 INFO L158 Benchmark]: Boogie Preprocessor took 56.93ms. Allocated memory is still 350.2MB. Free memory was 298.9MB in the beginning and 296.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:58:53,908 INFO L158 Benchmark]: RCFGBuilder took 731.28ms. Allocated memory is still 350.2MB. Free memory was 296.8MB in the beginning and 316.9MB in the end (delta: -20.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. [2023-08-23 22:58:53,909 INFO L158 Benchmark]: TraceAbstraction took 40182.36ms. Allocated memory was 350.2MB in the beginning and 12.0GB in the end (delta: 11.6GB). Free memory was 315.9MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-23 22:58:53,910 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 350.2MB. Free memory is still 327.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 571.36ms. Allocated memory is still 350.2MB. Free memory was 325.7MB in the beginning and 301.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.33ms. Allocated memory is still 350.2MB. Free memory was 301.5MB in the beginning and 298.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.93ms. Allocated memory is still 350.2MB. Free memory was 298.9MB in the beginning and 296.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 731.28ms. Allocated memory is still 350.2MB. Free memory was 296.8MB in the beginning and 316.9MB in the end (delta: -20.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. * TraceAbstraction took 40182.36ms. Allocated memory was 350.2MB in the beginning and 12.0GB in the end (delta: 11.6GB). Free memory was 315.9MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 4.8GB. 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: 4.0s, 139 PlacesBefore, 45 PlacesAfterwards, 128 TransitionsBefore, 33 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3778, independent: 3551, independent conditional: 0, independent unconditional: 3551, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1714, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3778, independent: 1874, independent conditional: 0, independent unconditional: 1874, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 1714, unknown conditional: 0, unknown unconditional: 1714] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-1, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=0, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t211; [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=2, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L825] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=2, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, 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: 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. - UnprovableResult [Line: 870]: 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, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 734 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2181 IncrementalHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 68 mSDtfsCounter, 2181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1084occurred in iteration=10, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 22:58:53,942 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...