/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix016_pso.opt_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:09:48,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:09:48,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:09:48,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:09:48,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:09:48,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:09:48,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:09:48,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:09:48,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:09:48,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:09:48,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:09:48,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:09:48,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:09:48,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:09:48,645 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:09:48,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:09:48,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:09:48,646 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:09:48,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:09:48,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:09:48,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:09:48,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:09:48,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:09:48,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:09:48,648 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:09:48,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:09:48,649 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:09:48,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:09:48,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:09:48,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:09:48,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:09:48,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:09:48,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:09:48,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:09:48,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:09:48,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:09:48,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:09:48,652 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:09:48,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:09:48,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:09:48,656 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:09:48,657 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 -> TOGETHER [2023-08-03 17:09:48,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:09:48,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:09:48,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:09:48,897 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:09:48,897 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:09:48,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix016_pso.opt_tso.opt_bound2.i [2023-08-03 17:09:49,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:09:50,229 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:09:50,230 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix016_pso.opt_tso.opt_bound2.i [2023-08-03 17:09:50,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241959455/c8cc1d3820724d9391e14562f15f9ff0/FLAGa17eb947b [2023-08-03 17:09:50,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241959455/c8cc1d3820724d9391e14562f15f9ff0 [2023-08-03 17:09:50,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:09:50,264 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:09:50,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:09:50,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:09:50,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:09:50,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d223076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50, skipping insertion in model container [2023-08-03 17:09:50,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:09:50,469 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix016_pso.opt_tso.opt_bound2.i[956,969] [2023-08-03 17:09:50,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:09:50,690 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:09:50,701 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix016_pso.opt_tso.opt_bound2.i[956,969] [2023-08-03 17:09:50,718 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:09:50,719 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:09:50,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:09:50,788 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:09:50,788 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:09:50,794 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:09:50,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50 WrapperNode [2023-08-03 17:09:50,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:09:50,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:09:50,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:09:50,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:09:50,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,865 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2023-08-03 17:09:50,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:09:50,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:09:50,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:09:50,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:09:50,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:09:50,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:09:50,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:09:50,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:09:50,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (1/1) ... [2023-08-03 17:09:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:09:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:09:50,950 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-03 17:09:50,966 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-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:09:50,983 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:09:51,092 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:09:51,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:09:51,416 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:09:51,521 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:09:51,521 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:09:51,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:09:51 BoogieIcfgContainer [2023-08-03 17:09:51,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:09:51,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:09:51,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:09:51,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:09:51,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:09:50" (1/3) ... [2023-08-03 17:09:51,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66324c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:09:51, skipping insertion in model container [2023-08-03 17:09:51,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:09:50" (2/3) ... [2023-08-03 17:09:51,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66324c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:09:51, skipping insertion in model container [2023-08-03 17:09:51,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:09:51" (3/3) ... [2023-08-03 17:09:51,530 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix016_pso.opt_tso.opt_bound2.i [2023-08-03 17:09:51,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:09:51,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:09:51,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:09:51,545 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:09:51,588 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:09:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,738 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-03 17:09:51,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:09:51,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1999 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-03 17:09:51,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,757 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:09:51,765 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,767 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 130 transitions, 275 flow [2023-08-03 17:09:51,839 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-03 17:09:51,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:09:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1999 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-03 17:09:51,848 INFO L119 LiptonReduction]: Number of co-enabled transitions 2466 [2023-08-03 17:09:55,145 INFO L134 LiptonReduction]: Checked pairs total: 5509 [2023-08-03 17:09:55,145 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-03 17:09:55,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:09:55,164 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;@10319fc1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:09:55,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:09:55,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:09:55,200 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-03 17:09:55,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:09:55,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:09:55,201 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:09:55,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:09:55,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:09:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash 29693927, now seen corresponding path program 1 times [2023-08-03 17:09:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:09:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818259610] [2023-08-03 17:09:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:09:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:09:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:55,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:09:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:55,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:09:55,392 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:09:55,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:09:55,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:09:55,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:09:55,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:09:55,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:09:55,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:09:55,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:09:55,396 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 17:09:55,408 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:09:55,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:09:55,441 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:09:55,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,629 INFO L124 PetriNetUnfolderBase]: 93/1405 cut-off events. [2023-08-03 17:09:55,630 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:09:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1405 events. 93/1405 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9708 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-03 17:09:55,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,642 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:09:55,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,643 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 344 flow [2023-08-03 17:09:55,777 INFO L124 PetriNetUnfolderBase]: 93/1405 cut-off events. [2023-08-03 17:09:55,777 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:09:55,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1405 events. 93/1405 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9708 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-03 17:09:55,807 INFO L119 LiptonReduction]: Number of co-enabled transitions 5928 [2023-08-03 17:09:58,894 INFO L134 LiptonReduction]: Checked pairs total: 16990 [2023-08-03 17:09:58,895 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-03 17:09:58,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:09:58,897 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;@10319fc1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:09:58,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:09:58,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:09:58,900 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-03 17:09:58,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:09:58,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:09:58,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 17:09:58,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:09:58,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:09:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 209201502, now seen corresponding path program 1 times [2023-08-03 17:09:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:09:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717637122] [2023-08-03 17:09:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:09:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:09:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:09:59,003 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-03 17:09:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:09:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717637122] [2023-08-03 17:09:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717637122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:09:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:09:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:09:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076832041] [2023-08-03 17:09:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:09:59,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:09:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:09:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:09:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:09:59,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-03 17:09:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:09:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-03 17:09:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:10:31,970 INFO L124 PetriNetUnfolderBase]: 292934/379860 cut-off events. [2023-08-03 17:10:31,970 INFO L125 PetriNetUnfolderBase]: For 5316/5316 co-relation queries the response was YES. [2023-08-03 17:10:32,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755585 conditions, 379860 events. 292934/379860 cut-off events. For 5316/5316 co-relation queries the response was YES. Maximal size of possible extension queue 9831. Compared 2508117 event pairs, 242016 based on Foata normal form. 0/332702 useless extension candidates. Maximal degree in co-relation 217910. Up to 369312 conditions per place. [2023-08-03 17:10:34,390 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 41 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-03 17:10:34,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 228 flow [2023-08-03 17:10:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:10:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:10:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-03 17:10:34,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2023-08-03 17:10:34,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-03 17:10:34,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-03 17:10:34,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:10:34,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-03 17:10:34,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:10:34,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:10:34,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:10:34,419 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 136 flow. Second operand 3 states and 426 transitions. [2023-08-03 17:10:34,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 228 flow [2023-08-03 17:10:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 222 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:10:34,436 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 140 flow [2023-08-03 17:10:34,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=140, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-08-03 17:10:34,443 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-03 17:10:34,444 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 140 flow [2023-08-03 17:10:34,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:10:34,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:10:34,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:10:34,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:10:34,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:10:34,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:10:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1287596635, now seen corresponding path program 1 times [2023-08-03 17:10:34,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:10:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984685900] [2023-08-03 17:10:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:10:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:10:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:10:34,570 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-03 17:10:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:10:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984685900] [2023-08-03 17:10:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984685900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:10:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313878234] [2023-08-03 17:10:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:10:34,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:10:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:10:34,574 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-03 17:10:34,575 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-03 17:10:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:10:34,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 17:10:34,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:10:34,706 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-03 17:10:34,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:10:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313878234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:10:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:10:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 17:10:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809054733] [2023-08-03 17:10:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:10:34,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:10:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:10:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:10:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:10:34,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-03 17:10:34,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:10:34,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:10:34,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-03 17:10:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:11:04,397 INFO L124 PetriNetUnfolderBase]: 283694/370535 cut-off events. [2023-08-03 17:11:04,397 INFO L125 PetriNetUnfolderBase]: For 4347/4347 co-relation queries the response was YES. [2023-08-03 17:11:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733279 conditions, 370535 events. 283694/370535 cut-off events. For 4347/4347 co-relation queries the response was YES. Maximal size of possible extension queue 10124. Compared 2493489 event pairs, 229106 based on Foata normal form. 0/327238 useless extension candidates. Maximal degree in co-relation 733242. Up to 356321 conditions per place. [2023-08-03 17:11:06,794 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 47 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 17:11:06,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 256 flow [2023-08-03 17:11:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:11:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:11:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-03 17:11:06,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525030525030525 [2023-08-03 17:11:06,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-03 17:11:06,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-03 17:11:06,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:11:06,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-03 17:11:06,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:06,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:06,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:06,804 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 140 flow. Second operand 3 states and 430 transitions. [2023-08-03 17:11:06,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 256 flow [2023-08-03 17:11:06,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:11:06,806 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 150 flow [2023-08-03 17:11:06,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-03 17:11:06,807 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-08-03 17:11:06,807 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 150 flow [2023-08-03 17:11:06,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:06,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:11:06,808 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:11:06,824 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-03 17:11:07,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:11:07,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:11:07,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:11:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1438297403, now seen corresponding path program 1 times [2023-08-03 17:11:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:11:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12325011] [2023-08-03 17:11:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:11:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:11:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:11:07,100 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-03 17:11:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:11:07,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12325011] [2023-08-03 17:11:07,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12325011] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:11:07,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827487672] [2023-08-03 17:11:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:11:07,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:11:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:11:07,102 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-03 17:11:07,105 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-03 17:11:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:11:07,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:11:07,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:11:07,216 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-03 17:11:07,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:11:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827487672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:11:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:11:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:11:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050057687] [2023-08-03 17:11:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:11:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:11:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:11:07,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:11:07,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:11:07,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-03 17:11:07,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:07,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:11:07,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-03 17:11:07,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:11:37,730 INFO L124 PetriNetUnfolderBase]: 283682/370875 cut-off events. [2023-08-03 17:11:37,732 INFO L125 PetriNetUnfolderBase]: For 4743/4743 co-relation queries the response was YES. [2023-08-03 17:11:39,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734133 conditions, 370875 events. 283682/370875 cut-off events. For 4743/4743 co-relation queries the response was YES. Maximal size of possible extension queue 10061. Compared 2500826 event pairs, 198792 based on Foata normal form. 9/328067 useless extension candidates. Maximal degree in co-relation 212362. Up to 356425 conditions per place. [2023-08-03 17:11:40,946 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-03 17:11:40,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 265 flow [2023-08-03 17:11:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:11:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:11:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-03 17:11:40,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2023-08-03 17:11:40,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-03 17:11:40,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-03 17:11:40,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:11:40,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-03 17:11:40,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:40,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:40,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:40,954 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 150 flow. Second operand 5 states and 679 transitions. [2023-08-03 17:11:40,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 265 flow [2023-08-03 17:11:40,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 17:11:40,961 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 166 flow [2023-08-03 17:11:40,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-03 17:11:40,964 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2023-08-03 17:11:40,965 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 166 flow [2023-08-03 17:11:40,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:40,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:11:40,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:11:40,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:11:41,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-03 17:11:41,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:11:41,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:11:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash -161936574, now seen corresponding path program 1 times [2023-08-03 17:11:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:11:41,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733686984] [2023-08-03 17:11:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:11:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:11:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:11:41,283 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-03 17:11:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:11:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733686984] [2023-08-03 17:11:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733686984] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:11:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480428571] [2023-08-03 17:11:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:11:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:11:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:11:41,286 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-03 17:11:41,288 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-03 17:11:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:11:41,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:11:41,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:11:41,424 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-03 17:11:41,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:11:41,452 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-03 17:11:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480428571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:11:41,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:11:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:11:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872484500] [2023-08-03 17:11:41,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:11:41,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:11:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:11:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:11:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:11:41,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-03 17:11:41,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:11:41,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:11:41,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-03 17:11:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:12:04,326 INFO L124 PetriNetUnfolderBase]: 221860/287264 cut-off events. [2023-08-03 17:12:04,326 INFO L125 PetriNetUnfolderBase]: For 3612/3612 co-relation queries the response was YES. [2023-08-03 17:12:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568822 conditions, 287264 events. 221860/287264 cut-off events. For 3612/3612 co-relation queries the response was YES. Maximal size of possible extension queue 8374. Compared 1852907 event pairs, 149094 based on Foata normal form. 3/255154 useless extension candidates. Maximal degree in co-relation 201712. Up to 276418 conditions per place. [2023-08-03 17:12:06,243 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-03 17:12:06,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 57 transitions, 268 flow [2023-08-03 17:12:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:12:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:12:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2023-08-03 17:12:06,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2023-08-03 17:12:06,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2023-08-03 17:12:06,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2023-08-03 17:12:06,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:12:06,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2023-08-03 17:12:06,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:06,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:06,248 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:06,248 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 166 flow. Second operand 4 states and 552 transitions. [2023-08-03 17:12:06,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 57 transitions, 268 flow [2023-08-03 17:12:06,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 57 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 17:12:06,251 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 157 flow [2023-08-03 17:12:06,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-08-03 17:12:06,252 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-08-03 17:12:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 157 flow [2023-08-03 17:12:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:06,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:12:06,253 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:12:06,261 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-03 17:12:06,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:12:06,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:12:06,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:12:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1986143720, now seen corresponding path program 1 times [2023-08-03 17:12:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:12:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594817538] [2023-08-03 17:12:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:12:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:12:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:12:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:12:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:12:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594817538] [2023-08-03 17:12:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594817538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:12:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744353496] [2023-08-03 17:12:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:12:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:12:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:12:06,542 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-03 17:12:06,549 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-03 17:12:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:12:06,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:12:06,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:12:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:12:06,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:12:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:12:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744353496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:12:06,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:12:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:12:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68463191] [2023-08-03 17:12:06,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:12:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:12:06,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:12:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:12:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:12:06,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-03 17:12:06,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:06,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:12:06,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-03 17:12:06,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:12:25,324 INFO L124 PetriNetUnfolderBase]: 184240/236761 cut-off events. [2023-08-03 17:12:25,324 INFO L125 PetriNetUnfolderBase]: For 2635/2635 co-relation queries the response was YES. [2023-08-03 17:12:26,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468966 conditions, 236761 events. 184240/236761 cut-off events. For 2635/2635 co-relation queries the response was YES. Maximal size of possible extension queue 7541. Compared 1472675 event pairs, 118402 based on Foata normal form. 36/211020 useless extension candidates. Maximal degree in co-relation 166025. Up to 226684 conditions per place. [2023-08-03 17:12:26,764 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 56 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-03 17:12:26,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 315 flow [2023-08-03 17:12:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:12:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:12:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2023-08-03 17:12:26,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2023-08-03 17:12:26,766 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2023-08-03 17:12:26,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2023-08-03 17:12:26,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:12:26,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2023-08-03 17:12:26,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:26,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:26,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:26,769 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 157 flow. Second operand 4 states and 564 transitions. [2023-08-03 17:12:26,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 315 flow [2023-08-03 17:12:26,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 309 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:12:26,771 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 171 flow [2023-08-03 17:12:26,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-03 17:12:26,772 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-03 17:12:26,772 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 171 flow [2023-08-03 17:12:26,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:26,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:12:26,773 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:12:26,777 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-03 17:12:26,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:12:26,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:12:26,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:12:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2037444100, now seen corresponding path program 1 times [2023-08-03 17:12:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:12:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289479496] [2023-08-03 17:12:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:12:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:12:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:12:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:12:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:12:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289479496] [2023-08-03 17:12:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289479496] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:12:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833850356] [2023-08-03 17:12:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:12:27,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:12:27,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:12:27,063 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-03 17:12:27,064 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-03 17:12:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:12:27,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:12:27,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:12:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:12:27,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:12:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833850356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:12:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:12:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 17:12:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191644304] [2023-08-03 17:12:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:12:27,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:12:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:12:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:12:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:12:27,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-03 17:12:27,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:27,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:12:27,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-03 17:12:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:12:47,368 INFO L124 PetriNetUnfolderBase]: 183832/236173 cut-off events. [2023-08-03 17:12:47,369 INFO L125 PetriNetUnfolderBase]: For 3529/3529 co-relation queries the response was YES. [2023-08-03 17:12:48,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468309 conditions, 236173 events. 183832/236173 cut-off events. For 3529/3529 co-relation queries the response was YES. Maximal size of possible extension queue 7541. Compared 1468130 event pairs, 60502 based on Foata normal form. 144/210540 useless extension candidates. Maximal degree in co-relation 165775. Up to 226632 conditions per place. [2023-08-03 17:12:48,788 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 60 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-03 17:12:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 333 flow [2023-08-03 17:12:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:12:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:12:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-03 17:12:48,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2023-08-03 17:12:48,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-03 17:12:48,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-03 17:12:48,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:12:48,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-03 17:12:48,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:48,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:48,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:48,795 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 171 flow. Second operand 5 states and 693 transitions. [2023-08-03 17:12:48,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 333 flow [2023-08-03 17:12:48,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 326 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:12:48,799 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 160 flow [2023-08-03 17:12:48,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=5, PETRI_FLOW=160, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2023-08-03 17:12:48,800 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-03 17:12:48,800 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 160 flow [2023-08-03 17:12:48,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:12:48,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:12:48,801 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:12:48,809 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-03 17:12:49,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:12:49,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:12:49,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:12:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash -521618106, now seen corresponding path program 1 times [2023-08-03 17:12:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:12:49,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259384515] [2023-08-03 17:12:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:12:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:12:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:12:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:12:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:12:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259384515] [2023-08-03 17:12:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259384515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:12:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:12:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:12:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873598160] [2023-08-03 17:12:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:12:49,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:12:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:12:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:12:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:12:49,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 273 [2023-08-03 17:12:49,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 160 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-03 17:12:49,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:12:49,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 273 [2023-08-03 17:12:49,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:13:05,426 INFO L124 PetriNetUnfolderBase]: 165784/212653 cut-off events. [2023-08-03 17:13:05,426 INFO L125 PetriNetUnfolderBase]: For 3439/3439 co-relation queries the response was YES. [2023-08-03 17:13:06,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421592 conditions, 212653 events. 165784/212653 cut-off events. For 3439/3439 co-relation queries the response was YES. Maximal size of possible extension queue 6939. Compared 1302061 event pairs, 32008 based on Foata normal form. 0/192348 useless extension candidates. Maximal degree in co-relation 149307. Up to 192961 conditions per place. [2023-08-03 17:13:06,924 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 57 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2023-08-03 17:13:06,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 323 flow [2023-08-03 17:13:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:13:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:13:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-03 17:13:06,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-08-03 17:13:06,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-03 17:13:06,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-03 17:13:06,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:13:06,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-03 17:13:06,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:06,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:06,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:06,930 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 160 flow. Second operand 3 states and 450 transitions. [2023-08-03 17:13:06,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 323 flow [2023-08-03 17:13:06,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:13:06,933 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 176 flow [2023-08-03 17:13:06,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-03 17:13:06,934 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-03 17:13:06,934 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 176 flow [2023-08-03 17:13:06,934 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-03 17:13:06,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:06,934 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:13:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:13:06,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:13:06,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -521599141, now seen corresponding path program 1 times [2023-08-03 17:13:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074953755] [2023-08-03 17:13:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:13:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:13:06,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:13:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074953755] [2023-08-03 17:13:06,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074953755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:13:06,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:13:06,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:13:06,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89072399] [2023-08-03 17:13:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:13:06,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:13:06,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:13:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:13:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:13:06,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-03 17:13:06,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:06,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:13:06,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-03 17:13:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:13:24,394 INFO L124 PetriNetUnfolderBase]: 164152/210013 cut-off events. [2023-08-03 17:13:24,394 INFO L125 PetriNetUnfolderBase]: For 11221/11221 co-relation queries the response was YES. [2023-08-03 17:13:25,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439453 conditions, 210013 events. 164152/210013 cut-off events. For 11221/11221 co-relation queries the response was YES. Maximal size of possible extension queue 6954. Compared 1288234 event pairs, 134656 based on Foata normal form. 0/189852 useless extension candidates. Maximal degree in co-relation 155132. Up to 199324 conditions per place. [2023-08-03 17:13:25,975 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 57 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-03 17:13:25,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 329 flow [2023-08-03 17:13:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:13:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:13:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-03 17:13:25,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335775335775336 [2023-08-03 17:13:25,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-03 17:13:25,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-03 17:13:25,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:13:25,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-03 17:13:25,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:25,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:25,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:25,979 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 176 flow. Second operand 3 states and 437 transitions. [2023-08-03 17:13:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 329 flow [2023-08-03 17:13:26,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:13:26,015 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 185 flow [2023-08-03 17:13:26,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2023-08-03 17:13:26,016 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-08-03 17:13:26,016 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 185 flow [2023-08-03 17:13:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:26,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:26,016 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] [2023-08-03 17:13:26,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 17:13:26,017 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:13:26,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1876960554, now seen corresponding path program 1 times [2023-08-03 17:13:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942814999] [2023-08-03 17:13:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:13:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:13:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:13:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942814999] [2023-08-03 17:13:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942814999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:13:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823059369] [2023-08-03 17:13:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:13:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:13:26,086 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-03 17:13:26,089 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-03 17:13:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:13:26,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:13:26,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:13:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:13:26,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:13:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:13:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823059369] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:13:26,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:13:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:13:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451967370] [2023-08-03 17:13:26,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:13:26,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:13:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:13:26,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:13:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:13:26,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-03 17:13:26,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:26,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:13:26,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-03 17:13:26,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:13:42,345 INFO L124 PetriNetUnfolderBase]: 153688/193069 cut-off events. [2023-08-03 17:13:42,345 INFO L125 PetriNetUnfolderBase]: For 18601/18601 co-relation queries the response was YES. [2023-08-03 17:13:43,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416654 conditions, 193069 events. 153688/193069 cut-off events. For 18601/18601 co-relation queries the response was YES. Maximal size of possible extension queue 6523. Compared 1121587 event pairs, 73168 based on Foata normal form. 720/180540 useless extension candidates. Maximal degree in co-relation 146892. Up to 131356 conditions per place. [2023-08-03 17:13:43,633 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 78 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2023-08-03 17:13:43,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 439 flow [2023-08-03 17:13:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:13:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:13:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-08-03 17:13:43,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2023-08-03 17:13:43,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-08-03 17:13:43,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-08-03 17:13:43,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:13:43,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-08-03 17:13:43,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:43,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:43,639 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:43,639 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 185 flow. Second operand 4 states and 581 transitions. [2023-08-03 17:13:43,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 439 flow [2023-08-03 17:13:43,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:13:43,647 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 203 flow [2023-08-03 17:13:43,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2023-08-03 17:13:43,648 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2023-08-03 17:13:43,648 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 203 flow [2023-08-03 17:13:43,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:43,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:43,649 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:13:43,656 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-03 17:13:43,853 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-03 17:13:43,854 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:13:43,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1900963920, now seen corresponding path program 1 times [2023-08-03 17:13:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873912035] [2023-08-03 17:13:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:13:43,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:13:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:13:43,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:13:43,904 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:13:43,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:13:43,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 17:13:43,905 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:13:43,909 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:13:43,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:13:43,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:13:43 BasicIcfg [2023-08-03 17:13:43,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:13:43,989 INFO L158 Benchmark]: Toolchain (without parser) took 233725.07ms. Allocated memory was 364.9MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 308.9MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. [2023-08-03 17:13:43,989 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 310.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:13:43,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.29ms. Allocated memory is still 364.9MB. Free memory was 308.9MB in the beginning and 284.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 17:13:43,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.75ms. Allocated memory is still 364.9MB. Free memory was 284.6MB in the beginning and 281.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:13:43,990 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 364.9MB. Free memory was 281.8MB in the beginning and 279.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:13:43,990 INFO L158 Benchmark]: RCFGBuilder took 606.97ms. Allocated memory was 364.9MB in the beginning and 545.3MB in the end (delta: 180.4MB). Free memory was 279.7MB in the beginning and 484.7MB in the end (delta: -205.0MB). Peak memory consumption was 28.5MB. Max. memory is 16.0GB. [2023-08-03 17:13:43,990 INFO L158 Benchmark]: TraceAbstraction took 232463.20ms. Allocated memory was 545.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 484.7MB in the beginning and 9.5GB in the end (delta: -9.0GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. [2023-08-03 17:13:43,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 310.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 530.29ms. Allocated memory is still 364.9MB. Free memory was 308.9MB in the beginning and 284.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.75ms. Allocated memory is still 364.9MB. Free memory was 284.6MB in the beginning and 281.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 364.9MB. Free memory was 281.8MB in the beginning and 279.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 606.97ms. Allocated memory was 364.9MB in the beginning and 545.3MB in the end (delta: 180.4MB). Free memory was 279.7MB in the beginning and 484.7MB in the end (delta: -205.0MB). Peak memory consumption was 28.5MB. Max. memory is 16.0GB. * TraceAbstraction took 232463.20ms. Allocated memory was 545.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 484.7MB in the beginning and 9.5GB in the end (delta: -9.0GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 132 PlacesBefore, 38 PlacesAfterwards, 130 TransitionsBefore, 32 TransitionsAfterwards, 2466 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 5509 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2692, independent: 2547, independent conditional: 0, independent unconditional: 2547, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1343, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2692, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 1343, unknown conditional: 0, unknown unconditional: 1343] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 162 PlacesBefore, 62 PlacesAfterwards, 154 TransitionsBefore, 50 TransitionsAfterwards, 5928 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 16990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6883, independent: 6589, independent conditional: 0, independent unconditional: 6589, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3034, independent: 2959, independent conditional: 0, independent unconditional: 2959, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6883, independent: 3630, independent conditional: 0, independent unconditional: 3630, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 3034, unknown conditional: 0, unknown unconditional: 3034] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418[2]; [L844] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t418[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418[asdf], ((void *)0), P0, ((void *)0))=-5, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t418[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418[asdf], ((void *)0), P0, ((void *)0))=-4, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND FALSE 0 !(asdf<2) [L845] 0 pthread_t t419[2]; [L846] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t419[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419[asdf], ((void *)0), P1, ((void *)0))=-3, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t419[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419[asdf], ((void *)0), P1, ((void *)0))=-2, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] COND FALSE 0 !(asdf<2) [L847] 0 pthread_t t420[2]; [L848] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] COND TRUE 0 asdf<2 [L848] FCALL, FORK 0 pthread_create(&t420[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420[asdf], ((void *)0), P2, ((void *)0))=-1, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 5 y$w_buff1 = y$w_buff0 [L791] 5 y$w_buff0 = 1 [L792] 5 y$w_buff1_used = y$w_buff0_used [L793] 5 y$w_buff0_used = (_Bool)1 [L794] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L794] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] COND TRUE 0 asdf<2 [L848] FCALL, FORK 0 pthread_create(&t420[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420[asdf], ((void *)0), P2, ((void *)0))=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 6 y$w_buff1 = y$w_buff0 [L791] 6 y$w_buff0 = 1 [L792] 6 y$w_buff1_used = y$w_buff0_used [L793] 6 y$w_buff0_used = (_Bool)1 [L794] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 228.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 222.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 22 mSDtfsCounter, 1000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=9, InterpolantAutomatonStates: 34, 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.9s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1138 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 116/136 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-03 17:13:44,021 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...