/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:46:14,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:46:14,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:46:14,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:46:14,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:46:14,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:46:14,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:46:14,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:46:14,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:46:14,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:46:14,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:46:14,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:46:14,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:46:14,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:46:14,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:46:14,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:46:14,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:46:14,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:46:14,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:46:14,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:46:14,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:46:14,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:46:14,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:46:14,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:46:14,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:46:14,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:46:14,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:46:14,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:46:14,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:46:14,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:46:14,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:46:14,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:46:14,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:46:14,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:46:14,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:46:14,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:46:14,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:46:14,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:46:14,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:46:14,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:46:14,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:46:14,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:46:14,599 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:46:14,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:46:14,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:46:14,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:46:14,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:46:14,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:46:14,601 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:46:14,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:46:14,601 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:46:14,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:46:14,602 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:46:14,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:46:14,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:14,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:46:14,604 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:46:14,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:46:14,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:46:14,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:46:14,821 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:46:14,822 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:46:14,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2023-01-28 00:46:15,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:46:16,190 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:46:16,190 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2023-01-28 00:46:16,210 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d38202e8/28da3740eb024f78bc27cda3d793e0c5/FLAG28a98f154 [2023-01-28 00:46:16,226 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d38202e8/28da3740eb024f78bc27cda3d793e0c5 [2023-01-28 00:46:16,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:46:16,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:46:16,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:16,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:46:16,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:46:16,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16, skipping insertion in model container [2023-01-28 00:46:16,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:46:16,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:46:16,390 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i[969,982] [2023-01-28 00:46:16,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:16,539 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:46:16,549 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i[969,982] [2023-01-28 00:46:16,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:16,611 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:16,612 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:16,617 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:46:16,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16 WrapperNode [2023-01-28 00:46:16,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:16,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:16,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:46:16,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:46:16,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,678 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-01-28 00:46:16,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:16,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:46:16,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:46:16,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:46:16,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,706 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:46:16,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:46:16,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:46:16,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:46:16,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (1/1) ... [2023-01-28 00:46:16,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:16,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:46:16,739 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-01-28 00:46:16,761 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-01-28 00:46:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:46:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:46:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:46:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:46:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:46:16,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:46:16,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:46:16,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:46:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:46:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:46:16,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:46:16,796 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:46:17,001 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:46:17,002 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:46:17,540 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:46:17,828 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:46:17,829 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:46:17,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:17 BoogieIcfgContainer [2023-01-28 00:46:17,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:46:17,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:46:17,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:46:17,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:46:17,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:46:16" (1/3) ... [2023-01-28 00:46:17,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd4d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:17, skipping insertion in model container [2023-01-28 00:46:17,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:16" (2/3) ... [2023-01-28 00:46:17,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd4d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:17, skipping insertion in model container [2023-01-28 00:46:17,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:17" (3/3) ... [2023-01-28 00:46:17,840 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2023-01-28 00:46:17,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:46:17,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:46:17,855 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:46:17,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:46:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2023-01-28 00:46:18,063 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-28 00:46:18,064 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:18,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:46:18,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2023-01-28 00:46:18,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2023-01-28 00:46:18,078 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:46:18,093 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2023-01-28 00:46:18,096 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2023-01-28 00:46:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2023-01-28 00:46:18,138 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-28 00:46:18,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:18,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:46:18,142 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-28 00:46:25,102 INFO L134 LiptonReduction]: Checked pairs total: 5458 [2023-01-28 00:46:25,102 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 00:46:25,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:46:25,117 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a1a0183, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:46:25,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:46:25,121 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2023-01-28 00:46:25,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:25,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:25,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 00:46:25,122 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-01-28 00:46:25,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1792939925, now seen corresponding path program 1 times [2023-01-28 00:46:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86667589] [2023-01-28 00:46:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:25,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86667589] [2023-01-28 00:46:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86667589] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:25,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:25,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:46:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832426665] [2023-01-28 00:46:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:25,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:46:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:46:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:46:25,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 236 [2023-01-28 00:46:25,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:25,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:25,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 236 [2023-01-28 00:46:25,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:25,929 INFO L130 PetriNetUnfolder]: 920/1385 cut-off events. [2023-01-28 00:46:25,929 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 00:46:25,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1385 events. 920/1385 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6649 event pairs, 317 based on Foata normal form. 60/1312 useless extension candidates. Maximal degree in co-relation 2794. Up to 874 conditions per place. [2023-01-28 00:46:25,938 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-01-28 00:46:25,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2023-01-28 00:46:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:46:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:46:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-01-28 00:46:25,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310734463276836 [2023-01-28 00:46:25,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-01-28 00:46:25,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-01-28 00:46:25,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:25,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-01-28 00:46:25,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:25,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:25,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:25,965 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 376 transitions. [2023-01-28 00:46:25,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2023-01-28 00:46:25,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:46:25,969 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-28 00:46:25,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-28 00:46:25,973 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 00:46:25,974 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-28 00:46:25,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:25,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:25,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:25,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:46:25,975 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-01-28 00:46:25,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1558069759, now seen corresponding path program 1 times [2023-01-28 00:46:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888546373] [2023-01-28 00:46:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888546373] [2023-01-28 00:46:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888546373] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:26,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319284734] [2023-01-28 00:46:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:26,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:26,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-01-28 00:46:26,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:26,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-01-28 00:46:26,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:26,616 INFO L130 PetriNetUnfolder]: 645/1097 cut-off events. [2023-01-28 00:46:26,616 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-01-28 00:46:26,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 1097 events. 645/1097 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5597 event pairs, 122 based on Foata normal form. 60/1153 useless extension candidates. Maximal degree in co-relation 2201. Up to 695 conditions per place. [2023-01-28 00:46:26,622 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 30 selfloop transitions, 2 changer transitions 17/51 dead transitions. [2023-01-28 00:46:26,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 220 flow [2023-01-28 00:46:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-01-28 00:46:26,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008474576271187 [2023-01-28 00:46:26,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-01-28 00:46:26,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-01-28 00:46:26,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:26,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-01-28 00:46:26,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,635 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,636 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 591 transitions. [2023-01-28 00:46:26,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 220 flow [2023-01-28 00:46:26,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:26,638 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 60 flow [2023-01-28 00:46:26,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-01-28 00:46:26,639 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-28 00:46:26,639 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 60 flow [2023-01-28 00:46:26,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:26,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:26,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:46:26,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:26,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1055487831, now seen corresponding path program 1 times [2023-01-28 00:46:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572771834] [2023-01-28 00:46:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572771834] [2023-01-28 00:46:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572771834] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752300289] [2023-01-28 00:46:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:26,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:26,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-01-28 00:46:26,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:26,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:26,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-01-28 00:46:26,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:27,176 INFO L130 PetriNetUnfolder]: 566/892 cut-off events. [2023-01-28 00:46:27,176 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2023-01-28 00:46:27,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 892 events. 566/892 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4131 event pairs, 96 based on Foata normal form. 40/928 useless extension candidates. Maximal degree in co-relation 2059. Up to 701 conditions per place. [2023-01-28 00:46:27,182 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 26 selfloop transitions, 2 changer transitions 13/43 dead transitions. [2023-01-28 00:46:27,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 193 flow [2023-01-28 00:46:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-01-28 00:46:27,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940677966101695 [2023-01-28 00:46:27,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-01-28 00:46:27,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-01-28 00:46:27,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:27,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-01-28 00:46:27,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,189 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,189 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 60 flow. Second operand 5 states and 583 transitions. [2023-01-28 00:46:27,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 193 flow [2023-01-28 00:46:27,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 183 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:46:27,192 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 64 flow [2023-01-28 00:46:27,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-01-28 00:46:27,194 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-28 00:46:27,196 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 64 flow [2023-01-28 00:46:27,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:27,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:27,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:46:27,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:27,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -432857046, now seen corresponding path program 1 times [2023-01-28 00:46:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115236960] [2023-01-28 00:46:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115236960] [2023-01-28 00:46:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115236960] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185271846] [2023-01-28 00:46:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:27,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:27,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:27,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-01-28 00:46:27,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:27,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-01-28 00:46:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:27,782 INFO L130 PetriNetUnfolder]: 953/1472 cut-off events. [2023-01-28 00:46:27,782 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2023-01-28 00:46:27,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 1472 events. 953/1472 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6910 event pairs, 283 based on Foata normal form. 48/1512 useless extension candidates. Maximal degree in co-relation 3406. Up to 513 conditions per place. [2023-01-28 00:46:27,788 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 34 selfloop transitions, 3 changer transitions 23/61 dead transitions. [2023-01-28 00:46:27,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 281 flow [2023-01-28 00:46:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:46:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:46:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-01-28 00:46:27,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929378531073446 [2023-01-28 00:46:27,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-01-28 00:46:27,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-01-28 00:46:27,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:27,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-01-28 00:46:27,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,796 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,796 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 64 flow. Second operand 6 states and 698 transitions. [2023-01-28 00:46:27,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 281 flow [2023-01-28 00:46:27,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 271 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:46:27,800 INFO L231 Difference]: Finished difference. Result has 39 places, 21 transitions, 74 flow [2023-01-28 00:46:27,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2023-01-28 00:46:27,800 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-28 00:46:27,801 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 74 flow [2023-01-28 00:46:27,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:27,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:27,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:46:27,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:27,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -535835361, now seen corresponding path program 1 times [2023-01-28 00:46:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:27,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810244692] [2023-01-28 00:46:27,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810244692] [2023-01-28 00:46:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810244692] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789938275] [2023-01-28 00:46:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:27,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:27,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-01-28 00:46:27,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:27,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:27,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-01-28 00:46:27,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:28,224 INFO L130 PetriNetUnfolder]: 641/1024 cut-off events. [2023-01-28 00:46:28,224 INFO L131 PetriNetUnfolder]: For 725/726 co-relation queries the response was YES. [2023-01-28 00:46:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 1024 events. 641/1024 cut-off events. For 725/726 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4210 event pairs, 224 based on Foata normal form. 40/1063 useless extension candidates. Maximal degree in co-relation 2562. Up to 387 conditions per place. [2023-01-28 00:46:28,228 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 23 selfloop transitions, 3 changer transitions 25/52 dead transitions. [2023-01-28 00:46:28,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 263 flow [2023-01-28 00:46:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:46:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:46:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 689 transitions. [2023-01-28 00:46:28,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4865819209039548 [2023-01-28 00:46:28,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 689 transitions. [2023-01-28 00:46:28,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 689 transitions. [2023-01-28 00:46:28,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:28,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 689 transitions. [2023-01-28 00:46:28,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,236 INFO L175 Difference]: Start difference. First operand has 39 places, 21 transitions, 74 flow. Second operand 6 states and 689 transitions. [2023-01-28 00:46:28,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 263 flow [2023-01-28 00:46:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 226 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-01-28 00:46:28,239 INFO L231 Difference]: Finished difference. Result has 39 places, 21 transitions, 72 flow [2023-01-28 00:46:28,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2023-01-28 00:46:28,240 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-28 00:46:28,240 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 72 flow [2023-01-28 00:46:28,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:28,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:28,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:46:28,241 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-01-28 00:46:28,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1059275536, now seen corresponding path program 1 times [2023-01-28 00:46:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:28,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29527303] [2023-01-28 00:46:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:28,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29527303] [2023-01-28 00:46:28,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29527303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:28,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327936491] [2023-01-28 00:46:28,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:28,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:46:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:46:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:46:28,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-28 00:46:28,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:28,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-28 00:46:28,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:28,606 INFO L130 PetriNetUnfolder]: 160/284 cut-off events. [2023-01-28 00:46:28,606 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-01-28 00:46:28,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 284 events. 160/284 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 945 event pairs, 39 based on Foata normal form. 11/295 useless extension candidates. Maximal degree in co-relation 683. Up to 262 conditions per place. [2023-01-28 00:46:28,608 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 23 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2023-01-28 00:46:28,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 147 flow [2023-01-28 00:46:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:46:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:46:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-01-28 00:46:28,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501412429378531 [2023-01-28 00:46:28,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-01-28 00:46:28,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-01-28 00:46:28,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:28,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-01-28 00:46:28,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,612 INFO L175 Difference]: Start difference. First operand has 39 places, 21 transitions, 72 flow. Second operand 3 states and 355 transitions. [2023-01-28 00:46:28,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 147 flow [2023-01-28 00:46:28,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 123 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-01-28 00:46:28,614 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 78 flow [2023-01-28 00:46:28,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-01-28 00:46:28,615 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 00:46:28,615 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 78 flow [2023-01-28 00:46:28,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:28,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:28,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:46:28,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:28,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1351119222, now seen corresponding path program 1 times [2023-01-28 00:46:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754213673] [2023-01-28 00:46:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754213673] [2023-01-28 00:46:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754213673] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:46:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93202858] [2023-01-28 00:46:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:29,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:46:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:46:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:46:29,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 236 [2023-01-28 00:46:29,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:29,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:29,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 236 [2023-01-28 00:46:29,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:30,148 INFO L130 PetriNetUnfolder]: 164/298 cut-off events. [2023-01-28 00:46:30,149 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-01-28 00:46:30,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 298 events. 164/298 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 999 event pairs, 79 based on Foata normal form. 12/310 useless extension candidates. Maximal degree in co-relation 769. Up to 254 conditions per place. [2023-01-28 00:46:30,150 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 27 selfloop transitions, 7 changer transitions 11/47 dead transitions. [2023-01-28 00:46:30,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 233 flow [2023-01-28 00:46:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:46:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:46:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 749 transitions. [2023-01-28 00:46:30,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967161016949153 [2023-01-28 00:46:30,153 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 749 transitions. [2023-01-28 00:46:30,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 749 transitions. [2023-01-28 00:46:30,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:30,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 749 transitions. [2023-01-28 00:46:30,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,158 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,158 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 78 flow. Second operand 8 states and 749 transitions. [2023-01-28 00:46:30,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 233 flow [2023-01-28 00:46:30,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:46:30,160 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 127 flow [2023-01-28 00:46:30,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-01-28 00:46:30,160 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-28 00:46:30,161 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 127 flow [2023-01-28 00:46:30,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:30,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:30,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:46:30,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:30,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1851015808, now seen corresponding path program 1 times [2023-01-28 00:46:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381140445] [2023-01-28 00:46:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:30,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381140445] [2023-01-28 00:46:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381140445] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981185926] [2023-01-28 00:46:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:30,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:30,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-28 00:46:30,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:30,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-28 00:46:30,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:30,541 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2023-01-28 00:46:30,541 INFO L131 PetriNetUnfolder]: For 109/111 co-relation queries the response was YES. [2023-01-28 00:46:30,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 130 events. 58/130 cut-off events. For 109/111 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs, 6 based on Foata normal form. 17/147 useless extension candidates. Maximal degree in co-relation 432. Up to 78 conditions per place. [2023-01-28 00:46:30,543 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 35 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2023-01-28 00:46:30,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 279 flow [2023-01-28 00:46:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-01-28 00:46:30,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989406779661017 [2023-01-28 00:46:30,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-01-28 00:46:30,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-01-28 00:46:30,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:30,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-01-28 00:46:30,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,548 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 127 flow. Second operand 4 states and 471 transitions. [2023-01-28 00:46:30,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 279 flow [2023-01-28 00:46:30,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 275 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:30,550 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 158 flow [2023-01-28 00:46:30,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-01-28 00:46:30,551 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-01-28 00:46:30,551 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 158 flow [2023-01-28 00:46:30,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:30,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:30,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:30,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:46:30,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:30,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1784835674, now seen corresponding path program 1 times [2023-01-28 00:46:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554598753] [2023-01-28 00:46:30,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:30,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:32,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:32,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554598753] [2023-01-28 00:46:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554598753] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:32,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:46:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223827831] [2023-01-28 00:46:32,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:46:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:32,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:46:32,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:46:32,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 236 [2023-01-28 00:46:32,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:32,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:32,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 236 [2023-01-28 00:46:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:32,506 INFO L130 PetriNetUnfolder]: 63/143 cut-off events. [2023-01-28 00:46:32,506 INFO L131 PetriNetUnfolder]: For 227/231 co-relation queries the response was YES. [2023-01-28 00:46:32,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 143 events. 63/143 cut-off events. For 227/231 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 391 event pairs, 13 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 545. Up to 84 conditions per place. [2023-01-28 00:46:32,507 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 34 selfloop transitions, 8 changer transitions 5/49 dead transitions. [2023-01-28 00:46:32,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 368 flow [2023-01-28 00:46:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:46:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:46:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 702 transitions. [2023-01-28 00:46:32,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3718220338983051 [2023-01-28 00:46:32,511 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 702 transitions. [2023-01-28 00:46:32,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 702 transitions. [2023-01-28 00:46:32,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:32,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 702 transitions. [2023-01-28 00:46:32,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:32,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:32,517 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:32,517 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 158 flow. Second operand 8 states and 702 transitions. [2023-01-28 00:46:32,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 368 flow [2023-01-28 00:46:32,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 334 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:32,521 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 193 flow [2023-01-28 00:46:32,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2023-01-28 00:46:32,522 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-01-28 00:46:32,522 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 193 flow [2023-01-28 00:46:32,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:32,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:32,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:46:32,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:32,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 505418688, now seen corresponding path program 1 times [2023-01-28 00:46:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873489594] [2023-01-28 00:46:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873489594] [2023-01-28 00:46:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873489594] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:34,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:34,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:46:34,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684255904] [2023-01-28 00:46:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:34,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:46:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:46:34,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:46:34,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 236 [2023-01-28 00:46:34,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 86.88888888888889) internal successors, (782), 9 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:34,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:34,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 236 [2023-01-28 00:46:34,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:34,901 INFO L130 PetriNetUnfolder]: 60/137 cut-off events. [2023-01-28 00:46:34,901 INFO L131 PetriNetUnfolder]: For 317/321 co-relation queries the response was YES. [2023-01-28 00:46:34,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 137 events. 60/137 cut-off events. For 317/321 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 368 event pairs, 13 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 569. Up to 71 conditions per place. [2023-01-28 00:46:34,902 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 36 selfloop transitions, 7 changer transitions 3/48 dead transitions. [2023-01-28 00:46:34,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 377 flow [2023-01-28 00:46:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:46:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:46:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2023-01-28 00:46:34,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3807506053268765 [2023-01-28 00:46:34,905 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2023-01-28 00:46:34,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2023-01-28 00:46:34,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:34,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2023-01-28 00:46:34,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:34,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:34,909 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:34,909 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 193 flow. Second operand 7 states and 629 transitions. [2023-01-28 00:46:34,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 377 flow [2023-01-28 00:46:34,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 331 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-01-28 00:46:34,912 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 186 flow [2023-01-28 00:46:34,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-01-28 00:46:34,912 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-28 00:46:34,912 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 186 flow [2023-01-28 00:46:34,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.88888888888889) internal successors, (782), 9 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:34,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:34,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:34,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:46:34,913 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:34,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash 254813532, now seen corresponding path program 1 times [2023-01-28 00:46:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731629261] [2023-01-28 00:46:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731629261] [2023-01-28 00:46:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731629261] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417461462] [2023-01-28 00:46:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:35,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-28 00:46:35,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:35,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:35,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-28 00:46:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:35,267 INFO L130 PetriNetUnfolder]: 36/86 cut-off events. [2023-01-28 00:46:35,267 INFO L131 PetriNetUnfolder]: For 171/175 co-relation queries the response was YES. [2023-01-28 00:46:35,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 86 events. 36/86 cut-off events. For 171/175 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 2 based on Foata normal form. 12/98 useless extension candidates. Maximal degree in co-relation 331. Up to 34 conditions per place. [2023-01-28 00:46:35,268 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-01-28 00:46:35,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 372 flow [2023-01-28 00:46:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-01-28 00:46:35,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-01-28 00:46:35,270 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-01-28 00:46:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-01-28 00:46:35,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:35,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-01-28 00:46:35,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:35,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:35,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:35,275 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 186 flow. Second operand 5 states and 580 transitions. [2023-01-28 00:46:35,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 372 flow [2023-01-28 00:46:35,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 303 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-01-28 00:46:35,277 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 168 flow [2023-01-28 00:46:35,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-01-28 00:46:35,278 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-28 00:46:35,278 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 168 flow [2023-01-28 00:46:35,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:35,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:35,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:35,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:46:35,279 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:35,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash 221737774, now seen corresponding path program 1 times [2023-01-28 00:46:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891275087] [2023-01-28 00:46:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:46:35,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:46:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:46:35,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:46:35,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:46:35,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:46:35,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:46:35,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:46:35,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:46:35,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:46:35,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:46:35,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:46:35,526 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:35,530 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:46:35,531 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:46:35,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:46:35 BasicIcfg [2023-01-28 00:46:35,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:46:35,626 INFO L158 Benchmark]: Toolchain (without parser) took 19396.49ms. Allocated memory was 375.4MB in the beginning and 673.2MB in the end (delta: 297.8MB). Free memory was 333.0MB in the beginning and 432.6MB in the end (delta: -99.6MB). Peak memory consumption was 201.0MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,626 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:46:35,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.07ms. Allocated memory is still 375.4MB. Free memory was 333.0MB in the beginning and 308.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.86ms. Allocated memory is still 375.4MB. Free memory was 308.9MB in the beginning and 306.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,626 INFO L158 Benchmark]: Boogie Preprocessor took 32.79ms. Allocated memory is still 375.4MB. Free memory was 306.4MB in the beginning and 304.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,627 INFO L158 Benchmark]: RCFGBuilder took 1118.25ms. Allocated memory is still 375.4MB. Free memory was 304.1MB in the beginning and 288.4MB in the end (delta: 15.7MB). Peak memory consumption was 23.3MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,627 INFO L158 Benchmark]: TraceAbstraction took 17791.23ms. Allocated memory was 375.4MB in the beginning and 673.2MB in the end (delta: 297.8MB). Free memory was 287.6MB in the beginning and 432.6MB in the end (delta: -145.0MB). Peak memory consumption was 152.5MB. Max. memory is 16.0GB. [2023-01-28 00:46:35,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 386.07ms. Allocated memory is still 375.4MB. Free memory was 333.0MB in the beginning and 308.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.86ms. Allocated memory is still 375.4MB. Free memory was 308.9MB in the beginning and 306.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.79ms. Allocated memory is still 375.4MB. Free memory was 306.4MB in the beginning and 304.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1118.25ms. Allocated memory is still 375.4MB. Free memory was 304.1MB in the beginning and 288.4MB in the end (delta: 15.7MB). Peak memory consumption was 23.3MB. Max. memory is 16.0GB. * TraceAbstraction took 17791.23ms. Allocated memory was 375.4MB in the beginning and 673.2MB in the end (delta: 297.8MB). Free memory was 287.6MB in the beginning and 432.6MB in the end (delta: -145.0MB). Peak memory consumption was 152.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 132 PlacesBefore, 34 PlacesAfterwards, 124 TransitionsBefore, 25 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 8 FixpointIterations, 58 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 5458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2295, independent: 2076, independent conditional: 0, independent unconditional: 2076, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 957, independent: 924, independent conditional: 0, independent unconditional: 924, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2295, independent: 1152, independent conditional: 0, independent unconditional: 1152, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 957, unknown conditional: 0, unknown unconditional: 957] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1940, ((void *)0), P0, ((void *)0))=-1, t1940={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1941, ((void *)0), P1, ((void *)0))=0, t1940={8:0}, t1941={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1942, ((void *)0), P2, ((void *)0))=1, t1940={8:0}, t1941={6:0}, t1942={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940={8:0}, t1941={6:0}, t1942={9:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 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.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 817 IncrementalHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 4 mSDtfsCounter, 817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=9, InterpolantAutomatonStates: 60, 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.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:46:35,654 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...