/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 05:00:30,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 05:00:30,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 05:00:30,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 05:00:30,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 05:00:30,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 05:00:30,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 05:00:30,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 05:00:30,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 05:00:30,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 05:00:30,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 05:00:30,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 05:00:30,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 05:00:30,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 05:00:30,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 05:00:30,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 05:00:30,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 05:00:30,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 05:00:30,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 05:00:30,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 05:00:30,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 05:00:30,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 05:00:30,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 05:00:30,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 05:00:30,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 05:00:30,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 05:00:30,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 05:00:30,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 05:00:30,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 05:00:30,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 05:00:30,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 05:00:30,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 05:00:30,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 05:00:30,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 05:00:30,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 05:00:30,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 05:00:30,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 05:00:30,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 05:00:30,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 05:00:30,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 05:00:30,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 05:00:30,265 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-NoLbe-Before.epf [2022-01-19 05:00:30,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 05:00:30,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 05:00:30,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 05:00:30,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 05:00:30,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 05:00:30,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 05:00:30,299 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 05:00:30,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 05:00:30,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 05:00:30,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 05:00:30,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 05:00:30,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 05:00:30,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 05:00:30,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 05:00:30,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 05:00:30,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:00:30,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 05:00:30,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 05:00:30,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 05:00:30,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 05:00:30,303 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 05:00:30,303 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-01-19 05:00:30,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 05:00:30,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 05:00:30,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 05:00:30,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 05:00:30,570 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 05:00:30,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 05:00:30,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c58cc0b/6ed6af5abd024d1886df2244bc9b87e9/FLAGfd8de1c4c [2022-01-19 05:00:31,114 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 05:00:31,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 05:00:31,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c58cc0b/6ed6af5abd024d1886df2244bc9b87e9/FLAGfd8de1c4c [2022-01-19 05:00:31,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c58cc0b/6ed6af5abd024d1886df2244bc9b87e9 [2022-01-19 05:00:31,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 05:00:31,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 05:00:31,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 05:00:31,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 05:00:31,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 05:00:31,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:31,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4908c090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31, skipping insertion in model container [2022-01-19 05:00:31,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:31,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 05:00:31,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 05:00:31,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-19 05:00:31,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:00:31,796 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 05:00:31,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-19 05:00:31,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:00:31,917 INFO L208 MainTranslator]: Completed translation [2022-01-19 05:00:31,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31 WrapperNode [2022-01-19 05:00:31,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 05:00:31,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 05:00:31,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 05:00:31,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 05:00:31,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:31,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:31,988 INFO L137 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2022-01-19 05:00:31,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 05:00:31,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 05:00:31,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 05:00:31,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 05:00:31,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:31,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 05:00:32,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 05:00:32,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 05:00:32,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 05:00:32,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (1/1) ... [2022-01-19 05:00:32,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:00:32,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:00:32,076 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-01-19 05:00:32,104 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-01-19 05:00:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 05:00:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 05:00:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 05:00:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 05:00:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 05:00:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 05:00:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 05:00:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 05:00:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 05:00:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 05:00:32,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 05:00:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 05:00:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 05:00:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 05:00:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 05:00:32,124 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 05:00:32,296 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 05:00:32,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 05:00:32,799 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 05:00:33,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 05:00:33,109 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 05:00:33,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:00:33 BoogieIcfgContainer [2022-01-19 05:00:33,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 05:00:33,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 05:00:33,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 05:00:33,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 05:00:33,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:00:31" (1/3) ... [2022-01-19 05:00:33,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10784759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:00:33, skipping insertion in model container [2022-01-19 05:00:33,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:31" (2/3) ... [2022-01-19 05:00:33,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10784759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:00:33, skipping insertion in model container [2022-01-19 05:00:33,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:00:33" (3/3) ... [2022-01-19 05:00:33,119 INFO L111 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 05:00:33,124 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 05:00:33,124 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 05:00:33,124 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 05:00:33,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,176 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,176 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,177 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,177 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,177 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,177 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,178 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,178 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,178 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,178 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,178 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,179 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,179 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,180 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,180 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,180 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,180 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,181 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,188 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,192 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,193 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,193 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,193 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,194 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,214 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,214 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,220 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,220 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,220 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,221 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,221 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,224 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,225 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,225 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,225 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,225 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,225 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,226 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,226 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,229 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:00:33,232 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:00:33,281 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:00:33,288 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 05:00:33,288 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 05:00:33,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 05:00:33,350 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-01-19 05:00:33,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:00:33,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 05:00:33,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 05:00:33,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-01-19 05:00:33,369 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-01-19 05:00:33,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:00:33,370 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:33,370 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:33,371 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2121349431, now seen corresponding path program 1 times [2022-01-19 05:00:33,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:33,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76371144] [2022-01-19 05:00:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:33,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:33,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76371144] [2022-01-19 05:00:33,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76371144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:33,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:33,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 05:00:33,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210737833] [2022-01-19 05:00:33,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:33,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:00:33,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:00:33,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:00:33,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-01-19 05:00:33,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-01-19 05:00:33,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:33,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-01-19 05:00:33,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:33,941 INFO L129 PetriNetUnfolder]: 58/317 cut-off events. [2022-01-19 05:00:33,942 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 05:00:33,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 317 events. 58/317 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1303 event pairs, 44 based on Foata normal form. 9/299 useless extension candidates. Maximal degree in co-relation 395. Up to 79 conditions per place. [2022-01-19 05:00:33,948 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-01-19 05:00:33,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-01-19 05:00:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:00:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:00:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-01-19 05:00:33,967 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-01-19 05:00:33,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-01-19 05:00:33,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-01-19 05:00:33,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:33,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-01-19 05:00:33,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-01-19 05:00:33,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-01-19 05:00:33,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-01-19 05:00:33,989 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-01-19 05:00:33,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-01-19 05:00:33,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 05:00:33,997 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-01-19 05:00:33,999 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-01-19 05:00:34,004 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-01-19 05:00:34,004 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-01-19 05:00:34,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-01-19 05:00:34,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:34,005 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:34,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 05:00:34,006 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1675535656, now seen corresponding path program 1 times [2022-01-19 05:00:34,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:34,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423755414] [2022-01-19 05:00:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:34,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:34,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423755414] [2022-01-19 05:00:34,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423755414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:34,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:34,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:00:34,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842829203] [2022-01-19 05:00:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:34,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:00:34,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:34,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:00:34,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:00:34,317 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-01-19 05:00:34,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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-01-19 05:00:34,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:34,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-01-19 05:00:34,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:35,252 INFO L129 PetriNetUnfolder]: 1508/3975 cut-off events. [2022-01-19 05:00:35,252 INFO L130 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-01-19 05:00:35,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 3975 events. 1508/3975 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 33000 event pairs, 187 based on Foata normal form. 0/3852 useless extension candidates. Maximal degree in co-relation 6416. Up to 901 conditions per place. [2022-01-19 05:00:35,274 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 32 selfloop transitions, 5 changer transitions 81/191 dead transitions. [2022-01-19 05:00:35,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 191 transitions, 620 flow [2022-01-19 05:00:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 05:00:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 05:00:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1241 transitions. [2022-01-19 05:00:35,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8447923757658271 [2022-01-19 05:00:35,278 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1241 transitions. [2022-01-19 05:00:35,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1241 transitions. [2022-01-19 05:00:35,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:35,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1241 transitions. [2022-01-19 05:00:35,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.46153846153847) internal successors, (1241), 13 states have internal predecessors, (1241), 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-01-19 05:00:35,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:35,286 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:35,286 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 13 states and 1241 transitions. [2022-01-19 05:00:35,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 191 transitions, 620 flow [2022-01-19 05:00:35,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 05:00:35,290 INFO L242 Difference]: Finished difference. Result has 137 places, 97 transitions, 266 flow [2022-01-19 05:00:35,291 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=266, PETRI_PLACES=137, PETRI_TRANSITIONS=97} [2022-01-19 05:00:35,291 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2022-01-19 05:00:35,291 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 97 transitions, 266 flow [2022-01-19 05:00:35,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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-01-19 05:00:35,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:35,292 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:35,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 05:00:35,293 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -899790441, now seen corresponding path program 1 times [2022-01-19 05:00:35,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:35,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301567270] [2022-01-19 05:00:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:35,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:35,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:35,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301567270] [2022-01-19 05:00:35,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301567270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:35,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:35,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:00:35,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278041109] [2022-01-19 05:00:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:35,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:00:35,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:00:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:00:35,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-01-19 05:00:35,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 97 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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-01-19 05:00:35,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:35,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-01-19 05:00:35,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:36,143 INFO L129 PetriNetUnfolder]: 994/2246 cut-off events. [2022-01-19 05:00:36,143 INFO L130 PetriNetUnfolder]: For 3529/3532 co-relation queries the response was YES. [2022-01-19 05:00:36,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 2246 events. 994/2246 cut-off events. For 3529/3532 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15243 event pairs, 235 based on Foata normal form. 52/2214 useless extension candidates. Maximal degree in co-relation 5913. Up to 690 conditions per place. [2022-01-19 05:00:36,162 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 33 selfloop transitions, 12 changer transitions 61/179 dead transitions. [2022-01-19 05:00:36,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 179 transitions, 894 flow [2022-01-19 05:00:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 05:00:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 05:00:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1237 transitions. [2022-01-19 05:00:36,165 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8420694349897889 [2022-01-19 05:00:36,165 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1237 transitions. [2022-01-19 05:00:36,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1237 transitions. [2022-01-19 05:00:36,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:36,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1237 transitions. [2022-01-19 05:00:36,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.15384615384616) internal successors, (1237), 13 states have internal predecessors, (1237), 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-01-19 05:00:36,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:36,173 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:36,173 INFO L186 Difference]: Start difference. First operand has 137 places, 97 transitions, 266 flow. Second operand 13 states and 1237 transitions. [2022-01-19 05:00:36,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 179 transitions, 894 flow [2022-01-19 05:00:36,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 179 transitions, 842 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-01-19 05:00:36,192 INFO L242 Difference]: Finished difference. Result has 135 places, 102 transitions, 355 flow [2022-01-19 05:00:36,192 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=355, PETRI_PLACES=135, PETRI_TRANSITIONS=102} [2022-01-19 05:00:36,194 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2022-01-19 05:00:36,195 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 355 flow [2022-01-19 05:00:36,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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-01-19 05:00:36,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:36,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:36,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 05:00:36,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 759698488, now seen corresponding path program 1 times [2022-01-19 05:00:36,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938312145] [2022-01-19 05:00:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:36,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:36,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938312145] [2022-01-19 05:00:36,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938312145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:36,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:36,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:00:36,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030773169] [2022-01-19 05:00:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:36,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:00:36,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:00:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:00:36,294 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:00:36,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-01-19 05:00:36,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:36,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:00:36,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:37,130 INFO L129 PetriNetUnfolder]: 2074/4218 cut-off events. [2022-01-19 05:00:37,130 INFO L130 PetriNetUnfolder]: For 4162/4534 co-relation queries the response was YES. [2022-01-19 05:00:37,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9775 conditions, 4218 events. 2074/4218 cut-off events. For 4162/4534 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31865 event pairs, 120 based on Foata normal form. 0/4031 useless extension candidates. Maximal degree in co-relation 9700. Up to 1100 conditions per place. [2022-01-19 05:00:37,169 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 60 selfloop transitions, 13 changer transitions 22/176 dead transitions. [2022-01-19 05:00:37,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 176 transitions, 802 flow [2022-01-19 05:00:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 05:00:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 05:00:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 979 transitions. [2022-01-19 05:00:37,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8663716814159292 [2022-01-19 05:00:37,172 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 979 transitions. [2022-01-19 05:00:37,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 979 transitions. [2022-01-19 05:00:37,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:37,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 979 transitions. [2022-01-19 05:00:37,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.9) internal successors, (979), 10 states have internal predecessors, (979), 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-01-19 05:00:37,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-01-19 05:00:37,179 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-01-19 05:00:37,179 INFO L186 Difference]: Start difference. First operand has 135 places, 102 transitions, 355 flow. Second operand 10 states and 979 transitions. [2022-01-19 05:00:37,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 176 transitions, 802 flow [2022-01-19 05:00:37,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 176 transitions, 772 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-01-19 05:00:37,192 INFO L242 Difference]: Finished difference. Result has 129 places, 113 transitions, 423 flow [2022-01-19 05:00:37,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=423, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2022-01-19 05:00:37,194 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-01-19 05:00:37,194 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 423 flow [2022-01-19 05:00:37,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-01-19 05:00:37,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:37,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:37,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 05:00:37,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -470247433, now seen corresponding path program 1 times [2022-01-19 05:00:37,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:37,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226113384] [2022-01-19 05:00:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:37,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:37,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:37,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226113384] [2022-01-19 05:00:37,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226113384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:37,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:37,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:00:37,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070559069] [2022-01-19 05:00:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:37,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:00:37,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:00:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:00:37,323 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:00:37,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 423 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-01-19 05:00:37,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:37,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:00:37,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:38,133 INFO L129 PetriNetUnfolder]: 1749/3820 cut-off events. [2022-01-19 05:00:38,134 INFO L130 PetriNetUnfolder]: For 5846/6181 co-relation queries the response was YES. [2022-01-19 05:00:38,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11095 conditions, 3820 events. 1749/3820 cut-off events. For 5846/6181 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 30802 event pairs, 115 based on Foata normal form. 69/3780 useless extension candidates. Maximal degree in co-relation 11023. Up to 657 conditions per place. [2022-01-19 05:00:38,161 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 70 selfloop transitions, 26 changer transitions 34/211 dead transitions. [2022-01-19 05:00:38,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 211 transitions, 1189 flow [2022-01-19 05:00:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 05:00:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 05:00:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1272 transitions. [2022-01-19 05:00:38,164 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8658951667801226 [2022-01-19 05:00:38,164 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1272 transitions. [2022-01-19 05:00:38,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1272 transitions. [2022-01-19 05:00:38,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:38,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1272 transitions. [2022-01-19 05:00:38,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.84615384615384) internal successors, (1272), 13 states have internal predecessors, (1272), 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-01-19 05:00:38,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:38,170 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-01-19 05:00:38,170 INFO L186 Difference]: Start difference. First operand has 129 places, 113 transitions, 423 flow. Second operand 13 states and 1272 transitions. [2022-01-19 05:00:38,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 211 transitions, 1189 flow [2022-01-19 05:00:38,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 211 transitions, 1181 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 05:00:38,190 INFO L242 Difference]: Finished difference. Result has 143 places, 131 transitions, 632 flow [2022-01-19 05:00:38,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=632, PETRI_PLACES=143, PETRI_TRANSITIONS=131} [2022-01-19 05:00:38,191 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-01-19 05:00:38,191 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 632 flow [2022-01-19 05:00:38,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-01-19 05:00:38,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:38,191 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:38,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 05:00:38,192 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1785934609, now seen corresponding path program 1 times [2022-01-19 05:00:38,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:38,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847351266] [2022-01-19 05:00:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:38,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:38,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:38,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847351266] [2022-01-19 05:00:38,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847351266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:38,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:38,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:00:38,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756945721] [2022-01-19 05:00:38,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:38,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:00:38,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:00:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:00:38,344 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-01-19 05:00:38,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 89.25) internal successors, (714), 8 states have internal predecessors, (714), 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-01-19 05:00:38,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:38,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-01-19 05:00:38,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:38,835 INFO L129 PetriNetUnfolder]: 593/2689 cut-off events. [2022-01-19 05:00:38,835 INFO L130 PetriNetUnfolder]: For 5935/6148 co-relation queries the response was YES. [2022-01-19 05:00:38,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7984 conditions, 2689 events. 593/2689 cut-off events. For 5935/6148 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28622 event pairs, 60 based on Foata normal form. 13/2564 useless extension candidates. Maximal degree in co-relation 7905. Up to 600 conditions per place. [2022-01-19 05:00:38,862 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 34 selfloop transitions, 8 changer transitions 35/179 dead transitions. [2022-01-19 05:00:38,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 179 transitions, 1020 flow [2022-01-19 05:00:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 05:00:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 05:00:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 768 transitions. [2022-01-19 05:00:38,869 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8495575221238938 [2022-01-19 05:00:38,869 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 768 transitions. [2022-01-19 05:00:38,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 768 transitions. [2022-01-19 05:00:38,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:38,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 768 transitions. [2022-01-19 05:00:38,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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-01-19 05:00:38,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 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-01-19 05:00:38,874 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 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-01-19 05:00:38,874 INFO L186 Difference]: Start difference. First operand has 143 places, 131 transitions, 632 flow. Second operand 8 states and 768 transitions. [2022-01-19 05:00:38,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 179 transitions, 1020 flow [2022-01-19 05:00:38,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 179 transitions, 912 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-01-19 05:00:38,956 INFO L242 Difference]: Finished difference. Result has 148 places, 129 transitions, 536 flow [2022-01-19 05:00:38,957 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2022-01-19 05:00:38,957 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2022-01-19 05:00:38,957 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 536 flow [2022-01-19 05:00:38,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.25) internal successors, (714), 8 states have internal predecessors, (714), 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-01-19 05:00:38,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:38,958 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:38,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 05:00:38,958 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1832749191, now seen corresponding path program 2 times [2022-01-19 05:00:38,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655523848] [2022-01-19 05:00:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:38,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:39,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:39,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655523848] [2022-01-19 05:00:39,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655523848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:39,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:39,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:00:39,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922114792] [2022-01-19 05:00:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:39,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:00:39,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:00:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:00:39,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:00:39,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 536 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-01-19 05:00:39,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:39,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:00:39,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:39,792 INFO L129 PetriNetUnfolder]: 1476/3276 cut-off events. [2022-01-19 05:00:39,792 INFO L130 PetriNetUnfolder]: For 4704/4957 co-relation queries the response was YES. [2022-01-19 05:00:39,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 3276 events. 1476/3276 cut-off events. For 4704/4957 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26086 event pairs, 119 based on Foata normal form. 29/3231 useless extension candidates. Maximal degree in co-relation 9266. Up to 402 conditions per place. [2022-01-19 05:00:39,819 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 41 selfloop transitions, 18 changer transitions 65/203 dead transitions. [2022-01-19 05:00:39,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 203 transitions, 1150 flow [2022-01-19 05:00:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:00:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:00:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1528 transitions. [2022-01-19 05:00:39,823 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8451327433628318 [2022-01-19 05:00:39,824 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1528 transitions. [2022-01-19 05:00:39,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1528 transitions. [2022-01-19 05:00:39,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:39,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1528 transitions. [2022-01-19 05:00:39,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.5) internal successors, (1528), 16 states have internal predecessors, (1528), 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-01-19 05:00:39,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 05:00:39,831 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-01-19 05:00:39,831 INFO L186 Difference]: Start difference. First operand has 148 places, 129 transitions, 536 flow. Second operand 16 states and 1528 transitions. [2022-01-19 05:00:39,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 203 transitions, 1150 flow [2022-01-19 05:00:39,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 203 transitions, 1083 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-01-19 05:00:39,861 INFO L242 Difference]: Finished difference. Result has 159 places, 116 transitions, 480 flow [2022-01-19 05:00:39,861 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=480, PETRI_PLACES=159, PETRI_TRANSITIONS=116} [2022-01-19 05:00:39,862 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 41 predicate places. [2022-01-19 05:00:39,862 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 116 transitions, 480 flow [2022-01-19 05:00:39,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-01-19 05:00:39,862 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:39,863 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:39,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 05:00:39,863 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1191961134, now seen corresponding path program 1 times [2022-01-19 05:00:39,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:39,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57615749] [2022-01-19 05:00:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:39,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:40,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:40,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57615749] [2022-01-19 05:00:40,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57615749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:40,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:40,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:00:40,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768006495] [2022-01-19 05:00:40,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:40,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:00:40,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:40,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:00:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:00:40,058 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2022-01-19 05:00:40,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 116 transitions, 480 flow. Second operand has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 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-01-19 05:00:40,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:40,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2022-01-19 05:00:40,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:40,517 INFO L129 PetriNetUnfolder]: 217/1543 cut-off events. [2022-01-19 05:00:40,517 INFO L130 PetriNetUnfolder]: For 2713/2839 co-relation queries the response was YES. [2022-01-19 05:00:40,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 1543 events. 217/1543 cut-off events. For 2713/2839 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15930 event pairs, 4 based on Foata normal form. 1/1460 useless extension candidates. Maximal degree in co-relation 3862. Up to 232 conditions per place. [2022-01-19 05:00:40,529 INFO L132 encePairwiseOnDemand]: 97/113 looper letters, 37 selfloop transitions, 28 changer transitions 9/157 dead transitions. [2022-01-19 05:00:40,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 818 flow [2022-01-19 05:00:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 05:00:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 05:00:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1043 transitions. [2022-01-19 05:00:40,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7691740412979351 [2022-01-19 05:00:40,532 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1043 transitions. [2022-01-19 05:00:40,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1043 transitions. [2022-01-19 05:00:40,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:40,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1043 transitions. [2022-01-19 05:00:40,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.91666666666667) internal successors, (1043), 12 states have internal predecessors, (1043), 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-01-19 05:00:40,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-01-19 05:00:40,540 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-01-19 05:00:40,541 INFO L186 Difference]: Start difference. First operand has 159 places, 116 transitions, 480 flow. Second operand 12 states and 1043 transitions. [2022-01-19 05:00:40,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 818 flow [2022-01-19 05:00:40,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 157 transitions, 741 flow, removed 25 selfloop flow, removed 15 redundant places. [2022-01-19 05:00:40,553 INFO L242 Difference]: Finished difference. Result has 154 places, 133 transitions, 624 flow [2022-01-19 05:00:40,553 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=624, PETRI_PLACES=154, PETRI_TRANSITIONS=133} [2022-01-19 05:00:40,554 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2022-01-19 05:00:40,554 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 133 transitions, 624 flow [2022-01-19 05:00:40,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 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-01-19 05:00:40,554 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:40,554 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:40,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 05:00:40,555 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 930625012, now seen corresponding path program 2 times [2022-01-19 05:00:40,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638451873] [2022-01-19 05:00:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:40,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:40,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638451873] [2022-01-19 05:00:40,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638451873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:40,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:40,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 05:00:40,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27092184] [2022-01-19 05:00:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:40,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 05:00:40,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 05:00:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-19 05:00:40,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2022-01-19 05:00:40,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 624 flow. Second operand has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 11 states have internal predecessors, (948), 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-01-19 05:00:40,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:40,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2022-01-19 05:00:40,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:41,168 INFO L129 PetriNetUnfolder]: 221/1808 cut-off events. [2022-01-19 05:00:41,168 INFO L130 PetriNetUnfolder]: For 2054/2136 co-relation queries the response was YES. [2022-01-19 05:00:41,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 1808 events. 221/1808 cut-off events. For 2054/2136 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20004 event pairs, 12 based on Foata normal form. 12/1714 useless extension candidates. Maximal degree in co-relation 4303. Up to 279 conditions per place. [2022-01-19 05:00:41,191 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 27 selfloop transitions, 8 changer transitions 20/150 dead transitions. [2022-01-19 05:00:41,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 807 flow [2022-01-19 05:00:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:00:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:00:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 966 transitions. [2022-01-19 05:00:41,194 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7771520514883347 [2022-01-19 05:00:41,194 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 966 transitions. [2022-01-19 05:00:41,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 966 transitions. [2022-01-19 05:00:41,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:41,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 966 transitions. [2022-01-19 05:00:41,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.81818181818181) internal successors, (966), 11 states have internal predecessors, (966), 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-01-19 05:00:41,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-01-19 05:00:41,199 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-01-19 05:00:41,199 INFO L186 Difference]: Start difference. First operand has 154 places, 133 transitions, 624 flow. Second operand 11 states and 966 transitions. [2022-01-19 05:00:41,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 807 flow [2022-01-19 05:00:41,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 150 transitions, 790 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-01-19 05:00:41,222 INFO L242 Difference]: Finished difference. Result has 161 places, 127 transitions, 590 flow [2022-01-19 05:00:41,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=161, PETRI_TRANSITIONS=127} [2022-01-19 05:00:41,223 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2022-01-19 05:00:41,223 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 127 transitions, 590 flow [2022-01-19 05:00:41,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 11 states have internal predecessors, (948), 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-01-19 05:00:41,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:41,224 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:41,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 05:00:41,224 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:00:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1807784924, now seen corresponding path program 3 times [2022-01-19 05:00:41,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376067685] [2022-01-19 05:00:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:41,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:00:41,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:00:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:00:41,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:00:41,344 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:00:41,345 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 05:00:41,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 05:00:41,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 05:00:41,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 05:00:41,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 05:00:41,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 05:00:41,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 05:00:41,350 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-01-19 05:00:41,354 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 05:00:41,354 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 05:00:41,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 05:00:41 BasicIcfg [2022-01-19 05:00:41,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 05:00:41,461 INFO L158 Benchmark]: Toolchain (without parser) took 10017.61ms. Allocated memory was 331.4MB in the beginning and 666.9MB in the end (delta: 335.5MB). Free memory was 274.4MB in the beginning and 344.9MB in the end (delta: -70.5MB). Peak memory consumption was 267.0MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,461 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 331.4MB. Free memory is still 292.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 05:00:41,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.33ms. Allocated memory was 331.4MB in the beginning and 444.6MB in the end (delta: 113.2MB). Free memory was 274.2MB in the beginning and 404.2MB in the end (delta: -130.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.54ms. Allocated memory is still 444.6MB. Free memory was 404.2MB in the beginning and 401.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,462 INFO L158 Benchmark]: Boogie Preprocessor took 40.82ms. Allocated memory is still 444.6MB. Free memory was 401.1MB in the beginning and 399.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,462 INFO L158 Benchmark]: RCFGBuilder took 1063.64ms. Allocated memory is still 444.6MB. Free memory was 399.0MB in the beginning and 319.3MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,463 INFO L158 Benchmark]: TraceAbstraction took 8347.77ms. Allocated memory was 444.6MB in the beginning and 666.9MB in the end (delta: 222.3MB). Free memory was 319.3MB in the beginning and 344.9MB in the end (delta: -25.6MB). Peak memory consumption was 199.8MB. Max. memory is 16.0GB. [2022-01-19 05:00:41,464 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.12ms. Allocated memory is still 331.4MB. Free memory is still 292.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 474.33ms. Allocated memory was 331.4MB in the beginning and 444.6MB in the end (delta: 113.2MB). Free memory was 274.2MB in the beginning and 404.2MB in the end (delta: -130.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.54ms. Allocated memory is still 444.6MB. Free memory was 404.2MB in the beginning and 401.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.82ms. Allocated memory is still 444.6MB. Free memory was 401.1MB in the beginning and 399.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1063.64ms. Allocated memory is still 444.6MB. Free memory was 399.0MB in the beginning and 319.3MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 8347.77ms. Allocated memory was 444.6MB in the beginning and 666.9MB in the end (delta: 222.3MB). Free memory was 319.3MB in the beginning and 344.9MB in the end (delta: -25.6MB). Peak memory consumption was 199.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t2393; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-2, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 pthread_t t2394; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=-1, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 pthread_t t2395; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2395, ((void *)0), P2, ((void *)0))=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 829]: 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: 831]: 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: 833]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 617 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 970 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1340 IncrementalHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 99 mSDtfsCounter, 1340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=5, InterpolantAutomatonStates: 99, 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.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 773 NumberOfCodeBlocks, 773 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 3329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-01-19 05:00:41,510 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...