/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:04:26,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:04:26,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:04:26,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:04:26,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:04:26,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:04:26,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:04:26,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:04:26,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:04:26,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:04:26,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:04:26,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:04:26,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:04:26,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:04:26,775 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:04:26,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:04:26,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:04:26,775 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:04:26,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:04:26,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:04:26,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:04:26,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:04:26,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:04:26,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:04:26,777 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:04:26,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:04:26,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:04:26,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:04:26,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:04:26,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:04:26,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:26,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:04:26,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:04:26,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:04:26,780 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:04:26,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:04:26,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:04:27,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:04:27,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:04:27,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:04:27,022 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:04:27,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i [2023-08-03 17:04:28,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:04:28,452 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:04:28,453 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i [2023-08-03 17:04:28,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4b8b16e/12ab3e99218c4a1db6282afafbe95a3e/FLAG1eeaf63ca [2023-08-03 17:04:28,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4b8b16e/12ab3e99218c4a1db6282afafbe95a3e [2023-08-03 17:04:28,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:04:28,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:04:28,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:28,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:04:28,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:04:28,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:28,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d7f3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28, skipping insertion in model container [2023-08-03 17:04:28,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:28,551 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:04:28,678 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_mix009.opt_bound2.i[987,1000] [2023-08-03 17:04:28,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:28,864 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:04:28,876 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_mix009.opt_bound2.i[987,1000] [2023-08-03 17:04:28,897 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:04:28,898 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:04:28,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:28,986 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:28,986 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:28,992 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:04:28,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28 WrapperNode [2023-08-03 17:04:28,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:28,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:28,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:04:28,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:04:29,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,048 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-03 17:04:29,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:29,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:04:29,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:04:29,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:04:29,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:04:29,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:04:29,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:04:29,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:04:29,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (1/1) ... [2023-08-03 17:04:29,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:29,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:04:29,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:04:29,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:04:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:04:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:04:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:04:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:04:29,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:04:29,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:04:29,172 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:04:29,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:04:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:04:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:04:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:04:29,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:04:29,174 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:04:29,315 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:04:29,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:04:29,609 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:04:29,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:04:29,729 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:04:29,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:29 BoogieIcfgContainer [2023-08-03 17:04:29,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:04:29,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:04:29,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:04:29,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:04:29,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:04:28" (1/3) ... [2023-08-03 17:04:29,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c8d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:29, skipping insertion in model container [2023-08-03 17:04:29,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:28" (2/3) ... [2023-08-03 17:04:29,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c8d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:29, skipping insertion in model container [2023-08-03 17:04:29,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:29" (3/3) ... [2023-08-03 17:04:29,740 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix009.opt_bound2.i [2023-08-03 17:04:29,748 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:04:29,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:04:29,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:04:29,756 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:04:29,802 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:04:29,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,932 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 17:04:29,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:29,941 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 8. Compared 629 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-08-03 17:04:29,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,953 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:04:29,961 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,964 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 107 transitions, 224 flow [2023-08-03 17:04:29,998 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 17:04:29,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:29,999 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 8. Compared 629 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-08-03 17:04:30,001 INFO L119 LiptonReduction]: Number of co-enabled transitions 1642 [2023-08-03 17:04:32,981 INFO L134 LiptonReduction]: Checked pairs total: 3696 [2023-08-03 17:04:32,981 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-03 17:04:32,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:04:33,000 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;@4e728034, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:04:33,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 17:04:33,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:04:33,003 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 17:04:33,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:33,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:33,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:04:33,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:04:33,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash 481118522, now seen corresponding path program 1 times [2023-08-03 17:04:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329193553] [2023-08-03 17:04:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:33,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329193553] [2023-08-03 17:04:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329193553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:04:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:04:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975743283] [2023-08-03 17:04:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:33,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:04:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:04:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:04:33,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 202 [2023-08-03 17:04:33,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:33,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:33,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 202 [2023-08-03 17:04:33,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:33,499 INFO L124 PetriNetUnfolderBase]: 350/662 cut-off events. [2023-08-03 17:04:33,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:33,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 662 events. 350/662 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3062 event pairs, 150 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 1283. Up to 601 conditions per place. [2023-08-03 17:04:33,510 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 17:04:33,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 120 flow [2023-08-03 17:04:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:04:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:04:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-08-03 17:04:33,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49174917491749176 [2023-08-03 17:04:33,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-08-03 17:04:33,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-08-03 17:04:33,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:33,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-08-03 17:04:33,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:33,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:33,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:33,551 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 60 flow. Second operand 3 states and 298 transitions. [2023-08-03 17:04:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 120 flow [2023-08-03 17:04:33,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:04:33,555 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 66 flow [2023-08-03 17:04:33,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-03 17:04:33,561 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-03 17:04:33,561 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 66 flow [2023-08-03 17:04:33,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:33,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:33,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:04:33,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:04:33,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:04:33,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2019568651, now seen corresponding path program 1 times [2023-08-03 17:04:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292627794] [2023-08-03 17:04:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:33,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:04:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:33,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:04:33,626 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:04:33,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 17:04:33,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 17:04:33,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 17:04:33,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 17:04:33,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 17:04:33,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:04:33,630 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:04:33,632 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:04:33,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:04:33,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:04:33,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,700 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-03 17:04:33,700 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:04:33,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 462 events. 30/462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1974 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 334. Up to 18 conditions per place. [2023-08-03 17:04:33,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,704 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:04:33,704 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,704 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 17:04:33,745 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-03 17:04:33,746 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:04:33,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 462 events. 30/462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1974 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 334. Up to 18 conditions per place. [2023-08-03 17:04:33,754 INFO L119 LiptonReduction]: Number of co-enabled transitions 3928 [2023-08-03 17:04:36,793 INFO L134 LiptonReduction]: Checked pairs total: 14217 [2023-08-03 17:04:36,793 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 17:04:36,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:04:36,801 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;@4e728034, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:04:36,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:04:36,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:04:36,807 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:04:36,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:36,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:36,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:04:36,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:36,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 713993749, now seen corresponding path program 1 times [2023-08-03 17:04:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159246995] [2023-08-03 17:04:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159246995] [2023-08-03 17:04:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159246995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:04:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:04:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498840648] [2023-08-03 17:04:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:04:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:04:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:04:36,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-08-03 17:04:36,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:36,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:36,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-08-03 17:04:36,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:39,706 INFO L124 PetriNetUnfolderBase]: 16566/23855 cut-off events. [2023-08-03 17:04:39,707 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 17:04:39,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47071 conditions, 23855 events. 16566/23855 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 154939 event pairs, 12024 based on Foata normal form. 0/20187 useless extension candidates. Maximal degree in co-relation 10375. Up to 22623 conditions per place. [2023-08-03 17:04:39,884 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-03 17:04:39,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 184 flow [2023-08-03 17:04:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:04:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:04:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-03 17:04:39,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081481481481481 [2023-08-03 17:04:39,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-03 17:04:39,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-03 17:04:39,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:39,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-03 17:04:39,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:39,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:39,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:39,892 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 106 flow. Second operand 3 states and 343 transitions. [2023-08-03 17:04:39,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 184 flow [2023-08-03 17:04:39,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:04:39,897 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 112 flow [2023-08-03 17:04:39,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-03 17:04:39,898 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-03 17:04:39,898 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 112 flow [2023-08-03 17:04:39,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:39,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:39,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:39,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:04:39,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:39,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1017472585, now seen corresponding path program 1 times [2023-08-03 17:04:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748089231] [2023-08-03 17:04:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748089231] [2023-08-03 17:04:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748089231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:04:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009551642] [2023-08-03 17:04:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:40,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:04:40,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:04:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:40,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 17:04:40,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:04:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 17:04:40,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:04:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009551642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:40,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:04:40,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 17:04:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995091565] [2023-08-03 17:04:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:40,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:04:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:04:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:04:40,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-08-03 17:04:40,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:40,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:40,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-08-03 17:04:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:42,789 INFO L124 PetriNetUnfolderBase]: 16458/23627 cut-off events. [2023-08-03 17:04:42,790 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2023-08-03 17:04:42,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46657 conditions, 23627 events. 16458/23627 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 152181 event pairs, 11442 based on Foata normal form. 0/20065 useless extension candidates. Maximal degree in co-relation 46615. Up to 22065 conditions per place. [2023-08-03 17:04:42,911 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 42 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-03 17:04:42,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 226 flow [2023-08-03 17:04:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:04:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:04:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-03 17:04:42,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-03 17:04:42,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-03 17:04:42,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-03 17:04:42,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:42,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-03 17:04:42,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:42,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:42,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:42,916 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 112 flow. Second operand 3 states and 350 transitions. [2023-08-03 17:04:42,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 226 flow [2023-08-03 17:04:42,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:04:42,918 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 122 flow [2023-08-03 17:04:42,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=122, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-03 17:04:42,919 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-08-03 17:04:42,919 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 122 flow [2023-08-03 17:04:42,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:42,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:42,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:42,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:04:43,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:43,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:43,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1017494672, now seen corresponding path program 1 times [2023-08-03 17:04:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093837221] [2023-08-03 17:04:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093837221] [2023-08-03 17:04:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093837221] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:04:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427413591] [2023-08-03 17:04:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:43,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:04:43,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:04:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:43,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:04:43,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:04:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:43,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:04:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427413591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:04:43,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:04:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:04:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721004222] [2023-08-03 17:04:43,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:04:43,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:04:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:04:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:04:43,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 225 [2023-08-03 17:04:43,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:43,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:43,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 225 [2023-08-03 17:04:43,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:45,185 INFO L124 PetriNetUnfolderBase]: 13890/19611 cut-off events. [2023-08-03 17:04:45,185 INFO L125 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2023-08-03 17:04:45,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40223 conditions, 19611 events. 13890/19611 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 121237 event pairs, 9092 based on Foata normal form. 4/17471 useless extension candidates. Maximal degree in co-relation 10636. Up to 18601 conditions per place. [2023-08-03 17:04:45,288 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 39 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-03 17:04:45,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 230 flow [2023-08-03 17:04:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:04:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:04:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-03 17:04:45,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-08-03 17:04:45,290 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-03 17:04:45,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-03 17:04:45,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:45,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-03 17:04:45,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:45,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:45,294 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:45,294 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 122 flow. Second operand 4 states and 447 transitions. [2023-08-03 17:04:45,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 230 flow [2023-08-03 17:04:45,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:04:45,297 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 140 flow [2023-08-03 17:04:45,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-03 17:04:45,298 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-03 17:04:45,298 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 140 flow [2023-08-03 17:04:45,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:45,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:45,299 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:04:45,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:04:45,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:45,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:45,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1177306944, now seen corresponding path program 1 times [2023-08-03 17:04:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:45,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853504769] [2023-08-03 17:04:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:45,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:45,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853504769] [2023-08-03 17:04:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853504769] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:04:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294652490] [2023-08-03 17:04:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:45,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:45,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:45,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:04:45,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 17:04:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:45,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:04:45,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:04:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:04:45,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:04:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294652490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:04:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:04:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608898476] [2023-08-03 17:04:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:45,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:04:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:04:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:04:45,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 225 [2023-08-03 17:04:45,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:45,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:45,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 225 [2023-08-03 17:04:45,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:47,664 INFO L124 PetriNetUnfolderBase]: 13866/19556 cut-off events. [2023-08-03 17:04:47,664 INFO L125 PetriNetUnfolderBase]: For 1632/1632 co-relation queries the response was YES. [2023-08-03 17:04:47,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40084 conditions, 19556 events. 13866/19556 cut-off events. For 1632/1632 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 120723 event pairs, 6730 based on Foata normal form. 16/17427 useless extension candidates. Maximal degree in co-relation 18803. Up to 18600 conditions per place. [2023-08-03 17:04:47,773 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 39 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-03 17:04:47,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 236 flow [2023-08-03 17:04:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:04:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:04:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-08-03 17:04:47,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862222222222222 [2023-08-03 17:04:47,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-08-03 17:04:47,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-08-03 17:04:47,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:47,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-08-03 17:04:47,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:47,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:47,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:47,781 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 140 flow. Second operand 5 states and 547 transitions. [2023-08-03 17:04:47,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 236 flow [2023-08-03 17:04:47,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 229 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:04:47,783 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 129 flow [2023-08-03 17:04:47,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-03 17:04:47,784 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-03 17:04:47,785 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 129 flow [2023-08-03 17:04:47,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:47,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:47,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:47,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 17:04:47,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:47,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:47,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1815867020, now seen corresponding path program 1 times [2023-08-03 17:04:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142082731] [2023-08-03 17:04:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:48,129 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-03 17:04:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142082731] [2023-08-03 17:04:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142082731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:04:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:04:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552110335] [2023-08-03 17:04:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:48,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:04:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:04:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:04:48,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2023-08-03 17:04:48,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:48,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:48,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2023-08-03 17:04:48,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:49,507 INFO L124 PetriNetUnfolderBase]: 12458/17642 cut-off events. [2023-08-03 17:04:49,508 INFO L125 PetriNetUnfolderBase]: For 1615/1615 co-relation queries the response was YES. [2023-08-03 17:04:49,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36061 conditions, 17642 events. 12458/17642 cut-off events. For 1615/1615 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 109419 event pairs, 2442 based on Foata normal form. 0/16015 useless extension candidates. Maximal degree in co-relation 16899. Up to 16065 conditions per place. [2023-08-03 17:04:49,595 INFO L140 encePairwiseOnDemand]: 220/225 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-03 17:04:49,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 268 flow [2023-08-03 17:04:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:04:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:04:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-03 17:04:49,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362962962962963 [2023-08-03 17:04:49,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-03 17:04:49,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-03 17:04:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:49,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-03 17:04:49,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:49,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:49,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:49,600 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 129 flow. Second operand 3 states and 362 transitions. [2023-08-03 17:04:49,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 268 flow [2023-08-03 17:04:49,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 263 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:04:49,602 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 145 flow [2023-08-03 17:04:49,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-03 17:04:49,603 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-03 17:04:49,603 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 145 flow [2023-08-03 17:04:49,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:49,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:49,603 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:49,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:04:49,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:49,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -272721613, now seen corresponding path program 1 times [2023-08-03 17:04:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810868114] [2023-08-03 17:04:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:04:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810868114] [2023-08-03 17:04:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810868114] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:04:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676753580] [2023-08-03 17:04:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:49,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:04:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:49,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:04:49,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 17:04:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:49,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:04:49,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:04:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:04:49,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:04:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:04:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676753580] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:04:49,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:04:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:04:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791125038] [2023-08-03 17:04:49,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:04:49,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:04:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:04:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:04:49,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 225 [2023-08-03 17:04:49,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:49,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:49,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 225 [2023-08-03 17:04:49,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:04:51,123 INFO L124 PetriNetUnfolderBase]: 11722/16142 cut-off events. [2023-08-03 17:04:51,123 INFO L125 PetriNetUnfolderBase]: For 2007/2007 co-relation queries the response was YES. [2023-08-03 17:04:51,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35822 conditions, 16142 events. 11722/16142 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 93773 event pairs, 4546 based on Foata normal form. 80/14794 useless extension candidates. Maximal degree in co-relation 16861. Up to 11009 conditions per place. [2023-08-03 17:04:51,180 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-03 17:04:51,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 350 flow [2023-08-03 17:04:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:04:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:04:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-03 17:04:51,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2023-08-03 17:04:51,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-03 17:04:51,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-03 17:04:51,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:04:51,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-03 17:04:51,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:51,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:51,185 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:51,185 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 145 flow. Second operand 4 states and 464 transitions. [2023-08-03 17:04:51,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 350 flow [2023-08-03 17:04:51,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:04:51,189 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 162 flow [2023-08-03 17:04:51,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-03 17:04:51,190 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-03 17:04:51,190 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 162 flow [2023-08-03 17:04:51,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:51,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:51,190 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:51,198 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-03 17:04:51,395 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-03 17:04:51,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:51,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash 782602905, now seen corresponding path program 1 times [2023-08-03 17:04:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:51,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726951467] [2023-08-03 17:04:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:51,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:51,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:04:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:51,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:04:51,458 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:04:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:04:51,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 17:04:51,460 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:04:51,463 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:04:51,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:04:51,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:04:51 BasicIcfg [2023-08-03 17:04:51,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:04:51,536 INFO L158 Benchmark]: Toolchain (without parser) took 23040.87ms. Allocated memory was 578.8MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 528.4MB in the beginning and 2.9GB in the end (delta: -2.4GB). Peak memory consumption was 561.9MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,537 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 350.2MB. Free memory is still 300.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:04:51,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.94ms. Allocated memory is still 578.8MB. Free memory was 528.0MB in the beginning and 504.3MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 578.8MB. Free memory was 504.3MB in the beginning and 501.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,537 INFO L158 Benchmark]: Boogie Preprocessor took 41.90ms. Allocated memory is still 578.8MB. Free memory was 501.5MB in the beginning and 499.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,538 INFO L158 Benchmark]: RCFGBuilder took 634.50ms. Allocated memory is still 578.8MB. Free memory was 499.4MB in the beginning and 522.5MB in the end (delta: -23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,538 INFO L158 Benchmark]: TraceAbstraction took 21802.52ms. Allocated memory was 578.8MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 521.4MB in the beginning and 2.9GB in the end (delta: -2.4GB). Peak memory consumption was 553.5MB. Max. memory is 16.0GB. [2023-08-03 17:04:51,539 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 350.2MB. Free memory is still 300.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 496.94ms. Allocated memory is still 578.8MB. Free memory was 528.0MB in the beginning and 504.3MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 578.8MB. Free memory was 504.3MB in the beginning and 501.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.90ms. Allocated memory is still 578.8MB. Free memory was 501.5MB in the beginning and 499.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 634.50ms. Allocated memory is still 578.8MB. Free memory was 499.4MB in the beginning and 522.5MB in the end (delta: -23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 21802.52ms. Allocated memory was 578.8MB in the beginning and 3.5GB in the end (delta: 2.9GB). Free memory was 521.4MB in the beginning and 2.9GB in the end (delta: -2.4GB). Peak memory consumption was 553.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 108 PlacesBefore, 29 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 3696 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2176, independent: 2047, independent conditional: 0, independent unconditional: 2047, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 890, independent: 858, independent conditional: 0, independent unconditional: 858, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2176, independent: 1189, independent conditional: 0, independent unconditional: 1189, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 890, unknown conditional: 0, unknown unconditional: 890] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 131 PlacesBefore, 49 PlacesAfterwards, 126 TransitionsBefore, 41 TransitionsAfterwards, 3928 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, 14217 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5087, independent: 4783, independent conditional: 0, independent unconditional: 4783, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1969, independent: 1918, independent conditional: 0, independent unconditional: 1918, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5087, independent: 2865, independent conditional: 0, independent unconditional: 2865, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 1969, unknown conditional: 0, unknown unconditional: 1969] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t243={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, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t243[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243[asdf], ((void *)0), P0, ((void *)0))=-3, t243={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, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t243={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, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t243[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243[asdf], ((void *)0), P0, ((void *)0))=-2, t243={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, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t243={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, z=0] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t244[2]; [L834] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={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, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t244[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t244[asdf], ((void *)0), P1, ((void *)0))=-1, t243={5:0}, t244={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, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L783] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L783] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, 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, z=0] [L834] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={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=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, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t244[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t244[asdf], ((void *)0), P1, ((void *)0))=0, t243={5:0}, t244={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=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, z=0] [L779] 4 y$w_buff1 = y$w_buff0 [L780] 4 y$w_buff0 = 1 [L781] 4 y$w_buff1_used = y$w_buff0_used [L782] 4 y$w_buff0_used = (_Bool)1 [L783] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, 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, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 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: 3.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 51 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=66occurred 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.2s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 142 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: 17.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 10 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 17:04:51,568 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...