/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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:58:02,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:58:02,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:58:02,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:58:02,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:58:02,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:58:02,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:58:02,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:58:02,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:58:02,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:58:02,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:58:02,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:58:02,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:58:02,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:58:02,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:58:02,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:58:02,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:58:02,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:58:02,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:58:02,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:58:02,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:58:02,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:58:02,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:58:02,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:58:02,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:58:02,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:58:02,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:58:02,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:58:02,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:58:02,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:58:02,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:58:02,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:58:02,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:58:02,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:58:02,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:58:02,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:58:02,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:58:02,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:58:02,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:58:02,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:58:02,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:58:02,256 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 04:58:02,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:58:02,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:58:02,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:58:02,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:58:02,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:58:02,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:58:02,275 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:58:02,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:58:02,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:58:02,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:58:02,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:58:02,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:58:02,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:58:02,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:58:02,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:58:02,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:58:02,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:58:02,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:58:02,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:58:02,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:58:02,279 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:58:02,279 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 04:58:02,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:58:02,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:58:02,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:58:02,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:58:02,546 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:58:02,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:58:02,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bb31f9d/ad325b486f4e4f48b67daf28cf0d8de8/FLAGa3c69705b [2022-01-19 04:58:03,108 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:58:03,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:58:03,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bb31f9d/ad325b486f4e4f48b67daf28cf0d8de8/FLAGa3c69705b [2022-01-19 04:58:03,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bb31f9d/ad325b486f4e4f48b67daf28cf0d8de8 [2022-01-19 04:58:03,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:58:03,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:58:03,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:58:03,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:58:03,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:58:03,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:58:03" (1/1) ... [2022-01-19 04:58:03,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3359078a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:03, skipping insertion in model container [2022-01-19 04:58:03,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:58:03" (1/1) ... [2022-01-19 04:58:03,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:58:03,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:58:03,833 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-01-19 04:58:04,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:58:04,008 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:58:04,029 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-01-19 04:58:04,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:58:04,111 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:58:04,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04 WrapperNode [2022-01-19 04:58:04,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:58:04,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:58:04,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:58:04,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:58:04,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,158 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-01-19 04:58:04,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:58:04,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:58:04,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:58:04,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:58:04,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:58:04,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:58:04,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:58:04,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:58:04,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (1/1) ... [2022-01-19 04:58:04,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:58:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:58:04,233 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 04:58:04,272 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 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:58:04,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:58:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:58:04,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:58:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:58:04,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:58:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:58:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:58:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:58:04,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:58:04,293 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 04:58:04,438 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:58:04,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:58:04,826 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:58:05,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:58:05,092 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:58:05,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:58:05 BoogieIcfgContainer [2022-01-19 04:58:05,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:58:05,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:58:05,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:58:05,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:58:05,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:58:03" (1/3) ... [2022-01-19 04:58:05,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360c186e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:58:05, skipping insertion in model container [2022-01-19 04:58:05,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:04" (2/3) ... [2022-01-19 04:58:05,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360c186e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:58:05, skipping insertion in model container [2022-01-19 04:58:05,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:58:05" (3/3) ... [2022-01-19 04:58:05,103 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:58:05,108 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:58:05,108 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:58:05,108 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:58:05,152 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,153 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,153 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,153 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,153 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,155 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,155 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,155 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,155 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,157 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,157 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,157 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,157 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,158 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,158 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,159 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,160 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,161 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,165 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,166 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,167 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,168 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,169 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,169 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,169 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,169 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,169 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,170 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,175 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,175 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,176 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,183 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,184 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,185 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,186 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,187 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,191 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,196 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,199 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,202 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:05,204 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:58:05,252 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:58:05,261 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 04:58:05,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:58:05,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-01-19 04:58:05,322 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-01-19 04:58:05,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:58:05,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 04:58:05,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-01-19 04:58:05,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-01-19 04:58:05,346 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2022-01-19 04:58:05,346 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:58:05,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:05,347 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] [2022-01-19 04:58:05,347 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash -768059129, now seen corresponding path program 1 times [2022-01-19 04:58:05,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688944140] [2022-01-19 04:58:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:05,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:05,662 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 04:58:05,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:05,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688944140] [2022-01-19 04:58:05,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688944140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:05,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:05,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:58:05,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462451484] [2022-01-19 04:58:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:05,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:58:05,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:58:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:58:05,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-01-19 04:58:05,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 04:58:05,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:05,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-01-19 04:58:05,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:05,852 INFO L129 PetriNetUnfolder]: 37/222 cut-off events. [2022-01-19 04:58:05,852 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 04:58:05,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 222 events. 37/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 701 event pairs, 7 based on Foata normal form. 11/217 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-01-19 04:58:05,857 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-01-19 04:58:05,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 260 flow [2022-01-19 04:58:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:58:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:58:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-01-19 04:58:05,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-01-19 04:58:05,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-01-19 04:58:05,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-01-19 04:58:05,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:05,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-01-19 04:58:05,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 04:58:05,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 04:58:05,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 04:58:05,899 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-01-19 04:58:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 260 flow [2022-01-19 04:58:05,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:58:05,909 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-01-19 04:58:05,910 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-01-19 04:58:05,913 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-01-19 04:58:05,914 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-01-19 04:58:05,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 04:58:05,915 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:05,915 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] [2022-01-19 04:58:05,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:58:05,915 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 147866215, now seen corresponding path program 1 times [2022-01-19 04:58:05,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:05,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337166159] [2022-01-19 04:58:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:05,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:06,183 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 04:58:06,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:06,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337166159] [2022-01-19 04:58:06,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337166159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:06,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:06,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:58:06,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936852895] [2022-01-19 04:58:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:06,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:58:06,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:58:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:58:06,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-01-19 04:58:06,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 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 04:58:06,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:06,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-01-19 04:58:06,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:06,972 INFO L129 PetriNetUnfolder]: 1096/3008 cut-off events. [2022-01-19 04:58:06,973 INFO L130 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-01-19 04:58:06,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 3008 events. 1096/3008 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 23731 event pairs, 124 based on Foata normal form. 0/2918 useless extension candidates. Maximal degree in co-relation 4836. Up to 362 conditions per place. [2022-01-19 04:58:06,989 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 31 selfloop transitions, 6 changer transitions 82/192 dead transitions. [2022-01-19 04:58:06,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 192 transitions, 632 flow [2022-01-19 04:58:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:58:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:58:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1242 transitions. [2022-01-19 04:58:06,996 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8380566801619433 [2022-01-19 04:58:06,996 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1242 transitions. [2022-01-19 04:58:06,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1242 transitions. [2022-01-19 04:58:06,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:06,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1242 transitions. [2022-01-19 04:58:07,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.53846153846153) internal successors, (1242), 13 states have internal predecessors, (1242), 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 04:58:07,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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 04:58:07,005 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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 04:58:07,005 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1242 transitions. [2022-01-19 04:58:07,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 192 transitions, 632 flow [2022-01-19 04:58:07,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 192 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:58:07,011 INFO L242 Difference]: Finished difference. Result has 138 places, 98 transitions, 272 flow [2022-01-19 04:58:07,012 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=272, PETRI_PLACES=138, PETRI_TRANSITIONS=98} [2022-01-19 04:58:07,012 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-01-19 04:58:07,012 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 98 transitions, 272 flow [2022-01-19 04:58:07,013 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 04:58:07,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:07,013 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 04:58:07,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:58:07,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash 650011896, now seen corresponding path program 1 times [2022-01-19 04:58:07,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:07,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955816629] [2022-01-19 04:58:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:07,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:07,208 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 04:58:07,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955816629] [2022-01-19 04:58:07,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955816629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:07,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:07,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:07,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163327711] [2022-01-19 04:58:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:07,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:07,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:07,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:07,213 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-01-19 04:58:07,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 98 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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 04:58:07,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:07,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-01-19 04:58:07,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:07,652 INFO L129 PetriNetUnfolder]: 530/1333 cut-off events. [2022-01-19 04:58:07,653 INFO L130 PetriNetUnfolder]: For 1883/1883 co-relation queries the response was YES. [2022-01-19 04:58:07,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 1333 events. 530/1333 cut-off events. For 1883/1883 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8410 event pairs, 112 based on Foata normal form. 24/1269 useless extension candidates. Maximal degree in co-relation 3392. Up to 272 conditions per place. [2022-01-19 04:58:07,662 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 35 selfloop transitions, 9 changer transitions 30/147 dead transitions. [2022-01-19 04:58:07,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 656 flow [2022-01-19 04:58:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:58:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:58:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 764 transitions. [2022-01-19 04:58:07,664 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8377192982456141 [2022-01-19 04:58:07,664 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 764 transitions. [2022-01-19 04:58:07,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 764 transitions. [2022-01-19 04:58:07,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:07,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 764 transitions. [2022-01-19 04:58:07,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 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 04:58:07,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 04:58:07,669 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 04:58:07,669 INFO L186 Difference]: Start difference. First operand has 138 places, 98 transitions, 272 flow. Second operand 8 states and 764 transitions. [2022-01-19 04:58:07,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 656 flow [2022-01-19 04:58:07,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 609 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-01-19 04:58:07,685 INFO L242 Difference]: Finished difference. Result has 125 places, 100 transitions, 304 flow [2022-01-19 04:58:07,686 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=304, PETRI_PLACES=125, PETRI_TRANSITIONS=100} [2022-01-19 04:58:07,687 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2022-01-19 04:58:07,688 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 100 transitions, 304 flow [2022-01-19 04:58:07,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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 04:58:07,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:07,689 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] [2022-01-19 04:58:07,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:58:07,689 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:07,691 INFO L85 PathProgramCache]: Analyzing trace with hash 993601427, now seen corresponding path program 1 times [2022-01-19 04:58:07,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:07,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452692242] [2022-01-19 04:58:07,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:07,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:07,847 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 04:58:07,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:07,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452692242] [2022-01-19 04:58:07,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452692242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:07,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:07,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:58:07,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475778101] [2022-01-19 04:58:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:07,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:58:07,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:07,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:58:07,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:58:07,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-01-19 04:58:07,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 100 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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 04:58:07,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:07,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-01-19 04:58:07,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:08,319 INFO L129 PetriNetUnfolder]: 538/1585 cut-off events. [2022-01-19 04:58:08,320 INFO L130 PetriNetUnfolder]: For 1866/1866 co-relation queries the response was YES. [2022-01-19 04:58:08,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 1585 events. 538/1585 cut-off events. For 1866/1866 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11785 event pairs, 178 based on Foata normal form. 16/1475 useless extension candidates. Maximal degree in co-relation 3787. Up to 360 conditions per place. [2022-01-19 04:58:08,334 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 33 selfloop transitions, 5 changer transitions 43/156 dead transitions. [2022-01-19 04:58:08,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 156 transitions, 722 flow [2022-01-19 04:58:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:58:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:58:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1054 transitions. [2022-01-19 04:58:08,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8405103668261563 [2022-01-19 04:58:08,338 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1054 transitions. [2022-01-19 04:58:08,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1054 transitions. [2022-01-19 04:58:08,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:08,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1054 transitions. [2022-01-19 04:58:08,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.81818181818181) internal successors, (1054), 11 states have internal predecessors, (1054), 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 04:58:08,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 04:58:08,344 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 04:58:08,344 INFO L186 Difference]: Start difference. First operand has 125 places, 100 transitions, 304 flow. Second operand 11 states and 1054 transitions. [2022-01-19 04:58:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 156 transitions, 722 flow [2022-01-19 04:58:08,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 156 transitions, 637 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 04:58:08,353 INFO L242 Difference]: Finished difference. Result has 132 places, 100 transitions, 298 flow [2022-01-19 04:58:08,353 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=298, PETRI_PLACES=132, PETRI_TRANSITIONS=100} [2022-01-19 04:58:08,354 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-01-19 04:58:08,354 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 100 transitions, 298 flow [2022-01-19 04:58:08,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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 04:58:08,355 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:08,355 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] [2022-01-19 04:58:08,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:58:08,355 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1930788179, now seen corresponding path program 2 times [2022-01-19 04:58:08,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169843037] [2022-01-19 04:58:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:08,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:08,496 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 04:58:08,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:08,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169843037] [2022-01-19 04:58:08,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169843037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:08,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:08,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:08,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775571954] [2022-01-19 04:58:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:08,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:08,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:08,499 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-01-19 04:58:08,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 100 transitions, 298 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 04:58:08,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:08,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-01-19 04:58:08,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:08,970 INFO L129 PetriNetUnfolder]: 397/1246 cut-off events. [2022-01-19 04:58:08,971 INFO L130 PetriNetUnfolder]: For 1454/1454 co-relation queries the response was YES. [2022-01-19 04:58:08,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2954 conditions, 1246 events. 397/1246 cut-off events. For 1454/1454 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8824 event pairs, 90 based on Foata normal form. 16/1175 useless extension candidates. Maximal degree in co-relation 2879. Up to 228 conditions per place. [2022-01-19 04:58:08,981 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 5 changer transitions 43/155 dead transitions. [2022-01-19 04:58:08,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 155 transitions, 698 flow [2022-01-19 04:58:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:58:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:58:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1124 transitions. [2022-01-19 04:58:08,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8216374269005848 [2022-01-19 04:58:08,985 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1124 transitions. [2022-01-19 04:58:08,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1124 transitions. [2022-01-19 04:58:08,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:08,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1124 transitions. [2022-01-19 04:58:08,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.66666666666667) internal successors, (1124), 12 states have internal predecessors, (1124), 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 04:58:08,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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 04:58:08,991 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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 04:58:08,991 INFO L186 Difference]: Start difference. First operand has 132 places, 100 transitions, 298 flow. Second operand 12 states and 1124 transitions. [2022-01-19 04:58:08,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 155 transitions, 698 flow [2022-01-19 04:58:08,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 155 transitions, 629 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-01-19 04:58:08,999 INFO L242 Difference]: Finished difference. Result has 137 places, 98 transitions, 303 flow [2022-01-19 04:58:08,999 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=303, PETRI_PLACES=137, PETRI_TRANSITIONS=98} [2022-01-19 04:58:09,000 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-01-19 04:58:09,000 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 98 transitions, 303 flow [2022-01-19 04:58:09,000 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 04:58:09,001 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:09,001 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 04:58:09,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:58:09,001 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -113448096, now seen corresponding path program 1 times [2022-01-19 04:58:09,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:09,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360597163] [2022-01-19 04:58:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:09,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:09,138 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 04:58:09,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:09,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360597163] [2022-01-19 04:58:09,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360597163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:09,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:09,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:09,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951938400] [2022-01-19 04:58:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:09,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:09,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:09,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-01-19 04:58:09,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 98 transitions, 303 flow. Second operand has 8 states, 8 states have (on average 89.375) internal successors, (715), 8 states have internal predecessors, (715), 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 04:58:09,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:09,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-01-19 04:58:09,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:09,450 INFO L129 PetriNetUnfolder]: 324/987 cut-off events. [2022-01-19 04:58:09,450 INFO L130 PetriNetUnfolder]: For 1697/1697 co-relation queries the response was YES. [2022-01-19 04:58:09,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 987 events. 324/987 cut-off events. For 1697/1697 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6340 event pairs, 113 based on Foata normal form. 12/925 useless extension candidates. Maximal degree in co-relation 2544. Up to 205 conditions per place. [2022-01-19 04:58:09,458 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 27 selfloop transitions, 7 changer transitions 19/126 dead transitions. [2022-01-19 04:58:09,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 559 flow [2022-01-19 04:58:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:58:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:58:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 749 transitions. [2022-01-19 04:58:09,461 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8212719298245614 [2022-01-19 04:58:09,462 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 749 transitions. [2022-01-19 04:58:09,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 749 transitions. [2022-01-19 04:58:09,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:09,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 749 transitions. [2022-01-19 04:58:09,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:09,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 04:58:09,467 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 04:58:09,467 INFO L186 Difference]: Start difference. First operand has 137 places, 98 transitions, 303 flow. Second operand 8 states and 749 transitions. [2022-01-19 04:58:09,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 559 flow [2022-01-19 04:58:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 491 flow, removed 19 selfloop flow, removed 15 redundant places. [2022-01-19 04:58:09,474 INFO L242 Difference]: Finished difference. Result has 125 places, 98 transitions, 287 flow [2022-01-19 04:58:09,474 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=125, PETRI_TRANSITIONS=98} [2022-01-19 04:58:09,476 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2022-01-19 04:58:09,477 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 98 transitions, 287 flow [2022-01-19 04:58:09,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.375) internal successors, (715), 8 states have internal predecessors, (715), 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 04:58:09,477 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:09,477 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 04:58:09,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:58:09,478 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -563062868, now seen corresponding path program 2 times [2022-01-19 04:58:09,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:09,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179789100] [2022-01-19 04:58:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:09,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:09,621 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 04:58:09,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:09,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179789100] [2022-01-19 04:58:09,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179789100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:09,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:09,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:58:09,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731805208] [2022-01-19 04:58:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:09,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:58:09,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:58:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:58:09,627 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-01-19 04:58:09,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 98 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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 04:58:09,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:09,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-01-19 04:58:09,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:10,149 INFO L129 PetriNetUnfolder]: 1369/2926 cut-off events. [2022-01-19 04:58:10,149 INFO L130 PetriNetUnfolder]: For 2285/2378 co-relation queries the response was YES. [2022-01-19 04:58:10,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 2926 events. 1369/2926 cut-off events. For 2285/2378 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20990 event pairs, 66 based on Foata normal form. 80/2906 useless extension candidates. Maximal degree in co-relation 6399. Up to 831 conditions per place. [2022-01-19 04:58:10,165 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 28 selfloop transitions, 6 changer transitions 53/165 dead transitions. [2022-01-19 04:58:10,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 165 transitions, 704 flow [2022-01-19 04:58:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:58:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:58:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 991 transitions. [2022-01-19 04:58:10,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8692982456140351 [2022-01-19 04:58:10,169 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 991 transitions. [2022-01-19 04:58:10,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 991 transitions. [2022-01-19 04:58:10,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:10,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 991 transitions. [2022-01-19 04:58:10,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 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 04:58:10,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:10,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:10,174 INFO L186 Difference]: Start difference. First operand has 125 places, 98 transitions, 287 flow. Second operand 10 states and 991 transitions. [2022-01-19 04:58:10,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 165 transitions, 704 flow [2022-01-19 04:58:10,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 165 transitions, 675 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-01-19 04:58:10,180 INFO L242 Difference]: Finished difference. Result has 130 places, 100 transitions, 319 flow [2022-01-19 04:58:10,180 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=319, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2022-01-19 04:58:10,181 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-01-19 04:58:10,181 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 319 flow [2022-01-19 04:58:10,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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 04:58:10,182 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:10,182 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] [2022-01-19 04:58:10,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:58:10,182 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1814494449, now seen corresponding path program 1 times [2022-01-19 04:58:10,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:10,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253236668] [2022-01-19 04:58:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:10,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:10,295 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 04:58:10,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253236668] [2022-01-19 04:58:10,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253236668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:10,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:10,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:58:10,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172974731] [2022-01-19 04:58:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:10,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:58:10,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:58:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:58:10,298 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:10,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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 04:58:10,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:10,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:10,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:10,543 INFO L129 PetriNetUnfolder]: 361/1204 cut-off events. [2022-01-19 04:58:10,543 INFO L130 PetriNetUnfolder]: For 1267/1286 co-relation queries the response was YES. [2022-01-19 04:58:10,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1204 events. 361/1204 cut-off events. For 1267/1286 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8280 event pairs, 169 based on Foata normal form. 14/1135 useless extension candidates. Maximal degree in co-relation 3041. Up to 256 conditions per place. [2022-01-19 04:58:10,554 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 21 selfloop transitions, 2 changer transitions 13/114 dead transitions. [2022-01-19 04:58:10,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 114 transitions, 431 flow [2022-01-19 04:58:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 04:58:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 04:58:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 576 transitions. [2022-01-19 04:58:10,556 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2022-01-19 04:58:10,556 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 576 transitions. [2022-01-19 04:58:10,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 576 transitions. [2022-01-19 04:58:10,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:10,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 576 transitions. [2022-01-19 04:58:10,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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 04:58:10,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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 04:58:10,559 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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 04:58:10,559 INFO L186 Difference]: Start difference. First operand has 130 places, 100 transitions, 319 flow. Second operand 6 states and 576 transitions. [2022-01-19 04:58:10,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 114 transitions, 431 flow [2022-01-19 04:58:10,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 114 transitions, 417 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 04:58:10,564 INFO L242 Difference]: Finished difference. Result has 128 places, 97 transitions, 300 flow [2022-01-19 04:58:10,565 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=128, PETRI_TRANSITIONS=97} [2022-01-19 04:58:10,565 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places. [2022-01-19 04:58:10,565 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 97 transitions, 300 flow [2022-01-19 04:58:10,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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 04:58:10,566 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:10,566 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] [2022-01-19 04:58:10,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:58:10,566 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1510126627, now seen corresponding path program 2 times [2022-01-19 04:58:10,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:10,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923252759] [2022-01-19 04:58:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:10,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:10,667 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 04:58:10,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:10,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923252759] [2022-01-19 04:58:10,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923252759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:10,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:10,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:58:10,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630452217] [2022-01-19 04:58:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:10,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:58:10,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:58:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:58:10,669 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-01-19 04:58:10,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 97 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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 04:58:10,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:10,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-01-19 04:58:10,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:10,932 INFO L129 PetriNetUnfolder]: 184/549 cut-off events. [2022-01-19 04:58:10,933 INFO L130 PetriNetUnfolder]: For 1010/1013 co-relation queries the response was YES. [2022-01-19 04:58:10,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 549 events. 184/549 cut-off events. For 1010/1013 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2521 event pairs, 12 based on Foata normal form. 19/560 useless extension candidates. Maximal degree in co-relation 1522. Up to 133 conditions per place. [2022-01-19 04:58:10,936 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 9 changer transitions 31/144 dead transitions. [2022-01-19 04:58:10,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 719 flow [2022-01-19 04:58:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:58:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:58:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 980 transitions. [2022-01-19 04:58:10,939 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2022-01-19 04:58:10,939 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 980 transitions. [2022-01-19 04:58:10,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 980 transitions. [2022-01-19 04:58:10,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:10,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 980 transitions. [2022-01-19 04:58:10,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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 04:58:10,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:10,945 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:10,945 INFO L186 Difference]: Start difference. First operand has 128 places, 97 transitions, 300 flow. Second operand 10 states and 980 transitions. [2022-01-19 04:58:10,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 719 flow [2022-01-19 04:58:10,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 144 transitions, 676 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-01-19 04:58:10,949 INFO L242 Difference]: Finished difference. Result has 130 places, 100 transitions, 353 flow [2022-01-19 04:58:10,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=353, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2022-01-19 04:58:10,950 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-01-19 04:58:10,950 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 353 flow [2022-01-19 04:58:10,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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 04:58:10,951 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:10,951 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] [2022-01-19 04:58:10,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:58:10,952 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -471735070, now seen corresponding path program 1 times [2022-01-19 04:58:10,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:10,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944068860] [2022-01-19 04:58:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:10,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:11,066 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 04:58:11,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944068860] [2022-01-19 04:58:11,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944068860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:11,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:11,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:11,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716141598] [2022-01-19 04:58:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:11,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:11,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:11,068 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-01-19 04:58:11,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 353 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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 04:58:11,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:11,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-01-19 04:58:11,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:11,285 INFO L129 PetriNetUnfolder]: 54/240 cut-off events. [2022-01-19 04:58:11,285 INFO L130 PetriNetUnfolder]: For 564/568 co-relation queries the response was YES. [2022-01-19 04:58:11,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 240 events. 54/240 cut-off events. For 564/568 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 702 event pairs, 8 based on Foata normal form. 7/241 useless extension candidates. Maximal degree in co-relation 684. Up to 49 conditions per place. [2022-01-19 04:58:11,287 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 19 selfloop transitions, 12 changer transitions 19/126 dead transitions. [2022-01-19 04:58:11,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 639 flow [2022-01-19 04:58:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:58:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:58:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1053 transitions. [2022-01-19 04:58:11,297 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8397129186602871 [2022-01-19 04:58:11,297 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1053 transitions. [2022-01-19 04:58:11,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1053 transitions. [2022-01-19 04:58:11,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:11,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1053 transitions. [2022-01-19 04:58:11,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.72727272727273) internal successors, (1053), 11 states have internal predecessors, (1053), 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 04:58:11,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 04:58:11,303 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 04:58:11,303 INFO L186 Difference]: Start difference. First operand has 130 places, 100 transitions, 353 flow. Second operand 11 states and 1053 transitions. [2022-01-19 04:58:11,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 639 flow [2022-01-19 04:58:11,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 488 flow, removed 63 selfloop flow, removed 14 redundant places. [2022-01-19 04:58:11,307 INFO L242 Difference]: Finished difference. Result has 128 places, 100 transitions, 319 flow [2022-01-19 04:58:11,308 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=319, PETRI_PLACES=128, PETRI_TRANSITIONS=100} [2022-01-19 04:58:11,309 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places. [2022-01-19 04:58:11,309 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 100 transitions, 319 flow [2022-01-19 04:58:11,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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 04:58:11,309 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:11,309 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, 1] [2022-01-19 04:58:11,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:58:11,310 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1806209117, now seen corresponding path program 1 times [2022-01-19 04:58:11,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:11,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639701202] [2022-01-19 04:58:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:11,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:11,490 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 04:58:11,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:11,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639701202] [2022-01-19 04:58:11,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639701202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:11,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:11,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:11,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365039463] [2022-01-19 04:58:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:11,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:11,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:11,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-19 04:58:11,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 100 transitions, 319 flow. Second operand has 8 states, 8 states have (on average 86.25) internal successors, (690), 8 states have internal predecessors, (690), 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 04:58:11,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:11,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-19 04:58:11,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:11,705 INFO L129 PetriNetUnfolder]: 26/213 cut-off events. [2022-01-19 04:58:11,705 INFO L130 PetriNetUnfolder]: For 175/177 co-relation queries the response was YES. [2022-01-19 04:58:11,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 213 events. 26/213 cut-off events. For 175/177 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 642 event pairs, 0 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 419. Up to 27 conditions per place. [2022-01-19 04:58:11,707 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 28 selfloop transitions, 12 changer transitions 6/120 dead transitions. [2022-01-19 04:58:11,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 464 flow [2022-01-19 04:58:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:58:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:58:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 877 transitions. [2022-01-19 04:58:11,710 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.769298245614035 [2022-01-19 04:58:11,710 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 877 transitions. [2022-01-19 04:58:11,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 877 transitions. [2022-01-19 04:58:11,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:11,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 877 transitions. [2022-01-19 04:58:11,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 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 04:58:11,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:11,715 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 04:58:11,715 INFO L186 Difference]: Start difference. First operand has 128 places, 100 transitions, 319 flow. Second operand 10 states and 877 transitions. [2022-01-19 04:58:11,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 120 transitions, 464 flow [2022-01-19 04:58:11,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 382 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-01-19 04:58:11,718 INFO L242 Difference]: Finished difference. Result has 125 places, 109 transitions, 319 flow [2022-01-19 04:58:11,718 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=319, PETRI_PLACES=125, PETRI_TRANSITIONS=109} [2022-01-19 04:58:11,719 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2022-01-19 04:58:11,719 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 109 transitions, 319 flow [2022-01-19 04:58:11,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.25) internal successors, (690), 8 states have internal predecessors, (690), 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 04:58:11,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:11,719 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, 1] [2022-01-19 04:58:11,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:58:11,720 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 929660249, now seen corresponding path program 2 times [2022-01-19 04:58:11,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088991594] [2022-01-19 04:58:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:11,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:11,986 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 04:58:11,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:11,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088991594] [2022-01-19 04:58:11,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088991594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:11,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:11,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:58:11,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092445220] [2022-01-19 04:58:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:11,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:58:11,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:58:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:58:11,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-01-19 04:58:11,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 109 transitions, 319 flow. Second operand has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 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 04:58:11,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:11,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-01-19 04:58:11,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:12,285 INFO L129 PetriNetUnfolder]: 28/244 cut-off events. [2022-01-19 04:58:12,285 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-01-19 04:58:12,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 244 events. 28/244 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 1 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 435. Up to 22 conditions per place. [2022-01-19 04:58:12,287 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 33 selfloop transitions, 10 changer transitions 15/129 dead transitions. [2022-01-19 04:58:12,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 516 flow [2022-01-19 04:58:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:58:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:58:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1095 transitions. [2022-01-19 04:58:12,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7388663967611336 [2022-01-19 04:58:12,302 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1095 transitions. [2022-01-19 04:58:12,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1095 transitions. [2022-01-19 04:58:12,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:12,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1095 transitions. [2022-01-19 04:58:12,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 84.23076923076923) internal successors, (1095), 13 states have internal predecessors, (1095), 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 04:58:12,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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 04:58:12,309 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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 04:58:12,309 INFO L186 Difference]: Start difference. First operand has 125 places, 109 transitions, 319 flow. Second operand 13 states and 1095 transitions. [2022-01-19 04:58:12,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 129 transitions, 516 flow [2022-01-19 04:58:12,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 488 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-01-19 04:58:12,312 INFO L242 Difference]: Finished difference. Result has 136 places, 106 transitions, 327 flow [2022-01-19 04:58:12,312 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2022-01-19 04:58:12,314 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-01-19 04:58:12,314 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 327 flow [2022-01-19 04:58:12,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 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 04:58:12,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:12,315 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, 1] [2022-01-19 04:58:12,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:58:12,315 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1267969469, now seen corresponding path program 3 times [2022-01-19 04:58:12,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886565409] [2022-01-19 04:58:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:12,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:58:12,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:58:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:58:12,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:58:12,462 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:58:12,463 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:58:12,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:58:12,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:58:12,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:58:12,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:58:12,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:58:12,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:58:12,469 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 04:58:12,473 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:58:12,473 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:58:12,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:58:12 BasicIcfg [2022-01-19 04:58:12,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:58:12,592 INFO L158 Benchmark]: Toolchain (without parser) took 8959.73ms. Allocated memory was 356.5MB in the beginning and 593.5MB in the end (delta: 237.0MB). Free memory was 298.9MB in the beginning and 346.6MB in the end (delta: -47.7MB). Peak memory consumption was 190.9MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,592 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 316.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:58:12,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.22ms. Allocated memory was 356.5MB in the beginning and 457.2MB in the end (delta: 100.7MB). Free memory was 298.7MB in the beginning and 416.0MB in the end (delta: -117.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 457.2MB. Free memory was 416.0MB in the beginning and 413.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,593 INFO L158 Benchmark]: Boogie Preprocessor took 41.64ms. Allocated memory is still 457.2MB. Free memory was 413.4MB in the beginning and 411.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,593 INFO L158 Benchmark]: RCFGBuilder took 893.45ms. Allocated memory is still 457.2MB. Free memory was 411.3MB in the beginning and 342.6MB in the end (delta: 68.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,594 INFO L158 Benchmark]: TraceAbstraction took 7495.91ms. Allocated memory was 457.2MB in the beginning and 593.5MB in the end (delta: 136.3MB). Free memory was 342.6MB in the beginning and 346.6MB in the end (delta: -4.0MB). Peak memory consumption was 134.0MB. Max. memory is 16.0GB. [2022-01-19 04:58:12,595 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 356.5MB. Free memory is still 316.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 476.22ms. Allocated memory was 356.5MB in the beginning and 457.2MB in the end (delta: 100.7MB). Free memory was 298.7MB in the beginning and 416.0MB in the end (delta: -117.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 457.2MB. Free memory was 416.0MB in the beginning and 413.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.64ms. Allocated memory is still 457.2MB. Free memory was 413.4MB in the beginning and 411.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 893.45ms. Allocated memory is still 457.2MB. Free memory was 411.3MB in the beginning and 342.6MB in the end (delta: 68.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.0GB. * TraceAbstraction took 7495.91ms. Allocated memory was 457.2MB in the beginning and 593.5MB in the end (delta: 136.3MB). Free memory was 342.6MB in the beginning and 346.6MB in the end (delta: -4.0MB). Peak memory consumption was 134.0MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1897; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-2, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1898; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1899; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1899, ((void *)0), P2, ((void *)0))=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 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: 7.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 628 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 628 mSDsluCounter, 634 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1434 IncrementalHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 130 mSDtfsCounter, 1434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=9, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 3647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 04:58:12,627 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...