/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:22:20,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:22:20,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:22:20,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:22:20,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:22:20,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:22:20,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:22:20,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:22:20,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:22:20,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:22:20,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:22:20,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:22:20,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:22:20,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:22:20,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:22:20,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:22:20,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:22:20,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:22:20,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:22:20,915 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:22:20,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:22:20,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:22:20,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:22:20,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:22:20,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:22:20,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:22:20,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:22:20,918 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:22:20,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:22:20,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:22:20,918 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:22:20,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 02:22:21,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:22:21,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:22:21,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:22:21,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:22:21,149 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:22:21,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c [2023-08-04 02:22:22,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:22:22,548 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:22:22,548 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c [2023-08-04 02:22:22,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ac78289/3b5382c09d6748b8bfadc4f884081829/FLAGa4ab859f8 [2023-08-04 02:22:22,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ac78289/3b5382c09d6748b8bfadc4f884081829 [2023-08-04 02:22:22,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:22:22,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:22:22,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:22:22,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:22:22,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:22:22,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218d79d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22, skipping insertion in model container [2023-08-04 02:22:22,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,608 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:22:22,739 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c[3674,3687] [2023-08-04 02:22:22,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:22:22,753 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:22:22,777 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c[3674,3687] [2023-08-04 02:22:22,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:22:22,783 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:22:22,783 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:22:22,788 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:22:22,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22 WrapperNode [2023-08-04 02:22:22,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:22:22,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:22:22,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:22:22,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:22:22,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,817 INFO L138 Inliner]: procedures = 21, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2023-08-04 02:22:22,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:22:22,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:22:22,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:22:22,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:22:22,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:22:22,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:22:22,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:22:22,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:22:22,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (1/1) ... [2023-08-04 02:22:22,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:22:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:22,879 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-04 02:22:22,882 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-04 02:22:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:22:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:22:22,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:22:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:22:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:22:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:22:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:22:22,911 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 02:22:23,044 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:22:23,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:22:23,289 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:22:23,332 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:22:23,332 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 02:22:23,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:22:23 BoogieIcfgContainer [2023-08-04 02:22:23,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:22:23,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:22:23,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:22:23,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:22:23,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:22:22" (1/3) ... [2023-08-04 02:22:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff5b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:22:23, skipping insertion in model container [2023-08-04 02:22:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:22:22" (2/3) ... [2023-08-04 02:22:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff5b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:22:23, skipping insertion in model container [2023-08-04 02:22:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:22:23" (3/3) ... [2023-08-04 02:22:23,340 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_parallel-bakery-2.wvr_bound2.c [2023-08-04 02:22:23,345 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:22:23,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:22:23,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:22:23,353 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:22:23,429 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:22:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2023-08-04 02:22:23,542 INFO L124 PetriNetUnfolderBase]: 27/279 cut-off events. [2023-08-04 02:22:23,542 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-04 02:22:23,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 27/279 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 954 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 162. Up to 8 conditions per place. [2023-08-04 02:22:23,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 138 transitions, 298 flow [2023-08-04 02:22:23,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 98 transitions, 206 flow [2023-08-04 02:22:23,560 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:22:23,578 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 98 transitions, 206 flow [2023-08-04 02:22:23,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 98 transitions, 206 flow [2023-08-04 02:22:23,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 98 transitions, 206 flow [2023-08-04 02:22:23,615 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-04 02:22:23,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:22:23,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2023-08-04 02:22:23,617 INFO L119 LiptonReduction]: Number of co-enabled transitions 990 [2023-08-04 02:22:26,164 INFO L134 LiptonReduction]: Checked pairs total: 4969 [2023-08-04 02:22:26,164 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-08-04 02:22:26,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:22:26,189 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=true, 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;@5e47af99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:22:26,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:22:26,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:22:26,200 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 02:22:26,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:22:26,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:26,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 02:22:26,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:26,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash 497800921, now seen corresponding path program 1 times [2023-08-04 02:22:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891500269] [2023-08-04 02:22:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:22:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891500269] [2023-08-04 02:22:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891500269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:22:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:22:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257530972] [2023-08-04 02:22:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:26,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:26,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:22:26,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 215 [2023-08-04 02:22:26,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:26,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:26,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 215 [2023-08-04 02:22:26,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:26,456 INFO L124 PetriNetUnfolderBase]: 72/209 cut-off events. [2023-08-04 02:22:26,456 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 02:22:26,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 209 events. 72/209 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 929 event pairs, 68 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 363. Up to 138 conditions per place. [2023-08-04 02:22:26,459 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 18 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 02:22:26,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 114 flow [2023-08-04 02:22:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 02:22:26,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674418604651162 [2023-08-04 02:22:26,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 02:22:26,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 02:22:26,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:26,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 02:22:26,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:26,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:26,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:26,479 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 64 flow. Second operand 3 states and 366 transitions. [2023-08-04 02:22:26,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 114 flow [2023-08-04 02:22:26,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:22:26,482 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 72 flow [2023-08-04 02:22:26,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-04 02:22:26,485 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-04 02:22:26,485 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 72 flow [2023-08-04 02:22:26,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:26,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:26,486 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 02:22:26,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:22:26,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:26,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1750871083, now seen corresponding path program 1 times [2023-08-04 02:22:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678328951] [2023-08-04 02:22:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:22:26,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:22:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:22:26,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:22:26,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:22:26,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:22:26,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:22:26,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 02:22:26,533 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 02:22:26,534 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:22:26,535 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:22:26,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:22:26,550 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:22:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 380 flow [2023-08-04 02:22:26,624 INFO L124 PetriNetUnfolderBase]: 118/859 cut-off events. [2023-08-04 02:22:26,624 INFO L125 PetriNetUnfolderBase]: For 72/85 co-relation queries the response was YES. [2023-08-04 02:22:26,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 859 events. 118/859 cut-off events. For 72/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4613 event pairs, 1 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 509. Up to 32 conditions per place. [2023-08-04 02:22:26,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 166 transitions, 380 flow [2023-08-04 02:22:26,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 122 transitions, 268 flow [2023-08-04 02:22:26,632 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:22:26,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 122 transitions, 268 flow [2023-08-04 02:22:26,632 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 122 transitions, 268 flow [2023-08-04 02:22:26,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 268 flow [2023-08-04 02:22:26,650 INFO L124 PetriNetUnfolderBase]: 4/248 cut-off events. [2023-08-04 02:22:26,651 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:22:26,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 248 events. 4/248 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 660 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 195. Up to 9 conditions per place. [2023-08-04 02:22:26,655 INFO L119 LiptonReduction]: Number of co-enabled transitions 3036 [2023-08-04 02:22:29,078 INFO L134 LiptonReduction]: Checked pairs total: 21511 [2023-08-04 02:22:29,079 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-04 02:22:29,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:22:29,082 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=true, 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;@5e47af99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:22:29,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:22:29,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:22:29,085 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-08-04 02:22:29,086 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 02:22:29,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:29,086 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:22:29,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:29,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1770342057, now seen corresponding path program 1 times [2023-08-04 02:22:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627309137] [2023-08-04 02:22:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:22:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627309137] [2023-08-04 02:22:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627309137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:22:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:22:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822801081] [2023-08-04 02:22:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:29,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:22:29,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 245 [2023-08-04 02:22:29,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 122 flow. Second operand has 3 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-04 02:22:29,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:29,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 245 [2023-08-04 02:22:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:29,969 INFO L124 PetriNetUnfolderBase]: 4712/8546 cut-off events. [2023-08-04 02:22:29,969 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2023-08-04 02:22:29,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15947 conditions, 8546 events. 4712/8546 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 67386 event pairs, 4708 based on Foata normal form. 0/8153 useless extension candidates. Maximal degree in co-relation 7890. Up to 6628 conditions per place. [2023-08-04 02:22:30,024 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 02:22:30,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 196 flow [2023-08-04 02:22:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-04 02:22:30,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2023-08-04 02:22:30,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-04 02:22:30,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-04 02:22:30,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:30,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-04 02:22:30,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:30,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:30,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:30,034 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 122 flow. Second operand 3 states and 425 transitions. [2023-08-04 02:22:30,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 196 flow [2023-08-04 02:22:30,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 192 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 02:22:30,039 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 130 flow [2023-08-04 02:22:30,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-04 02:22:30,040 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-08-04 02:22:30,040 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 130 flow [2023-08-04 02:22:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-04 02:22:30,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:30,041 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 02:22:30,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:22:30,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:30,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash 222773355, now seen corresponding path program 1 times [2023-08-04 02:22:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615003645] [2023-08-04 02:22:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:22:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615003645] [2023-08-04 02:22:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615003645] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966455778] [2023-08-04 02:22:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:30,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 02:22:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:30,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:22:30,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:22:30,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:22:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966455778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:30,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:22:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 02:22:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486566724] [2023-08-04 02:22:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:30,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:30,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:22:30,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 245 [2023-08-04 02:22:30,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:30,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:30,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 245 [2023-08-04 02:22:30,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:30,817 INFO L124 PetriNetUnfolderBase]: 4672/8435 cut-off events. [2023-08-04 02:22:30,817 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-08-04 02:22:30,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15875 conditions, 8435 events. 4672/8435 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 67495 event pairs, 1920 based on Foata normal form. 25/8220 useless extension candidates. Maximal degree in co-relation 3318. Up to 6499 conditions per place. [2023-08-04 02:22:30,994 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 36 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-04 02:22:30,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 236 flow [2023-08-04 02:22:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:22:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:22:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-04 02:22:30,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5640816326530612 [2023-08-04 02:22:30,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-04 02:22:30,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-04 02:22:30,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:30,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-04 02:22:30,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:30,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,000 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,000 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 130 flow. Second operand 5 states and 691 transitions. [2023-08-04 02:22:31,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 236 flow [2023-08-04 02:22:31,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:22:31,018 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 144 flow [2023-08-04 02:22:31,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-08-04 02:22:31,020 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-08-04 02:22:31,020 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 144 flow [2023-08-04 02:22:31,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:31,021 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:31,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:31,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:31,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:31,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1456518806, now seen corresponding path program 1 times [2023-08-04 02:22:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841221040] [2023-08-04 02:22:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:22:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841221040] [2023-08-04 02:22:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841221040] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494635887] [2023-08-04 02:22:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:31,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:31,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:31,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:31,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 02:22:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:31,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:22:31,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:22:31,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:22:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494635887] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:22:31,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:22:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:22:31,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159567382] [2023-08-04 02:22:31,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:22:31,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:31,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 245 [2023-08-04 02:22:31,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:31,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 245 [2023-08-04 02:22:31,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:31,849 INFO L124 PetriNetUnfolderBase]: 4108/7265 cut-off events. [2023-08-04 02:22:31,849 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2023-08-04 02:22:31,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13784 conditions, 7265 events. 4108/7265 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 55123 event pairs, 1624 based on Foata normal form. 5/7066 useless extension candidates. Maximal degree in co-relation 7948. Up to 5631 conditions per place. [2023-08-04 02:22:31,896 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 36 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-04 02:22:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 242 flow [2023-08-04 02:22:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-08-04 02:22:31,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-08-04 02:22:31,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-08-04 02:22:31,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-08-04 02:22:31,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:31,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-08-04 02:22:31,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,902 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,902 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 144 flow. Second operand 4 states and 560 transitions. [2023-08-04 02:22:31,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 242 flow [2023-08-04 02:22:31,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 237 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 02:22:31,904 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 137 flow [2023-08-04 02:22:31,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-08-04 02:22:31,905 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-08-04 02:22:31,905 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 137 flow [2023-08-04 02:22:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:31,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:31,906 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:31,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:32,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:32,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:22:32,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1081297300, now seen corresponding path program 1 times [2023-08-04 02:22:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969755674] [2023-08-04 02:22:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:22:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969755674] [2023-08-04 02:22:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969755674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230683806] [2023-08-04 02:22:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:32,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:32,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:32,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 02:22:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:32,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:22:32,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:22:32,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:22:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230683806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:32,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:22:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 02:22:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410161116] [2023-08-04 02:22:32,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:22:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:22:32,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:32,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 245 [2023-08-04 02:22:32,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:32,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:32,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 245 [2023-08-04 02:22:32,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:32,601 INFO L124 PetriNetUnfolderBase]: 2108/3929 cut-off events. [2023-08-04 02:22:32,601 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2023-08-04 02:22:32,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 3929 events. 2108/3929 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 27731 event pairs, 568 based on Foata normal form. 625/4512 useless extension candidates. Maximal degree in co-relation 4340. Up to 2550 conditions per place. [2023-08-04 02:22:32,610 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2023-08-04 02:22:32,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 265 flow [2023-08-04 02:22:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-08-04 02:22:32,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2023-08-04 02:22:32,612 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-08-04 02:22:32,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-08-04 02:22:32,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:32,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-08-04 02:22:32,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:32,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:32,617 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:32,617 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 137 flow. Second operand 4 states and 570 transitions. [2023-08-04 02:22:32,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 265 flow [2023-08-04 02:22:32,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 02:22:32,621 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2023-08-04 02:22:32,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2023-08-04 02:22:32,624 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-04 02:22:32,624 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2023-08-04 02:22:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:32,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:22:32,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:22:32,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:32,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:32,830 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:22:32,830 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:22:32,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 380 flow [2023-08-04 02:22:32,895 INFO L124 PetriNetUnfolderBase]: 118/859 cut-off events. [2023-08-04 02:22:32,896 INFO L125 PetriNetUnfolderBase]: For 72/85 co-relation queries the response was YES. [2023-08-04 02:22:32,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 859 events. 118/859 cut-off events. For 72/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4613 event pairs, 1 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 509. Up to 32 conditions per place. [2023-08-04 02:22:32,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 166 transitions, 380 flow [2023-08-04 02:22:32,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 156 transitions, 352 flow [2023-08-04 02:22:32,910 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:22:32,927 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 156 transitions, 352 flow [2023-08-04 02:22:32,927 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 156 transitions, 352 flow [2023-08-04 02:22:32,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 156 transitions, 352 flow [2023-08-04 02:22:32,995 INFO L124 PetriNetUnfolderBase]: 118/727 cut-off events. [2023-08-04 02:22:32,995 INFO L125 PetriNetUnfolderBase]: For 68/75 co-relation queries the response was YES. [2023-08-04 02:22:32,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 727 events. 118/727 cut-off events. For 68/75 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3614 event pairs, 1 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 442. Up to 32 conditions per place. [2023-08-04 02:22:33,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 5896 [2023-08-04 02:22:35,158 INFO L134 LiptonReduction]: Checked pairs total: 40246 [2023-08-04 02:22:35,158 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-04 02:22:35,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:22:35,160 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=true, 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;@5e47af99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:22:35,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:22:35,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:22:35,161 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 02:22:35,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:22:35,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:35,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 02:22:35,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:35,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash 851547020, now seen corresponding path program 1 times [2023-08-04 02:22:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:35,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752324721] [2023-08-04 02:22:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:22:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752324721] [2023-08-04 02:22:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752324721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:22:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:22:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279027282] [2023-08-04 02:22:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:35,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:22:35,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-04 02:22:35,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 170 flow. Second operand has 3 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-04 02:22:35,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:35,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-04 02:22:35,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:38,750 INFO L124 PetriNetUnfolderBase]: 28950/47225 cut-off events. [2023-08-04 02:22:38,751 INFO L125 PetriNetUnfolderBase]: For 3361/3361 co-relation queries the response was YES. [2023-08-04 02:22:38,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89110 conditions, 47225 events. 28950/47225 cut-off events. For 3361/3361 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 411246 event pairs, 27614 based on Foata normal form. 0/42570 useless extension candidates. Maximal degree in co-relation 47093. Up to 39618 conditions per place. [2023-08-04 02:22:39,004 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 45 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-04 02:22:39,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 276 flow [2023-08-04 02:22:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-04 02:22:39,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2023-08-04 02:22:39,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-04 02:22:39,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-04 02:22:39,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:39,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-04 02:22:39,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:39,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:39,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:39,010 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 170 flow. Second operand 3 states and 441 transitions. [2023-08-04 02:22:39,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 276 flow [2023-08-04 02:22:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:22:39,059 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 176 flow [2023-08-04 02:22:39,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-04 02:22:39,060 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2023-08-04 02:22:39,060 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 176 flow [2023-08-04 02:22:39,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-04 02:22:39,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:39,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:39,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 02:22:39,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:39,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -589596849, now seen corresponding path program 1 times [2023-08-04 02:22:39,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:39,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15881956] [2023-08-04 02:22:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:39,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:22:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15881956] [2023-08-04 02:22:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15881956] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:39,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191657144] [2023-08-04 02:22:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:39,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:39,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:39,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 02:22:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:39,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:22:39,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:22:39,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:22:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191657144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:39,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:22:39,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:22:39,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600961005] [2023-08-04 02:22:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:39,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:39,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-04 02:22:39,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:39,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:39,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-04 02:22:39,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:42,495 INFO L124 PetriNetUnfolderBase]: 28920/46144 cut-off events. [2023-08-04 02:22:42,496 INFO L125 PetriNetUnfolderBase]: For 2207/2207 co-relation queries the response was YES. [2023-08-04 02:22:42,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87912 conditions, 46144 events. 28920/46144 cut-off events. For 2207/2207 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 391726 event pairs, 27196 based on Foata normal form. 0/41729 useless extension candidates. Maximal degree in co-relation 55667. Up to 39077 conditions per place. [2023-08-04 02:22:42,708 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 54 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-04 02:22:42,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 316 flow [2023-08-04 02:22:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-04 02:22:42,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5605493133583022 [2023-08-04 02:22:42,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-04 02:22:42,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-04 02:22:42,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:42,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-04 02:22:42,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:42,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:42,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:42,712 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 176 flow. Second operand 3 states and 449 transitions. [2023-08-04 02:22:42,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 316 flow [2023-08-04 02:22:42,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:22:42,716 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 186 flow [2023-08-04 02:22:42,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-08-04 02:22:42,717 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 02:22:42,717 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 186 flow [2023-08-04 02:22:42,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:42,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:42,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:42,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:42,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:42,923 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:42,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1166222867, now seen corresponding path program 1 times [2023-08-04 02:22:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926703732] [2023-08-04 02:22:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:22:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926703732] [2023-08-04 02:22:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926703732] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118570320] [2023-08-04 02:22:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:42,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:42,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:42,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 02:22:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:43,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:22:43,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 02:22:43,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:22:43,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118570320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:43,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:22:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:22:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517665790] [2023-08-04 02:22:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:43,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:43,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-04 02:22:43,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:43,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:43,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-04 02:22:43,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:45,453 INFO L124 PetriNetUnfolderBase]: 22593/35118 cut-off events. [2023-08-04 02:22:45,453 INFO L125 PetriNetUnfolderBase]: For 2755/2755 co-relation queries the response was YES. [2023-08-04 02:22:45,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70505 conditions, 35118 events. 22593/35118 cut-off events. For 2755/2755 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 278668 event pairs, 15188 based on Foata normal form. 0/32788 useless extension candidates. Maximal degree in co-relation 31126. Up to 22430 conditions per place. [2023-08-04 02:22:45,596 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 63 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2023-08-04 02:22:45,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 370 flow [2023-08-04 02:22:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-04 02:22:45,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705368289637952 [2023-08-04 02:22:45,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-04 02:22:45,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-04 02:22:45,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:45,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-04 02:22:45,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:45,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:45,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:45,603 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 186 flow. Second operand 3 states and 457 transitions. [2023-08-04 02:22:45,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 370 flow [2023-08-04 02:22:45,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:22:45,607 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 196 flow [2023-08-04 02:22:45,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-04 02:22:45,609 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 02:22:45,609 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 196 flow [2023-08-04 02:22:45,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:45,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:45,609 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-04 02:22:45,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:45,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:45,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2019885089, now seen corresponding path program 1 times [2023-08-04 02:22:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889865703] [2023-08-04 02:22:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 02:22:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889865703] [2023-08-04 02:22:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889865703] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4483022] [2023-08-04 02:22:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:45,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:45,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:45,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 02:22:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:45,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:22:45,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:22:45,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:22:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4483022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:22:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:22:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 02:22:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115716259] [2023-08-04 02:22:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:22:45,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:22:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:22:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:45,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-04 02:22:45,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:45,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:45,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-04 02:22:45,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:48,251 INFO L124 PetriNetUnfolderBase]: 21814/35153 cut-off events. [2023-08-04 02:22:48,252 INFO L125 PetriNetUnfolderBase]: For 7309/7309 co-relation queries the response was YES. [2023-08-04 02:22:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72551 conditions, 35153 events. 21814/35153 cut-off events. For 7309/7309 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 288314 event pairs, 18207 based on Foata normal form. 0/34398 useless extension candidates. Maximal degree in co-relation 31864. Up to 25788 conditions per place. [2023-08-04 02:22:48,458 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 64 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-08-04 02:22:48,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 382 flow [2023-08-04 02:22:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:22:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:22:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-04 02:22:48,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705368289637952 [2023-08-04 02:22:48,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-04 02:22:48,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-04 02:22:48,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:48,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-04 02:22:48,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:48,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:48,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:48,465 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 196 flow. Second operand 3 states and 457 transitions. [2023-08-04 02:22:48,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 382 flow [2023-08-04 02:22:48,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:22:48,608 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 206 flow [2023-08-04 02:22:48,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-04 02:22:48,609 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-04 02:22:48,609 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 206 flow [2023-08-04 02:22:48,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:48,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:48,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:48,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 02:22:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:48,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:48,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash -114903624, now seen corresponding path program 1 times [2023-08-04 02:22:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596786707] [2023-08-04 02:22:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:22:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:48,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596786707] [2023-08-04 02:22:48,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596786707] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:48,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157017350] [2023-08-04 02:22:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:48,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:48,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:48,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 02:22:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:48,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:22:48,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:22:48,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:22:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157017350] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:22:49,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:22:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:22:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266734371] [2023-08-04 02:22:49,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:22:49,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:49,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-04 02:22:49,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:49,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:49,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-04 02:22:49,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:51,456 INFO L124 PetriNetUnfolderBase]: 20053/31724 cut-off events. [2023-08-04 02:22:51,456 INFO L125 PetriNetUnfolderBase]: For 5055/5055 co-relation queries the response was YES. [2023-08-04 02:22:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66447 conditions, 31724 events. 20053/31724 cut-off events. For 5055/5055 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 252202 event pairs, 9362 based on Foata normal form. 5/31334 useless extension candidates. Maximal degree in co-relation 51428. Up to 27946 conditions per place. [2023-08-04 02:22:51,556 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 55 selfloop transitions, 3 changer transitions 1/83 dead transitions. [2023-08-04 02:22:51,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 352 flow [2023-08-04 02:22:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-04 02:22:51,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5402621722846442 [2023-08-04 02:22:51,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-04 02:22:51,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-04 02:22:51,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:51,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-04 02:22:51,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:51,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:51,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:51,561 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 206 flow. Second operand 4 states and 577 transitions. [2023-08-04 02:22:51,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 352 flow [2023-08-04 02:22:51,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 83 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:22:51,847 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 218 flow [2023-08-04 02:22:51,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2023-08-04 02:22:51,848 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 02:22:51,848 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 218 flow [2023-08-04 02:22:51,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:51,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:51,848 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:51,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 02:22:52,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:52,053 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:52,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -976335070, now seen corresponding path program 1 times [2023-08-04 02:22:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961687776] [2023-08-04 02:22:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:22:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961687776] [2023-08-04 02:22:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961687776] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151105393] [2023-08-04 02:22:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:52,097 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:52,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 02:22:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:52,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:22:52,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:22:52,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:22:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151105393] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:22:52,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:22:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:22:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710145215] [2023-08-04 02:22:52,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:22:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:52,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-04 02:22:52,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:52,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:52,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-04 02:22:52,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:54,275 INFO L124 PetriNetUnfolderBase]: 19218/30012 cut-off events. [2023-08-04 02:22:54,275 INFO L125 PetriNetUnfolderBase]: For 4571/4571 co-relation queries the response was YES. [2023-08-04 02:22:54,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63068 conditions, 30012 events. 19218/30012 cut-off events. For 4571/4571 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 231411 event pairs, 10522 based on Foata normal form. 125/29895 useless extension candidates. Maximal degree in co-relation 48219. Up to 20841 conditions per place. [2023-08-04 02:22:54,416 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 71 selfloop transitions, 3 changer transitions 1/99 dead transitions. [2023-08-04 02:22:54,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 428 flow [2023-08-04 02:22:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2023-08-04 02:22:54,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5552434456928839 [2023-08-04 02:22:54,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2023-08-04 02:22:54,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2023-08-04 02:22:54,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:54,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2023-08-04 02:22:54,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:54,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:54,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:54,447 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 218 flow. Second operand 4 states and 593 transitions. [2023-08-04 02:22:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 428 flow [2023-08-04 02:22:54,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 419 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:22:54,576 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 223 flow [2023-08-04 02:22:54,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-04 02:22:54,576 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-04 02:22:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 223 flow [2023-08-04 02:22:54,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:54,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:54,577 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-08-04 02:22:54,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-04 02:22:54,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 02:22:54,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:54,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:54,782 INFO L85 PathProgramCache]: Analyzing trace with hash -767775857, now seen corresponding path program 1 times [2023-08-04 02:22:54,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:54,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259142652] [2023-08-04 02:22:54,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:54,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:22:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259142652] [2023-08-04 02:22:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259142652] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486323150] [2023-08-04 02:22:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:54,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:54,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 02:22:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:54,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:22:54,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:22:54,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:22:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486323150] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:22:54,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:22:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:22:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759185238] [2023-08-04 02:22:54,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:22:54,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:54,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-04 02:22:54,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:54,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:54,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-04 02:22:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:56,370 INFO L124 PetriNetUnfolderBase]: 13632/21221 cut-off events. [2023-08-04 02:22:56,370 INFO L125 PetriNetUnfolderBase]: For 8755/8755 co-relation queries the response was YES. [2023-08-04 02:22:56,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46682 conditions, 21221 events. 13632/21221 cut-off events. For 8755/8755 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 155216 event pairs, 5303 based on Foata normal form. 500/21246 useless extension candidates. Maximal degree in co-relation 44112. Up to 7668 conditions per place. [2023-08-04 02:22:56,469 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 79 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-04 02:22:56,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 474 flow [2023-08-04 02:22:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-08-04 02:22:56,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627340823970037 [2023-08-04 02:22:56,471 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-08-04 02:22:56,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-08-04 02:22:56,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:56,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-08-04 02:22:56,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:56,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:56,475 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:56,475 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 223 flow. Second operand 4 states and 601 transitions. [2023-08-04 02:22:56,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 474 flow [2023-08-04 02:22:56,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 464 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:22:56,538 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 234 flow [2023-08-04 02:22:56,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-08-04 02:22:56,539 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2023-08-04 02:22:56,539 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 234 flow [2023-08-04 02:22:56,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:56,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:56,540 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:56,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:56,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 02:22:56,745 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:56,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -782625519, now seen corresponding path program 1 times [2023-08-04 02:22:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668721242] [2023-08-04 02:22:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:22:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:22:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668721242] [2023-08-04 02:22:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668721242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:22:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328942269] [2023-08-04 02:22:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:56,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:22:56,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:22:56,807 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:22:56,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 02:22:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:22:56,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:22:56,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:22:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:22:56,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:22:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328942269] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:22:56,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:22:56,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:22:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754853284] [2023-08-04 02:22:56,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:22:56,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:22:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:22:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:22:56,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:22:56,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-04 02:22:56,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:56,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:22:56,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-04 02:22:56,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:22:58,645 INFO L124 PetriNetUnfolderBase]: 13616/21656 cut-off events. [2023-08-04 02:22:58,645 INFO L125 PetriNetUnfolderBase]: For 12278/12278 co-relation queries the response was YES. [2023-08-04 02:22:58,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49284 conditions, 21656 events. 13616/21656 cut-off events. For 12278/12278 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 162958 event pairs, 13009 based on Foata normal form. 21/21192 useless extension candidates. Maximal degree in co-relation 46650. Up to 18017 conditions per place. [2023-08-04 02:22:58,748 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 79 selfloop transitions, 3 changer transitions 2/108 dead transitions. [2023-08-04 02:22:58,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 486 flow [2023-08-04 02:22:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:22:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:22:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-08-04 02:22:58,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627340823970037 [2023-08-04 02:22:58,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-08-04 02:22:58,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-08-04 02:22:58,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:22:58,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-08-04 02:22:58,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:58,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:58,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:58,753 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 234 flow. Second operand 4 states and 601 transitions. [2023-08-04 02:22:58,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 486 flow [2023-08-04 02:22:58,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 108 transitions, 482 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:22:58,862 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 238 flow [2023-08-04 02:22:58,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-08-04 02:22:58,863 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2023-08-04 02:22:58,863 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 238 flow [2023-08-04 02:22:58,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:22:58,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:22:58,864 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:58,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 02:22:59,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 02:22:59,068 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:22:59,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:22:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1033628783, now seen corresponding path program 1 times [2023-08-04 02:22:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:22:59,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563410483] [2023-08-04 02:22:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:22:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:22:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:22:59,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:22:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:22:59,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:22:59,203 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:22:59,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 02:22:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 02:22:59,204 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:59,204 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (2/2) [2023-08-04 02:22:59,205 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 02:22:59,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 02:22:59,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 02:22:59 BasicIcfg [2023-08-04 02:22:59,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 02:22:59,258 INFO L158 Benchmark]: Toolchain (without parser) took 36684.08ms. Allocated memory was 371.2MB in the beginning and 13.0GB in the end (delta: 12.7GB). Free memory was 315.3MB in the beginning and 11.0GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory is still 324.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.77ms. Allocated memory is still 371.2MB. Free memory was 315.0MB in the beginning and 303.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 371.2MB. Free memory was 303.5MB in the beginning and 301.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: Boogie Preprocessor took 19.68ms. Allocated memory is still 371.2MB. Free memory was 301.4MB in the beginning and 300.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: RCFGBuilder took 496.41ms. Allocated memory was 371.2MB in the beginning and 696.3MB in the end (delta: 325.1MB). Free memory was 299.7MB in the beginning and 657.1MB in the end (delta: -357.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. [2023-08-04 02:22:59,259 INFO L158 Benchmark]: TraceAbstraction took 35922.41ms. Allocated memory was 696.3MB in the beginning and 13.0GB in the end (delta: 12.3GB). Free memory was 656.7MB in the beginning and 11.0GB in the end (delta: -10.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-04 02:22:59,260 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.10ms. Allocated memory is still 371.2MB. Free memory is still 324.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 209.77ms. Allocated memory is still 371.2MB. Free memory was 315.0MB in the beginning and 303.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 371.2MB. Free memory was 303.5MB in the beginning and 301.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.68ms. Allocated memory is still 371.2MB. Free memory was 301.4MB in the beginning and 300.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 496.41ms. Allocated memory was 371.2MB in the beginning and 696.3MB in the end (delta: 325.1MB). Free memory was 299.7MB in the beginning and 657.1MB in the end (delta: -357.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. * TraceAbstraction took 35922.41ms. Allocated memory was 696.3MB in the beginning and 13.0GB in the end (delta: 12.3GB). Free memory was 656.7MB in the beginning and 11.0GB in the end (delta: -10.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 101 PlacesBefore, 32 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1903, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 448, independent conditional: 0, independent unconditional: 448, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1903, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 464, unknown conditional: 0, unknown unconditional: 464] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 129 PlacesBefore, 58 PlacesAfterwards, 122 TransitionsBefore, 49 TransitionsAfterwards, 3036 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 21511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3634, independent: 3120, independent conditional: 0, independent unconditional: 3120, dependent: 514, dependent conditional: 0, dependent unconditional: 514, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1103, independent: 1066, independent conditional: 0, independent unconditional: 1066, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3634, independent: 2054, independent conditional: 0, independent unconditional: 2054, dependent: 477, dependent conditional: 0, dependent unconditional: 477, unknown: 1103, unknown conditional: 0, unknown unconditional: 1103] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 151 PlacesBefore, 66 PlacesAfterwards, 156 TransitionsBefore, 65 TransitionsAfterwards, 5896 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 101 TotalNumberOfCompositions, 40246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14268, independent: 13703, independent conditional: 0, independent unconditional: 13703, dependent: 565, dependent conditional: 0, dependent unconditional: 565, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2577, independent: 2522, independent conditional: 0, independent unconditional: 2522, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14268, independent: 11181, independent conditional: 0, independent unconditional: 11181, dependent: 510, dependent conditional: 0, dependent unconditional: 510, unknown: 2577, unknown conditional: 0, unknown unconditional: 2577] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 668, Positive conditional cache size: 0, Positive unconditional cache size: 668, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 130]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, i, i1, i2; [L110] 0 pthread_t t1[2], t2[2]; [L113] 0 e1 = __VERIFIER_nondet_bool() [L114] 0 e2 = __VERIFIER_nondet_bool() [L115] 0 n1 = __VERIFIER_nondet_int() [L116] 0 n2 = __VERIFIER_nondet_int() [L117] 0 i = __VERIFIER_nondet_int() [L118] 0 i1 = __VERIFIER_nondet_int() [L119] 0 i2 = __VERIFIER_nondet_int() [L122] CALL 0 assume_abort_if_not( ( i == 0 ) && ( e1 == 0 ) && ( e2 == 0 ) && ( n1 == 0 ) && ( n2 == 0 ) ) [L35] COND FALSE 0 !(!cond) [L122] RET 0 assume_abort_if_not( ( i == 0 ) && ( e1 == 0 ) && ( e2 == 0 ) && ( n1 == 0 ) && ( n2 == 0 ) ) [L124] 0 int asdf=0; VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={5:0}, t2={3:0}] [L124] COND TRUE 0 asdf<2 [L124] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-4, t1={5:0}, t2={3:0}] [L43] 1 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0] [L46] 1 n1 = (n1 < n2) ? n2 : n1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0] [L49] 1 n1++ VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L52] 1 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L124] 0 asdf++ VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={5:0}, t2={3:0}] [L124] COND TRUE 0 asdf<2 [L124] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-3, t1={5:0}, t2={3:0}] [L43] 2 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L46] 2 n1 = (n1 < n2) ? n2 : n1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L49] 2 n1++ VAL [e1=1, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L52] 2 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L56] CALL 2 assume_abort_if_not(!e2) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(!e2) [L124] 0 asdf++ VAL [asdf=2, e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0, t1={5:0}, t2={3:0}] [L59] CALL 1 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L35] COND FALSE 1 !(!cond) [L59] RET 1 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L63] 1 i1 = i VAL [e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L66] 1 i = i1 + 1 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=2, n2=0] [L69] 1 n1 = 0 [L72] 1 return 0; [L124] COND FALSE 0 !(asdf<2) [L125] 0 int asdf=0; VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, t1={5:0}, t2={3:0}] [L125] COND TRUE 0 asdf<2 [L125] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, pthread_create(&t2[asdf], 0, thread2, 0)=-2, t1={5:0}, t2={3:0}] [L77] 3 e2 = 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0] [L80] 3 n2 = (n2 < n1) ? n1 : n2 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0] [L83] 3 n2++ VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=1] [L86] 3 e2 = 0 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=1] [L90] CALL 3 assume_abort_if_not(!e1) [L35] COND FALSE 3 !(!cond) [L90] RET 3 assume_abort_if_not(!e1) [L59] CALL 2 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L35] COND FALSE 2 !(!cond) [L59] RET 2 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L63] 2 i1 = i VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=1, n1=0, n2=1] [L66] 2 i = i1 + 1 VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1] [L69] 2 n1 = 0 [L72] 2 return 0; [L125] 0 asdf++ VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={5:0}, t2={3:0}] [L125] COND TRUE 0 asdf<2 [L125] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, pthread_create(&t2[asdf], 0, thread2, 0)=-1, t1={5:0}, t2={3:0}] [L77] 4 e2 = 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1] [L80] 4 n2 = (n2 < n1) ? n1 : n2 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1] [L83] 4 n2++ VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=2] [L86] 4 e2 = 0 VAL [e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=2] [L90] CALL 4 assume_abort_if_not(!e1) [L35] COND FALSE 4 !(!cond) [L90] RET 4 assume_abort_if_not(!e1) [L125] 0 asdf++ VAL [asdf=2, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=2, t1={5:0}, t2={3:0}] [L93] CALL 3 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L35] COND FALSE 3 !(!cond) [L93] RET 3 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L97] 3 i2 = i VAL [e1=0, e2=0, i=1, i=2, i=2, n1=0, n2=2] [L100] 3 i = i2 + 1 VAL [e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=2] [L103] 3 n2 = 0 [L106] 3 return 0; [L125] COND FALSE 0 !(asdf<2) [L126] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={5:0}, t2={3:0}] [L126] COND TRUE 0 asdf<2 [L126] 0 t1[asdf] VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={5:0}, t1[asdf]=-4, t2={3:0}] [L93] CALL 4 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L35] COND FALSE 4 !(!cond) [L93] RET 4 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L97] 4 i2 = i VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=3, n1=0, n2=0] [L100] 4 i = i2 + 1 VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0] [L103] 4 n2 = 0 [L106] 4 return 0; [L126] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-4, t2={3:0}] [L126] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] [L126] COND TRUE 0 asdf<2 [L126] 0 t1[asdf] VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-3, t2={3:0}] [L126] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-3, t2={3:0}] [L126] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] [L126] COND FALSE 0 !(asdf<2) [L127] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] [L127] COND TRUE 0 asdf<2 [L127] 0 t2[asdf] VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-2] [L127] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-2] [L127] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] [L127] COND TRUE 0 asdf<2 [L127] 0 t2[asdf] VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-1] [L127] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-1] [L127] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] [L127] COND FALSE 0 !(asdf<2) [L129] CALL 0 assume_abort_if_not( i != 2 ) [L35] COND FALSE 0 !(!cond) [L129] RET 0 assume_abort_if_not( i != 2 ) [L130] 0 reach_error() VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 153 locations, 3 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: 3.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 177 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 8 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 177 locations, 3 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: 26.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1004 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 25 mSDtfsCounter, 1004 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 28, 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.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 132/147 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-04 02:22:59,279 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...