/usr/bin/java -Xmx8000000000 -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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:41:56,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:41:56,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:41:56,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:41:56,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:41:56,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:41:56,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:41:56,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:41:56,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:41:56,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:41:56,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:41:56,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:41:56,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:41:56,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:41:56,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:41:56,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:41:56,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:41:56,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:41:56,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:41:56,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:41:56,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:41:56,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:41:56,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:41:56,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:41:56,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:41:56,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:41:56,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:41:56,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:41:56,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:41:56,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:41:56,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:41:56,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:41:56,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:41:56,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:41:56,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:41:56,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:41:56,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:41:56,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:41:56,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:41:56,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:41:56,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:41:56,586 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-SemanticLbe.epf [2022-12-12 18:41:56,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:41:56,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:41:56,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:41:56,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:41:56,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:41:56,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:41:56,645 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:41:56,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:41:56,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:41:56,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:41:56,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:41:56,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:41:56,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:41:56,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:41:56,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Use on-demand Petri net difference -> true [2022-12-12 18:41:57,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:41:57,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:41:57,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:41:57,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:41:57,136 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:41:57,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:41:58,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:41:58,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:41:58,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:41:58,416 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e13841c/645bc0a666ae453fb309380cecd5a378/FLAGd9d025e84 [2022-12-12 18:41:58,428 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e13841c/645bc0a666ae453fb309380cecd5a378 [2022-12-12 18:41:58,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:41:58,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:41:58,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:41:58,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:41:58,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:41:58,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415acdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58, skipping insertion in model container [2022-12-12 18:41:58,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:41:58,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:41:58,623 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 18:41:58,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:41:58,787 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:41:58,795 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 18:41:58,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:41:58,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:41:58,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:41:58,857 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:41:58,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58 WrapperNode [2022-12-12 18:41:58,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:41:58,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:41:58,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:41:58,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:41:58,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,923 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-12 18:41:58,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:41:58,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:41:58,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:41:58,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:41:58,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:41:58,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:41:58,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:41:58,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:41:58,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (1/1) ... [2022-12-12 18:41:58,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:41:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:41:59,012 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) [2022-12-12 18:41:59,048 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 [2022-12-12 18:41:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:41:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:41:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:41:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:41:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:41:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:41:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:41:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:41:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:41:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:41:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:41:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:41:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:41:59,079 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:41:59,188 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:41:59,190 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:41:59,458 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:41:59,550 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:41:59,551 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:41:59,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:41:59 BoogieIcfgContainer [2022-12-12 18:41:59,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:41:59,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:41:59,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:41:59,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:41:59,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:41:58" (1/3) ... [2022-12-12 18:41:59,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fe4ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:41:59, skipping insertion in model container [2022-12-12 18:41:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:41:58" (2/3) ... [2022-12-12 18:41:59,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fe4ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:41:59, skipping insertion in model container [2022-12-12 18:41:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:41:59" (3/3) ... [2022-12-12 18:41:59,559 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:41:59,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:41:59,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:41:59,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:41:59,609 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:41:59,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 18:41:59,683 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 18:41:59,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:41:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 18:41:59,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 18:41:59,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-12 18:41:59,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:41:59,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 18:41:59,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-12 18:41:59,734 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 18:41:59,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:41:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 18:41:59,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 18:41:59,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-12 18:42:05,222 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-12 18:42:05,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:42:05,255 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;@1be21e3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:42:05,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 18:42:05,257 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 18:42:05,257 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:42:05,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:05,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:42:05,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash 406253, now seen corresponding path program 1 times [2022-12-12 18:42:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463356804] [2022-12-12 18:42:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:05,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:05,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463356804] [2022-12-12 18:42:05,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463356804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:05,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:42:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676118485] [2022-12-12 18:42:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:05,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:42:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:42:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:42:05,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2022-12-12 18:42:05,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-12-12 18:42:05,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:05,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2022-12-12 18:42:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:05,945 INFO L130 PetriNetUnfolder]: 960/1849 cut-off events. [2022-12-12 18:42:05,946 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 18:42:05,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 1849 events. 960/1849 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13014 event pairs, 92 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 3446. Up to 1373 conditions per place. [2022-12-12 18:42:05,961 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 22 selfloop transitions, 2 changer transitions 49/80 dead transitions. [2022-12-12 18:42:05,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 313 flow [2022-12-12 18:42:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:42:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:42:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-12-12 18:42:05,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2022-12-12 18:42:05,976 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2022-12-12 18:42:05,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 80 transitions, 313 flow [2022-12-12 18:42:05,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 31 transitions, 119 flow [2022-12-12 18:42:05,982 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 119 flow [2022-12-12 18:42:05,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-12-12 18:42:05,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:05,982 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:05,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:42:05,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1571550662, now seen corresponding path program 1 times [2022-12-12 18:42:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:05,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21168740] [2022-12-12 18:42:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21168740] [2022-12-12 18:42:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21168740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:06,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:06,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:42:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610625872] [2022-12-12 18:42:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:42:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:42:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:42:06,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2022-12-12 18:42:06,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-12-12 18:42:06,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:06,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2022-12-12 18:42:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:06,703 INFO L130 PetriNetUnfolder]: 166/320 cut-off events. [2022-12-12 18:42:06,704 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-12 18:42:06,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 320 events. 166/320 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1327 event pairs, 20 based on Foata normal form. 5/280 useless extension candidates. Maximal degree in co-relation 888. Up to 251 conditions per place. [2022-12-12 18:42:06,705 INFO L137 encePairwiseOnDemand]: 47/50 looper letters, 30 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-12 18:42:06,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 217 flow [2022-12-12 18:42:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:42:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:42:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-12 18:42:06,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2022-12-12 18:42:06,725 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -23 predicate places. [2022-12-12 18:42:06,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 39 transitions, 217 flow [2022-12-12 18:42:06,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 39 transitions, 217 flow [2022-12-12 18:42:06,727 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 39 transitions, 217 flow [2022-12-12 18:42:06,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-12-12 18:42:06,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:06,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:06,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:42:06,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1473428681, now seen corresponding path program 1 times [2022-12-12 18:42:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:06,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691856595] [2022-12-12 18:42:06,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691856595] [2022-12-12 18:42:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691856595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:42:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824812810] [2022-12-12 18:42:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:42:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:42:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:42:06,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2022-12-12 18:42:06,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 39 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-12 18:42:06,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:06,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2022-12-12 18:42:06,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:07,053 INFO L130 PetriNetUnfolder]: 259/497 cut-off events. [2022-12-12 18:42:07,053 INFO L131 PetriNetUnfolder]: For 234/237 co-relation queries the response was YES. [2022-12-12 18:42:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 497 events. 259/497 cut-off events. For 234/237 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2353 event pairs, 25 based on Foata normal form. 34/457 useless extension candidates. Maximal degree in co-relation 1782. Up to 397 conditions per place. [2022-12-12 18:42:07,072 INFO L137 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 3 changer transitions 22/56 dead transitions. [2022-12-12 18:42:07,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 422 flow [2022-12-12 18:42:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:42:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:42:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-12 18:42:07,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31 [2022-12-12 18:42:07,074 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -20 predicate places. [2022-12-12 18:42:07,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 56 transitions, 422 flow [2022-12-12 18:42:07,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 34 transitions, 252 flow [2022-12-12 18:42:07,076 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 252 flow [2022-12-12 18:42:07,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-12 18:42:07,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:07,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:07,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:42:07,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1373281143, now seen corresponding path program 1 times [2022-12-12 18:42:07,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:07,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925953833] [2022-12-12 18:42:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:07,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925953833] [2022-12-12 18:42:07,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925953833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:07,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:07,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:42:07,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394817044] [2022-12-12 18:42:07,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:07,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:42:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:42:07,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:42:07,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2022-12-12 18:42:07,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-12-12 18:42:07,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:07,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2022-12-12 18:42:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:08,010 INFO L130 PetriNetUnfolder]: 135/265 cut-off events. [2022-12-12 18:42:08,010 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-12 18:42:08,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 265 events. 135/265 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 979 event pairs, 14 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 1206. Up to 221 conditions per place. [2022-12-12 18:42:08,014 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 34 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2022-12-12 18:42:08,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 439 flow [2022-12-12 18:42:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:42:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:42:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-12 18:42:08,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.272 [2022-12-12 18:42:08,019 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2022-12-12 18:42:08,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 47 transitions, 439 flow [2022-12-12 18:42:08,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 47 transitions, 439 flow [2022-12-12 18:42:08,020 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 47 transitions, 439 flow [2022-12-12 18:42:08,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-12-12 18:42:08,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:08,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:08,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:42:08,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 377929034, now seen corresponding path program 1 times [2022-12-12 18:42:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247620383] [2022-12-12 18:42:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:08,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247620383] [2022-12-12 18:42:08,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247620383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:08,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:08,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:42:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913708373] [2022-12-12 18:42:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:08,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:42:08,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:42:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:42:08,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2022-12-12 18:42:08,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 47 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2022-12-12 18:42:08,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:08,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2022-12-12 18:42:08,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:08,294 INFO L130 PetriNetUnfolder]: 154/321 cut-off events. [2022-12-12 18:42:08,294 INFO L131 PetriNetUnfolder]: For 559/565 co-relation queries the response was YES. [2022-12-12 18:42:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 321 events. 154/321 cut-off events. For 559/565 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1373 event pairs, 28 based on Foata normal form. 37/314 useless extension candidates. Maximal degree in co-relation 1683. Up to 253 conditions per place. [2022-12-12 18:42:08,296 INFO L137 encePairwiseOnDemand]: 41/50 looper letters, 34 selfloop transitions, 9 changer transitions 34/81 dead transitions. [2022-12-12 18:42:08,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 81 transitions, 886 flow [2022-12-12 18:42:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:42:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:42:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-12 18:42:08,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-12 18:42:08,297 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -13 predicate places. [2022-12-12 18:42:08,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 81 transitions, 886 flow [2022-12-12 18:42:08,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 47 transitions, 520 flow [2022-12-12 18:42:08,299 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 47 transitions, 520 flow [2022-12-12 18:42:08,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2022-12-12 18:42:08,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:08,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:42:08,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1648212186, now seen corresponding path program 1 times [2022-12-12 18:42:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305435646] [2022-12-12 18:42:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305435646] [2022-12-12 18:42:08,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305435646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:08,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:08,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:42:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666942189] [2022-12-12 18:42:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:08,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:42:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:42:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:42:08,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2022-12-12 18:42:08,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 47 transitions, 520 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2022-12-12 18:42:08,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:08,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2022-12-12 18:42:08,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:08,503 INFO L130 PetriNetUnfolder]: 56/162 cut-off events. [2022-12-12 18:42:08,503 INFO L131 PetriNetUnfolder]: For 362/368 co-relation queries the response was YES. [2022-12-12 18:42:08,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 162 events. 56/162 cut-off events. For 362/368 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 655 event pairs, 3 based on Foata normal form. 33/175 useless extension candidates. Maximal degree in co-relation 1009. Up to 129 conditions per place. [2022-12-12 18:42:08,504 INFO L137 encePairwiseOnDemand]: 41/50 looper letters, 26 selfloop transitions, 15 changer transitions 11/56 dead transitions. [2022-12-12 18:42:08,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 716 flow [2022-12-12 18:42:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:42:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:42:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-12 18:42:08,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25333333333333335 [2022-12-12 18:42:08,506 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -11 predicate places. [2022-12-12 18:42:08,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 56 transitions, 716 flow [2022-12-12 18:42:08,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 578 flow [2022-12-12 18:42:08,507 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 578 flow [2022-12-12 18:42:08,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2022-12-12 18:42:08,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:08,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:08,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:42:08,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -379428510, now seen corresponding path program 1 times [2022-12-12 18:42:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:08,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828811730] [2022-12-12 18:42:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:42:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:42:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:42:09,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828811730] [2022-12-12 18:42:09,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828811730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:42:09,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:42:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:42:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821115015] [2022-12-12 18:42:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:42:09,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:42:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:42:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:42:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:42:09,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2022-12-12 18:42:09,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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) [2022-12-12 18:42:09,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:42:09,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2022-12-12 18:42:09,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:42:09,202 INFO L130 PetriNetUnfolder]: 46/163 cut-off events. [2022-12-12 18:42:09,202 INFO L131 PetriNetUnfolder]: For 391/392 co-relation queries the response was YES. [2022-12-12 18:42:09,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 163 events. 46/163 cut-off events. For 391/392 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 728 event pairs, 0 based on Foata normal form. 10/150 useless extension candidates. Maximal degree in co-relation 1151. Up to 132 conditions per place. [2022-12-12 18:42:09,203 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 25 selfloop transitions, 5 changer transitions 21/57 dead transitions. [2022-12-12 18:42:09,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 848 flow [2022-12-12 18:42:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:42:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:42:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-12 18:42:09,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-12 18:42:09,205 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2022-12-12 18:42:09,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 57 transitions, 848 flow [2022-12-12 18:42:09,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 514 flow [2022-12-12 18:42:09,206 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 514 flow [2022-12-12 18:42:09,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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) [2022-12-12 18:42:09,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:42:09,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:09,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:42:09,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:42:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:42:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1551431996, now seen corresponding path program 2 times [2022-12-12 18:42:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:42:09,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797425923] [2022-12-12 18:42:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:42:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:42:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:42:09,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:42:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:42:09,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:42:09,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:42:09,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 18:42:09,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 18:42:09,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 18:42:09,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 18:42:09,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 18:42:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:42:09,301 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-12 18:42:09,305 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:42:09,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:42:09,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:42:09 BasicIcfg [2022-12-12 18:42:09,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:42:09,359 INFO L158 Benchmark]: Toolchain (without parser) took 10928.44ms. Allocated memory was 186.6MB in the beginning and 354.4MB in the end (delta: 167.8MB). Free memory was 150.0MB in the beginning and 218.6MB in the end (delta: -68.6MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,361 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:42:09,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.98ms. Allocated memory is still 186.6MB. Free memory was 150.0MB in the beginning and 125.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.31ms. Allocated memory is still 186.6MB. Free memory was 125.4MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,364 INFO L158 Benchmark]: Boogie Preprocessor took 41.13ms. Allocated memory is still 186.6MB. Free memory was 122.8MB in the beginning and 121.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,365 INFO L158 Benchmark]: RCFGBuilder took 587.00ms. Allocated memory is still 186.6MB. Free memory was 121.2MB in the beginning and 89.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,365 INFO L158 Benchmark]: TraceAbstraction took 9803.60ms. Allocated memory was 186.6MB in the beginning and 354.4MB in the end (delta: 167.8MB). Free memory was 88.7MB in the beginning and 218.6MB in the end (delta: -129.9MB). Peak memory consumption was 38.9MB. Max. memory is 8.0GB. [2022-12-12 18:42:09,369 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.09ms. Allocated memory is still 186.6MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.98ms. Allocated memory is still 186.6MB. Free memory was 150.0MB in the beginning and 125.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.31ms. Allocated memory is still 186.6MB. Free memory was 125.4MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.13ms. Allocated memory is still 186.6MB. Free memory was 122.8MB in the beginning and 121.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.00ms. Allocated memory is still 186.6MB. Free memory was 121.2MB in the beginning and 89.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9803.60ms. Allocated memory was 186.6MB in the beginning and 354.4MB in the end (delta: 167.8MB). Free memory was 88.7MB in the beginning and 218.6MB in the end (delta: -129.9MB). Peak memory consumption was 38.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 90 PlacesBefore, 56 PlacesAfterwards, 85 TransitionsBefore, 50 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 4 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 1545, independent unconditional: 0, dependent: 87, dependent conditional: 87, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 971, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 971, independent: 929, independent conditional: 0, independent unconditional: 929, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1632, independent: 610, independent conditional: 0, independent unconditional: 610, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 971, unknown conditional: 0, unknown unconditional: 971] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1580, Positive conditional cache size: 0, Positive unconditional cache size: 1580, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-2, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=-1, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 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) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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 [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 4 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-12-12 18:42:09,388 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...