/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi003_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:21:43,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:21:43,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:21:43,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:21:43,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:21:43,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:21:43,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:21:43,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:21:43,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:21:43,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:21:43,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:21:43,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:21:43,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:21:43,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:21:43,860 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:21:43,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:21:43,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:21:43,860 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:21:43,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:21:43,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:21:43,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:21:43,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:21:43,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:21:43,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:21:43,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:21:43,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:21:43,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:21:43,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:21:43,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:21:43,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:21:43,865 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:21:43,865 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 -> PROGRAM_FIRST [2023-08-04 06:21:44,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:21:44,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:21:44,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:21:44,064 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:21:44,065 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:21:44,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi003_tso_bound2.i [2023-08-04 06:21:45,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:21:45,357 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:21:45,358 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi003_tso_bound2.i [2023-08-04 06:21:45,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dc3e3d4/27e9ced551de4fff954bdf2d0d3157e5/FLAG9ce359b0f [2023-08-04 06:21:45,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dc3e3d4/27e9ced551de4fff954bdf2d0d3157e5 [2023-08-04 06:21:45,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:21:45,387 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:21:45,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:21:45,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:21:45,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:21:45,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231a7414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45, skipping insertion in model container [2023-08-04 06:21:45,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:21:45,553 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_rfi003_tso_bound2.i[944,957] [2023-08-04 06:21:45,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:21:45,747 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:21:45,759 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_rfi003_tso_bound2.i[944,957] [2023-08-04 06:21:45,764 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:21:45,765 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:21:45,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:21:45,810 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:21:45,810 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:21:45,814 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:21:45,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45 WrapperNode [2023-08-04 06:21:45,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:21:45,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:21:45,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:21:45,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:21:45,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,858 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2023-08-04 06:21:45,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:21:45,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:21:45,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:21:45,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:21:45,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:21:45,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:21:45,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:21:45,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:21:45,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (1/1) ... [2023-08-04 06:21:45,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:21:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:45,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 06:21:45,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:21:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:21:45,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:21:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:21:45,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:21:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:21:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:21:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:21:45,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:21:45,975 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 06:21:46,148 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:21:46,151 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:21:46,464 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:21:46,637 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:21:46,638 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 06:21:46,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:21:46 BoogieIcfgContainer [2023-08-04 06:21:46,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:21:46,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:21:46,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:21:46,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:21:46,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:21:45" (1/3) ... [2023-08-04 06:21:46,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:21:46, skipping insertion in model container [2023-08-04 06:21:46,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:45" (2/3) ... [2023-08-04 06:21:46,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:21:46, skipping insertion in model container [2023-08-04 06:21:46,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:21:46" (3/3) ... [2023-08-04 06:21:46,650 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi003_tso_bound2.i [2023-08-04 06:21:46,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:21:46,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:21:46,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:21:46,665 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:21:46,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:21:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 106 transitions, 222 flow [2023-08-04 06:21:46,833 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-04 06:21:46,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:46,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 638 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 06:21:46,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 106 transitions, 222 flow [2023-08-04 06:21:46,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 105 transitions, 218 flow [2023-08-04 06:21:46,846 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:46,857 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 105 transitions, 218 flow [2023-08-04 06:21:46,860 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 105 transitions, 218 flow [2023-08-04 06:21:46,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 218 flow [2023-08-04 06:21:46,901 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-04 06:21:46,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:46,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 631 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 06:21:46,904 INFO L119 LiptonReduction]: Number of co-enabled transitions 1716 [2023-08-04 06:21:50,021 INFO L134 LiptonReduction]: Checked pairs total: 4822 [2023-08-04 06:21:50,021 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-04 06:21:50,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:21:50,036 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;@21d938f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:50,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:21:50,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:50,041 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 06:21:50,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:50,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:50,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:50,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:21:50,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash 524163982, now seen corresponding path program 1 times [2023-08-04 06:21:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182765600] [2023-08-04 06:21:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182765600] [2023-08-04 06:21:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182765600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:50,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:50,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214147755] [2023-08-04 06:21:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:50,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 196 [2023-08-04 06:21:50,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:50,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 196 [2023-08-04 06:21:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:50,531 INFO L124 PetriNetUnfolderBase]: 466/804 cut-off events. [2023-08-04 06:21:50,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 804 events. 466/804 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3562 event pairs, 210 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 1611. Up to 787 conditions per place. [2023-08-04 06:21:50,541 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 25 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2023-08-04 06:21:50,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2023-08-04 06:21:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-04 06:21:50,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-08-04 06:21:50,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-04 06:21:50,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-04 06:21:50,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:50,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-04 06:21:50,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,573 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 58 flow. Second operand 3 states and 287 transitions. [2023-08-04 06:21:50,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2023-08-04 06:21:50,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:21:50,577 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 66 flow [2023-08-04 06:21:50,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-04 06:21:50,581 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 06:21:50,582 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 66 flow [2023-08-04 06:21:50,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:50,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:50,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:21:50,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:21:50,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1307943002, now seen corresponding path program 1 times [2023-08-04 06:21:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:50,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414560743] [2023-08-04 06:21:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414560743] [2023-08-04 06:21:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414560743] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:21:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760595659] [2023-08-04 06:21:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:50,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:50,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:50,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:21:50,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:21:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:50,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:21:50,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:21:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:21:50,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:21:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760595659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:50,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:21:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:21:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637235349] [2023-08-04 06:21:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:50,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:21:50,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 196 [2023-08-04 06:21:50,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:50,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 196 [2023-08-04 06:21:50,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:50,983 INFO L124 PetriNetUnfolderBase]: 450/800 cut-off events. [2023-08-04 06:21:50,984 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:21:50,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 800 events. 450/800 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3838 event pairs, 200 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 1616. Up to 668 conditions per place. [2023-08-04 06:21:50,987 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 33 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-04 06:21:50,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 160 flow [2023-08-04 06:21:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-04 06:21:50,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 06:21:50,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-04 06:21:50,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-04 06:21:50,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:50,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-04 06:21:50,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:50,999 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 66 flow. Second operand 3 states and 294 transitions. [2023-08-04 06:21:50,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 160 flow [2023-08-04 06:21:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:21:51,000 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 70 flow [2023-08-04 06:21:51,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-04 06:21:51,001 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-04 06:21:51,001 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 70 flow [2023-08-04 06:21:51,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:51,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:51,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:21:51,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:51,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:21:51,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1891933792, now seen corresponding path program 1 times [2023-08-04 06:21:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115573993] [2023-08-04 06:21:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115573993] [2023-08-04 06:21:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115573993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:21:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178987196] [2023-08-04 06:21:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:51,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:21:51,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:21:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:51,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:21:51,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:21:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:51,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:21:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178987196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:21:51,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:21:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:21:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349082289] [2023-08-04 06:21:51,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:21:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:21:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:21:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:21:51,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2023-08-04 06:21:51,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:51,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2023-08-04 06:21:51,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:51,398 INFO L124 PetriNetUnfolderBase]: 8/26 cut-off events. [2023-08-04 06:21:51,398 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-04 06:21:51,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 26 events. 8/26 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 2 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 58. Up to 18 conditions per place. [2023-08-04 06:21:51,399 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-04 06:21:51,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 14 transitions, 59 flow [2023-08-04 06:21:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:21:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:21:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2023-08-04 06:21:51,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153061224489793 [2023-08-04 06:21:51,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2023-08-04 06:21:51,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2023-08-04 06:21:51,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:51,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2023-08-04 06:21:51,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,402 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,402 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 70 flow. Second operand 4 states and 354 transitions. [2023-08-04 06:21:51,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 14 transitions, 59 flow [2023-08-04 06:21:51,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:21:51,403 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 06:21:51,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 06:21:51,404 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -12 predicate places. [2023-08-04 06:21:51,404 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 06:21:51,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:51,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:21:51,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:21:51,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:21:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 06:21:51,611 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,SelfDestructingSolverStorable2 [2023-08-04 06:21:51,612 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:21:51,613 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:21:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 106 transitions, 222 flow [2023-08-04 06:21:51,629 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-04 06:21:51,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:51,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 638 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 06:21:51,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 106 transitions, 222 flow [2023-08-04 06:21:51,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 79 transitions, 168 flow [2023-08-04 06:21:51,630 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:51,630 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 79 transitions, 168 flow [2023-08-04 06:21:51,630 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 168 flow [2023-08-04 06:21:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 168 flow [2023-08-04 06:21:51,635 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-08-04 06:21:51,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:51,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-04 06:21:51,636 INFO L119 LiptonReduction]: Number of co-enabled transitions 760 [2023-08-04 06:21:53,460 INFO L134 LiptonReduction]: Checked pairs total: 2382 [2023-08-04 06:21:53,460 INFO L136 LiptonReduction]: Total number of compositions: 62 [2023-08-04 06:21:53,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:21:53,462 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;@21d938f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:53,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:21:53,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:53,464 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:21:53,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:53,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:53,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:53,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:21:53,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 583709597, now seen corresponding path program 1 times [2023-08-04 06:21:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770965484] [2023-08-04 06:21:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:21:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:53,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770965484] [2023-08-04 06:21:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770965484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:53,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:53,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023709124] [2023-08-04 06:21:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:53,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:53,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:53,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 168 [2023-08-04 06:21:53,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:53,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:53,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 168 [2023-08-04 06:21:53,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:53,645 INFO L124 PetriNetUnfolderBase]: 111/229 cut-off events. [2023-08-04 06:21:53,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:53,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 229 events. 111/229 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 850 event pairs, 35 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 451. Up to 207 conditions per place. [2023-08-04 06:21:53,646 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 21 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-04 06:21:53,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 108 flow [2023-08-04 06:21:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-04 06:21:53,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2023-08-04 06:21:53,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-04 06:21:53,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-04 06:21:53,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:53,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-04 06:21:53,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:53,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:53,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:53,659 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 52 flow. Second operand 3 states and 282 transitions. [2023-08-04 06:21:53,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 108 flow [2023-08-04 06:21:53,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:21:53,660 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 60 flow [2023-08-04 06:21:53,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-04 06:21:53,661 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-08-04 06:21:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 60 flow [2023-08-04 06:21:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:53,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:53,661 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:21:53,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:21:53,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:21:53,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 913220855, now seen corresponding path program 1 times [2023-08-04 06:21:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155730593] [2023-08-04 06:21:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:53,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:21:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:53,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:21:53,695 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:21:53,696 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:21:53,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:21:53,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:21:53,696 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:21:53,696 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:21:53,697 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:21:53,697 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:21:53,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:21:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 276 flow [2023-08-04 06:21:53,761 INFO L124 PetriNetUnfolderBase]: 30/466 cut-off events. [2023-08-04 06:21:53,761 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:21:53,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 466 events. 30/466 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2011 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-04 06:21:53,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 126 transitions, 276 flow [2023-08-04 06:21:53,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 125 transitions, 270 flow [2023-08-04 06:21:53,763 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:53,763 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 125 transitions, 270 flow [2023-08-04 06:21:53,763 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 125 transitions, 270 flow [2023-08-04 06:21:53,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 125 transitions, 270 flow [2023-08-04 06:21:53,793 INFO L124 PetriNetUnfolderBase]: 30/465 cut-off events. [2023-08-04 06:21:53,793 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:21:53,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 465 events. 30/465 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1997 event pairs, 0 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 333. Up to 18 conditions per place. [2023-08-04 06:21:53,798 INFO L119 LiptonReduction]: Number of co-enabled transitions 4148 [2023-08-04 06:21:56,441 INFO L134 LiptonReduction]: Checked pairs total: 14305 [2023-08-04 06:21:56,441 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 06:21:56,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:21:56,443 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;@21d938f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:56,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:21:56,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:56,445 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 06:21:56,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:56,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:56,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:56,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:21:56,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash 814272668, now seen corresponding path program 1 times [2023-08-04 06:21:56,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:56,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974084842] [2023-08-04 06:21:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:56,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974084842] [2023-08-04 06:21:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974084842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975764208] [2023-08-04 06:21:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:56,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:56,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-04 06:21:56,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:56,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:56,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-04 06:21:56,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:02,545 INFO L124 PetriNetUnfolderBase]: 45648/61422 cut-off events. [2023-08-04 06:22:02,545 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2023-08-04 06:22:02,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123565 conditions, 61422 events. 45648/61422 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 363504 event pairs, 33340 based on Foata normal form. 0/53376 useless extension candidates. Maximal degree in co-relation 22300. Up to 61034 conditions per place. [2023-08-04 06:22:02,843 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 06:22:02,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 198 flow [2023-08-04 06:22:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-04 06:22:02,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2023-08-04 06:22:02,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-04 06:22:02,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-04 06:22:02,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:02,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-04 06:22:02,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:02,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:02,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:02,847 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 102 flow. Second operand 3 states and 334 transitions. [2023-08-04 06:22:02,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 198 flow [2023-08-04 06:22:02,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 196 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:22:02,852 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 112 flow [2023-08-04 06:22:02,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-04 06:22:02,854 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-04 06:22:02,854 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 112 flow [2023-08-04 06:22:02,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:02,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:02,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:02,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:22:02,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:02,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -433570368, now seen corresponding path program 1 times [2023-08-04 06:22:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490040290] [2023-08-04 06:22:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490040290] [2023-08-04 06:22:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490040290] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398534984] [2023-08-04 06:22:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:02,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:02,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:22:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:02,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:22:02,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:22:02,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:22:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398534984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:22:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:22:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355832494] [2023-08-04 06:22:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:02,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:02,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:22:02,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-04 06:22:02,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:02,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:02,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-04 06:22:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:08,787 INFO L124 PetriNetUnfolderBase]: 45472/61317 cut-off events. [2023-08-04 06:22:08,787 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2023-08-04 06:22:08,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123172 conditions, 61317 events. 45472/61317 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 364794 event pairs, 32012 based on Foata normal form. 0/53396 useless extension candidates. Maximal degree in co-relation 123125. Up to 60005 conditions per place. [2023-08-04 06:22:09,089 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 52 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 06:22:09,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 254 flow [2023-08-04 06:22:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 06:22:09,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2023-08-04 06:22:09,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 06:22:09,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 06:22:09,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:09,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 06:22:09,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:09,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:09,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:09,094 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 112 flow. Second operand 3 states and 345 transitions. [2023-08-04 06:22:09,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 254 flow [2023-08-04 06:22:09,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:09,097 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 122 flow [2023-08-04 06:22:09,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-04 06:22:09,099 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-04 06:22:09,099 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 122 flow [2023-08-04 06:22:09,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:09,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:09,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:22:09,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:09,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:09,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash -556191787, now seen corresponding path program 1 times [2023-08-04 06:22:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197208131] [2023-08-04 06:22:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:09,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197208131] [2023-08-04 06:22:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197208131] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714233974] [2023-08-04 06:22:09,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:09,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:09,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:09,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:09,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 06:22:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:09,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:09,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:09,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714233974] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:09,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 06:22:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024243958] [2023-08-04 06:22:09,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:09,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:22:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:22:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:22:09,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-04 06:22:09,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:09,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:09,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-04 06:22:09,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:14,614 INFO L124 PetriNetUnfolderBase]: 39598/52632 cut-off events. [2023-08-04 06:22:14,614 INFO L125 PetriNetUnfolderBase]: For 4065/4065 co-relation queries the response was YES. [2023-08-04 06:22:14,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109654 conditions, 52632 events. 39598/52632 cut-off events. For 4065/4065 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 298365 event pairs, 19270 based on Foata normal form. 5/47836 useless extension candidates. Maximal degree in co-relation 22931. Up to 52206 conditions per place. [2023-08-04 06:22:14,872 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 48 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 06:22:14,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 254 flow [2023-08-04 06:22:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-04 06:22:14,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-08-04 06:22:14,878 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-04 06:22:14,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-04 06:22:14,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:14,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-04 06:22:14,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:14,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:14,886 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:14,886 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 122 flow. Second operand 4 states and 436 transitions. [2023-08-04 06:22:14,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 254 flow [2023-08-04 06:22:14,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:14,892 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 134 flow [2023-08-04 06:22:14,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-04 06:22:14,893 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-04 06:22:14,893 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 134 flow [2023-08-04 06:22:14,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:14,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:14,894 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:14,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 06:22:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:15,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:15,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2049279504, now seen corresponding path program 1 times [2023-08-04 06:22:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528158289] [2023-08-04 06:22:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528158289] [2023-08-04 06:22:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528158289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:22:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984183349] [2023-08-04 06:22:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:15,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-04 06:22:15,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:15,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-04 06:22:15,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:19,709 INFO L124 PetriNetUnfolderBase]: 36078/47883 cut-off events. [2023-08-04 06:22:19,709 INFO L125 PetriNetUnfolderBase]: For 4043/4043 co-relation queries the response was YES. [2023-08-04 06:22:19,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99749 conditions, 47883 events. 36078/47883 cut-off events. For 4043/4043 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 270286 event pairs, 7528 based on Foata normal form. 0/44452 useless extension candidates. Maximal degree in co-relation 37059. Up to 43951 conditions per place. [2023-08-04 06:22:19,945 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-04 06:22:19,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 301 flow [2023-08-04 06:22:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 06:22:19,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536036036036036 [2023-08-04 06:22:19,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 06:22:19,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 06:22:19,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:19,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 06:22:19,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,950 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 134 flow. Second operand 3 states and 357 transitions. [2023-08-04 06:22:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 301 flow [2023-08-04 06:22:19,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 294 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:22:19,953 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 148 flow [2023-08-04 06:22:19,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-04 06:22:19,953 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-04 06:22:19,954 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 148 flow [2023-08-04 06:22:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:19,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:19,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:22:19,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:19,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1324715938, now seen corresponding path program 1 times [2023-08-04 06:22:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375501443] [2023-08-04 06:22:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:20,025 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-04 06:22:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375501443] [2023-08-04 06:22:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375501443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361927] [2023-08-04 06:22:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:20,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:20,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:20,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 06:22:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:20,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:20,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:20,116 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-04 06:22:20,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:20,133 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-04 06:22:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361927] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:20,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:22:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572395358] [2023-08-04 06:22:20,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:20,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:22:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:22:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:22:20,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-04 06:22:20,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:20,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:20,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-04 06:22:20,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:24,532 INFO L124 PetriNetUnfolderBase]: 34358/45718 cut-off events. [2023-08-04 06:22:24,532 INFO L125 PetriNetUnfolderBase]: For 4448/4448 co-relation queries the response was YES. [2023-08-04 06:22:24,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100114 conditions, 45718 events. 34358/45718 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 257256 event pairs, 13368 based on Foata normal form. 175/42642 useless extension candidates. Maximal degree in co-relation 37373. Up to 32061 conditions per place. [2023-08-04 06:22:24,720 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 76 selfloop transitions, 4 changer transitions 0/85 dead transitions. [2023-08-04 06:22:24,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 405 flow [2023-08-04 06:22:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-04 06:22:24,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2023-08-04 06:22:24,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-04 06:22:24,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-04 06:22:24,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:24,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-04 06:22:24,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:24,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:24,725 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:24,725 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 148 flow. Second operand 4 states and 460 transitions. [2023-08-04 06:22:24,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 405 flow [2023-08-04 06:22:24,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:24,727 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 165 flow [2023-08-04 06:22:24,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-04 06:22:24,728 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-04 06:22:24,728 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 165 flow [2023-08-04 06:22:24,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:24,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:24,728 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:24,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 06:22:24,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-04 06:22:24,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:24,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -487745328, now seen corresponding path program 1 times [2023-08-04 06:22:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144110141] [2023-08-04 06:22:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:24,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:22:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:24,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:22:24,997 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:22:24,997 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:22:24,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:22:24,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:22:24,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:22:24,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:22:24,997 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 06:22:24,998 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:22:24,999 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:22:24,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:22:25,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:22:25 BasicIcfg [2023-08-04 06:22:25,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:22:25,059 INFO L158 Benchmark]: Toolchain (without parser) took 39671.91ms. Allocated memory was 396.4MB in the beginning and 10.9GB in the end (delta: 10.5GB). Free memory was 356.7MB in the beginning and 9.2GB in the end (delta: -8.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-04 06:22:25,059 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 396.4MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:22:25,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.80ms. Allocated memory is still 396.4MB. Free memory was 356.7MB in the beginning and 331.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 06:22:25,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.47ms. Allocated memory is still 396.4MB. Free memory was 331.0MB in the beginning and 327.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:22:25,060 INFO L158 Benchmark]: Boogie Preprocessor took 49.41ms. Allocated memory is still 396.4MB. Free memory was 327.7MB in the beginning and 325.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 06:22:25,060 INFO L158 Benchmark]: RCFGBuilder took 731.39ms. Allocated memory was 396.4MB in the beginning and 637.5MB in the end (delta: 241.2MB). Free memory was 325.2MB in the beginning and 585.5MB in the end (delta: -260.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.0GB. [2023-08-04 06:22:25,060 INFO L158 Benchmark]: TraceAbstraction took 38415.80ms. Allocated memory was 637.5MB in the beginning and 10.9GB in the end (delta: 10.3GB). Free memory was 584.4MB in the beginning and 9.2GB in the end (delta: -8.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-04 06:22:25,064 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 396.4MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 426.80ms. Allocated memory is still 396.4MB. Free memory was 356.7MB in the beginning and 331.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.47ms. Allocated memory is still 396.4MB. Free memory was 331.0MB in the beginning and 327.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.41ms. Allocated memory is still 396.4MB. Free memory was 327.7MB in the beginning and 325.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 731.39ms. Allocated memory was 396.4MB in the beginning and 637.5MB in the end (delta: 241.2MB). Free memory was 325.2MB in the beginning and 585.5MB in the end (delta: -260.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.0GB. * TraceAbstraction took 38415.80ms. Allocated memory was 637.5MB in the beginning and 10.9GB in the end (delta: 10.3GB). Free memory was 584.4MB in the beginning and 9.2GB in the end (delta: -8.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 106 PlacesBefore, 30 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1716 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 90 TotalNumberOfCompositions, 4822 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1714, independent: 1542, independent conditional: 0, independent unconditional: 1542, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 952, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1714, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 952, unknown conditional: 0, unknown unconditional: 952] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 83 PlacesBefore, 26 PlacesAfterwards, 79 TransitionsBefore, 21 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 2382 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1241, independent: 1104, independent conditional: 0, independent unconditional: 1104, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 413, independent: 399, independent conditional: 0, independent unconditional: 399, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1241, independent: 705, independent conditional: 0, independent unconditional: 705, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 413, unknown conditional: 0, unknown unconditional: 413] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 130 PlacesBefore, 50 PlacesAfterwards, 125 TransitionsBefore, 41 TransitionsAfterwards, 4148 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 14305 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4764, independent: 4457, independent conditional: 0, independent unconditional: 4457, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2129, independent: 2054, independent conditional: 0, independent unconditional: 2054, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4764, independent: 2403, independent conditional: 0, independent unconditional: 2403, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 2129, unknown conditional: 0, unknown unconditional: 2129] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1645[2]; [L836] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1645={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t1645[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1645[asdf], ((void *)0), P0, ((void *)0))=-4, t1645={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1645={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t1645[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1645[asdf], ((void *)0), P0, ((void *)0))=-3, t1645={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1645={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] COND FALSE 0 !(asdf<2) [L837] 0 pthread_t t1646[2]; [L838] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1645={5:0}, t1646={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t1646[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1646[asdf], ((void *)0), P1, ((void *)0))=-2, t1645={5:0}, t1646={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] 3 y$w_buff1 = y$w_buff0 [L771] 3 y$w_buff0 = 1 [L772] 3 y$w_buff1_used = y$w_buff0_used [L773] 3 y$w_buff0_used = (_Bool)1 [L774] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L774] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L775] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1645={5:0}, t1646={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t1646[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1646[asdf], ((void *)0), P1, ((void *)0))=-1, t1645={5:0}, t1646={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 4 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] 4 y$w_buff1 = y$w_buff0 [L771] 4 y$w_buff0 = 1 [L772] 4 y$w_buff1_used = y$w_buff0_used [L773] 4 y$w_buff0_used = (_Bool)1 [L774] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 123 locations, 5 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: 4.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 8 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/5 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 7 procedures, 143 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: 31.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 15 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 25/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 123 locations, 5 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: 2.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:22:25,121 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...