/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:36:08,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:36:08,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:36:08,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:36:08,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:36:08,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:36:08,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:36:08,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:36:08,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:36:08,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:36:08,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:36:08,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:36:08,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:36:08,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:36:08,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:36:08,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:36:08,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:36:08,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:36:08,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:36:08,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:36:08,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:36:08,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:36:08,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:36:08,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:36:08,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:36:08,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:36:08,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:36:08,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:36:08,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:36:08,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:36:08,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:36:08,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:36:08,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:36:08,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:36:08,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:36:08,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:36:08,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:36:08,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:36:08,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:36:08,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:36:08,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:36:08,755 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 14:36:08,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:36:08,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:36:08,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:36:08,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:36:08,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:36:08,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:36:08,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:36:08,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:36:08,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:36:08,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:36:08,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:36:08,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:36:08,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:36:08,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:36:08,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:36:08,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:36:08,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:36:08,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:36:08,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:36:08,796 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 [2022-12-12 14:36:09,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:36:09,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:36:09,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:36:09,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:36:09,100 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:36:09,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:36:10,360 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:36:10,640 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:36:10,641 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:36:10,657 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22d222e0/6563dd8302a944d881370f3549b5ab71/FLAGf39b8ebe5 [2022-12-12 14:36:10,681 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22d222e0/6563dd8302a944d881370f3549b5ab71 [2022-12-12 14:36:10,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:36:10,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:36:10,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:36:10,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:36:10,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:36:10,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:36:10" (1/1) ... [2022-12-12 14:36:10,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5753812e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:10, skipping insertion in model container [2022-12-12 14:36:10,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:36:10" (1/1) ... [2022-12-12 14:36:10,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:36:10,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:36:10,919 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 14:36:11,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:36:11,146 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:36:11,159 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 14:36:11,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:36:11,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:36:11,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:36:11,242 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:36:11,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11 WrapperNode [2022-12-12 14:36:11,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:36:11,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:36:11,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:36:11,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:36:11,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,310 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-12 14:36:11,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:36:11,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:36:11,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:36:11,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:36:11,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,353 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:36:11,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:36:11,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:36:11,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:36:11,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (1/1) ... [2022-12-12 14:36:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:36:11,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:36:11,417 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 14:36:11,443 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 14:36:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:36:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:36:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:36:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:36:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:36:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:36:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:36:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:36:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:36:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:36:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:36:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:36:11,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:36:11,465 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 14:36:11,637 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:36:11,639 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:36:11,926 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:36:12,059 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:36:12,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:36:12,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:36:12 BoogieIcfgContainer [2022-12-12 14:36:12,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:36:12,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:36:12,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:36:12,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:36:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:36:10" (1/3) ... [2022-12-12 14:36:12,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a1a1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:36:12, skipping insertion in model container [2022-12-12 14:36:12,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:36:11" (2/3) ... [2022-12-12 14:36:12,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a1a1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:36:12, skipping insertion in model container [2022-12-12 14:36:12,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:36:12" (3/3) ... [2022-12-12 14:36:12,069 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:36:12,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:36:12,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:36:12,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:36:12,165 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:36:12,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-12 14:36:12,255 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-12 14:36:12,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:36:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 14:36:12,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-12 14:36:12,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-12 14:36:12,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:36:12,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-12 14:36:12,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-12 14:36:12,323 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-12 14:36:12,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:36:12,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 14:36:12,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-12 14:36:12,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-12 14:36:16,270 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-12 14:36:16,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:36:16,293 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;@52c72990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:36:16,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 14:36:16,295 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-12 14:36:16,296 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:36:16,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:16,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 14:36:16,297 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 14:36:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 421872, now seen corresponding path program 1 times [2022-12-12 14:36:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:16,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951937874] [2022-12-12 14:36:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:16,668 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 14:36:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:16,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951937874] [2022-12-12 14:36:16,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951937874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:16,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:16,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:36:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517002590] [2022-12-12 14:36:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:16,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:36:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:36:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:36:16,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2022-12-12 14:36:16,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 112 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 14:36:16,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:16,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2022-12-12 14:36:16,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:17,098 INFO L130 PetriNetUnfolder]: 1526/2888 cut-off events. [2022-12-12 14:36:17,098 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 14:36:17,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 2888 events. 1526/2888 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 20453 event pairs, 154 based on Foata normal form. 0/1688 useless extension candidates. Maximal degree in co-relation 5371. Up to 2133 conditions per place. [2022-12-12 14:36:17,108 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 28 selfloop transitions, 2 changer transitions 47/84 dead transitions. [2022-12-12 14:36:17,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 329 flow [2022-12-12 14:36:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:36:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:36:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-12 14:36:17,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2022-12-12 14:36:17,120 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 112 flow. Second operand 3 states and 107 transitions. [2022-12-12 14:36:17,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 329 flow [2022-12-12 14:36:17,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:36:17,124 INFO L231 Difference]: Finished difference. Result has 56 places, 25 transitions, 58 flow [2022-12-12 14:36:17,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=56, PETRI_TRANSITIONS=25} [2022-12-12 14:36:17,129 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2022-12-12 14:36:17,130 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 25 transitions, 58 flow [2022-12-12 14:36:17,130 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 14:36:17,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:17,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:17,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:36:17,131 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 14:36:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1184424965, now seen corresponding path program 1 times [2022-12-12 14:36:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:17,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413720901] [2022-12-12 14:36:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:17,367 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 14:36:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413720901] [2022-12-12 14:36:17,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413720901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:17,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:17,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:36:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175147252] [2022-12-12 14:36:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:17,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:36:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:36:17,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:36:17,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 14:36:17,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:36:17,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:17,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 14:36:17,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:17,525 INFO L130 PetriNetUnfolder]: 505/952 cut-off events. [2022-12-12 14:36:17,525 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-12 14:36:17,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 952 events. 505/952 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5169 event pairs, 139 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1893. Up to 547 conditions per place. [2022-12-12 14:36:17,531 INFO L137 encePairwiseOnDemand]: 46/53 looper letters, 25 selfloop transitions, 6 changer transitions 2/38 dead transitions. [2022-12-12 14:36:17,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 152 flow [2022-12-12 14:36:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:36:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:36:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-12 14:36:17,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3270440251572327 [2022-12-12 14:36:17,533 INFO L175 Difference]: Start difference. First operand has 56 places, 25 transitions, 58 flow. Second operand 3 states and 52 transitions. [2022-12-12 14:36:17,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 152 flow [2022-12-12 14:36:17,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:36:17,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 90 flow [2022-12-12 14:36:17,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-12 14:36:17,538 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -25 predicate places. [2022-12-12 14:36:17,538 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 90 flow [2022-12-12 14:36:17,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:36:17,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:17,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:17,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:36:17,538 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 14:36:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1937531836, now seen corresponding path program 1 times [2022-12-12 14:36:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:17,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448456937] [2022-12-12 14:36:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:17,718 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 14:36:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448456937] [2022-12-12 14:36:17,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448456937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:17,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:17,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:36:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347245734] [2022-12-12 14:36:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:17,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:36:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:17,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:36:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:36:17,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 14:36:17,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 14:36:17,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:17,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 14:36:17,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:17,858 INFO L130 PetriNetUnfolder]: 364/712 cut-off events. [2022-12-12 14:36:17,858 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-12 14:36:17,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 712 events. 364/712 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3558 event pairs, 108 based on Foata normal form. 12/609 useless extension candidates. Maximal degree in co-relation 1632. Up to 313 conditions per place. [2022-12-12 14:36:17,862 INFO L137 encePairwiseOnDemand]: 48/53 looper letters, 31 selfloop transitions, 5 changer transitions 1/42 dead transitions. [2022-12-12 14:36:17,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 198 flow [2022-12-12 14:36:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:36:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:36:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-12 14:36:17,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2830188679245283 [2022-12-12 14:36:17,866 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 90 flow. Second operand 4 states and 60 transitions. [2022-12-12 14:36:17,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 198 flow [2022-12-12 14:36:17,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:36:17,871 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 100 flow [2022-12-12 14:36:17,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-12 14:36:17,872 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -23 predicate places. [2022-12-12 14:36:17,873 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 100 flow [2022-12-12 14:36:17,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 14:36:17,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:17,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:17,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:36:17,878 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 14:36:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -95676261, now seen corresponding path program 1 times [2022-12-12 14:36:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:17,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639049920] [2022-12-12 14:36:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:18,033 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 14:36:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639049920] [2022-12-12 14:36:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639049920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:18,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:18,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:36:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630222023] [2022-12-12 14:36:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:18,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:36:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:36:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:36:18,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 14:36:18,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 100 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 14:36:18,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:18,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 14:36:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:18,129 INFO L130 PetriNetUnfolder]: 233/506 cut-off events. [2022-12-12 14:36:18,130 INFO L131 PetriNetUnfolder]: For 254/255 co-relation queries the response was YES. [2022-12-12 14:36:18,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 506 events. 233/506 cut-off events. For 254/255 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2548 event pairs, 58 based on Foata normal form. 23/406 useless extension candidates. Maximal degree in co-relation 1207. Up to 445 conditions per place. [2022-12-12 14:36:18,132 INFO L137 encePairwiseOnDemand]: 45/53 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-12 14:36:18,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 229 flow [2022-12-12 14:36:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:36:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:36:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-12 14:36:18,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3270440251572327 [2022-12-12 14:36:18,136 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 100 flow. Second operand 3 states and 52 transitions. [2022-12-12 14:36:18,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 229 flow [2022-12-12 14:36:18,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:36:18,139 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 144 flow [2022-12-12 14:36:18,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-12 14:36:18,140 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -22 predicate places. [2022-12-12 14:36:18,140 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 144 flow [2022-12-12 14:36:18,140 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 14:36:18,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:18,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:18,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:36:18,141 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 14:36:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash -916603559, now seen corresponding path program 1 times [2022-12-12 14:36:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:18,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765552116] [2022-12-12 14:36:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:18,347 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 14:36:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:18,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765552116] [2022-12-12 14:36:18,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765552116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:18,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:18,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:36:18,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979322297] [2022-12-12 14:36:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:18,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:36:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:36:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:36:18,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 14:36:18,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 144 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 14:36:18,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:18,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 14:36:18,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:18,418 INFO L130 PetriNetUnfolder]: 71/224 cut-off events. [2022-12-12 14:36:18,419 INFO L131 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2022-12-12 14:36:18,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 224 events. 71/224 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1073 event pairs, 13 based on Foata normal form. 42/209 useless extension candidates. Maximal degree in co-relation 682. Up to 103 conditions per place. [2022-12-12 14:36:18,420 INFO L137 encePairwiseOnDemand]: 45/53 looper letters, 23 selfloop transitions, 13 changer transitions 2/43 dead transitions. [2022-12-12 14:36:18,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 259 flow [2022-12-12 14:36:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:36:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:36:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-12 14:36:18,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27358490566037735 [2022-12-12 14:36:18,421 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 144 flow. Second operand 4 states and 58 transitions. [2022-12-12 14:36:18,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 259 flow [2022-12-12 14:36:18,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:36:18,426 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 170 flow [2022-12-12 14:36:18,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-12 14:36:18,428 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -20 predicate places. [2022-12-12 14:36:18,428 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 170 flow [2022-12-12 14:36:18,428 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 14:36:18,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:18,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:36:18,429 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 14:36:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1108593990, now seen corresponding path program 1 times [2022-12-12 14:36:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:18,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213105541] [2022-12-12 14:36:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:18,865 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 14:36:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213105541] [2022-12-12 14:36:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213105541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:18,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:18,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:36:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090953138] [2022-12-12 14:36:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:18,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:36:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:36:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:36:18,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 53 [2022-12-12 14:36:18,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 14:36:18,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:18,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 53 [2022-12-12 14:36:18,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:19,037 INFO L130 PetriNetUnfolder]: 91/310 cut-off events. [2022-12-12 14:36:19,037 INFO L131 PetriNetUnfolder]: For 238/248 co-relation queries the response was YES. [2022-12-12 14:36:19,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 310 events. 91/310 cut-off events. For 238/248 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1833 event pairs, 5 based on Foata normal form. 19/282 useless extension candidates. Maximal degree in co-relation 1059. Up to 172 conditions per place. [2022-12-12 14:36:19,039 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 24 selfloop transitions, 3 changer transitions 37/72 dead transitions. [2022-12-12 14:36:19,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 513 flow [2022-12-12 14:36:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:36:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:36:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-12 14:36:19,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2830188679245283 [2022-12-12 14:36:19,041 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 170 flow. Second operand 6 states and 90 transitions. [2022-12-12 14:36:19,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 513 flow [2022-12-12 14:36:19,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 451 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-12 14:36:19,063 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 163 flow [2022-12-12 14:36:19,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-12 14:36:19,064 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -14 predicate places. [2022-12-12 14:36:19,064 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 163 flow [2022-12-12 14:36:19,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 14:36:19,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:19,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:19,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:36:19,065 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 14:36:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2027335847, now seen corresponding path program 1 times [2022-12-12 14:36:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:19,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509769657] [2022-12-12 14:36:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:19,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:36:19,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:36:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:36:19,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:36:19,153 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:36:19,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 14:36:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 14:36:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 14:36:19,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 14:36:19,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 14:36:19,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:36:19,156 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:19,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:36:19,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:36:19,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:36:19 BasicIcfg [2022-12-12 14:36:19,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:36:19,221 INFO L158 Benchmark]: Toolchain (without parser) took 8537.17ms. Allocated memory was 163.6MB in the beginning and 250.6MB in the end (delta: 87.0MB). Free memory was 119.9MB in the beginning and 194.7MB in the end (delta: -74.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-12-12 14:36:19,221 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:36:19,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.28ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 94.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 14:36:19,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 92.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:36:19,222 INFO L158 Benchmark]: Boogie Preprocessor took 44.61ms. Allocated memory is still 163.6MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:36:19,222 INFO L158 Benchmark]: RCFGBuilder took 703.75ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 59.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 14:36:19,223 INFO L158 Benchmark]: TraceAbstraction took 7157.54ms. Allocated memory was 163.6MB in the beginning and 250.6MB in the end (delta: 87.0MB). Free memory was 58.5MB in the beginning and 194.7MB in the end (delta: -136.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:36:19,224 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.16ms. Allocated memory is still 163.6MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 556.28ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 94.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 92.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.61ms. Allocated memory is still 163.6MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 703.75ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 59.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7157.54ms. Allocated memory was 163.6MB in the beginning and 250.6MB in the end (delta: 87.0MB). Free memory was 58.5MB in the beginning and 194.7MB in the end (delta: -136.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 94 PlacesBefore, 59 PlacesAfterwards, 89 TransitionsBefore, 53 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 2 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2016, independent: 1918, independent conditional: 1918, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2016, independent: 1918, independent conditional: 0, independent unconditional: 1918, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2016, independent: 1918, independent conditional: 0, independent unconditional: 1918, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2016, independent: 1918, independent conditional: 0, independent unconditional: 1918, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1082, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1082, independent: 1048, independent conditional: 0, independent unconditional: 1048, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2016, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1082, unknown conditional: 0, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 2059, Positive cache size: 2030, Positive conditional cache size: 0, Positive unconditional cache size: 2030, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1089, ((void *)0), P0, ((void *)0))=-1, t1089={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1090, ((void *)0), P1, ((void *)0))=0, t1089={5:0}, t1090={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089={5:0}, t1090={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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: 818]: 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: 816]: 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, 111 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: 7.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 14:36:19,247 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...