/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 07:28:13,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 07:28:13,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 07:28:13,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 07:28:13,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 07:28:13,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 07:28:13,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 07:28:13,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 07:28:13,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 07:28:13,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 07:28:13,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 07:28:13,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 07:28:13,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 07:28:13,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 07:28:13,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 07:28:13,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 07:28:13,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 07:28:13,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 07:28:13,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 07:28:13,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 07:28:13,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 07:28:13,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 07:28:13,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 07:28:13,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 07:28:13,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 07:28:13,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 07:28:13,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 07:28:13,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 07:28:13,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 07:28:13,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 07:28:13,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 07:28:13,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 07:28:13,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 07:28:13,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 07:28:13,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 07:28:13,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 07:28:13,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 07:28:13,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 07:28:13,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 07:28:13,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 07:28:13,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 07:28:13,434 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.epf [2021-06-13 07:28:13,469 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 07:28:13,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 07:28:13,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 07:28:13,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 07:28:13,472 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 07:28:13,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 07:28:13,473 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 07:28:13,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 07:28:13,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 07:28:13,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 07:28:13,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 07:28:13,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 07:28:13,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 07:28:13,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 07:28:13,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 07:28:13,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 07:28:13,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:28:13,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 07:28:13,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 07:28:13,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 07:28:13,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 07:28:13,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 07:28:13,478 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 07:28:13,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-13 07:28:13,487 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 [2021-06-13 07:28:13,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 07:28:13,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 07:28:13,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 07:28:13,828 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-13 07:28:13,829 INFO L275 PluginConnector]: CDTParser initialized [2021-06-13 07:28:13,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_rmo.oepc.i [2021-06-13 07:28:13,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44f965a3/07896301a3a8492fbb1ed5bb3e5c39f1/FLAG3752d79ad [2021-06-13 07:28:14,381 INFO L306 CDTParser]: Found 1 translation units. [2021-06-13 07:28:14,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_rmo.oepc.i [2021-06-13 07:28:14,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44f965a3/07896301a3a8492fbb1ed5bb3e5c39f1/FLAG3752d79ad [2021-06-13 07:28:14,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44f965a3/07896301a3a8492fbb1ed5bb3e5c39f1 [2021-06-13 07:28:14,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 07:28:14,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-13 07:28:14,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-13 07:28:14,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-13 07:28:14,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-13 07:28:14,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:28:14" (1/1) ... [2021-06-13 07:28:14,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5902c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:14, skipping insertion in model container [2021-06-13 07:28:14,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:28:14" (1/1) ... [2021-06-13 07:28:14,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-13 07:28:14,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-13 07:28:14,906 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_rmo.oepc.i[950,963] [2021-06-13 07:28:15,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:28:15,131 INFO L203 MainTranslator]: Completed pre-run [2021-06-13 07:28:15,140 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_rmo.oepc.i[950,963] [2021-06-13 07:28:15,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:28:15,262 INFO L208 MainTranslator]: Completed translation [2021-06-13 07:28:15,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15 WrapperNode [2021-06-13 07:28:15,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-13 07:28:15,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 07:28:15,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 07:28:15,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 07:28:15,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 07:28:15,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 07:28:15,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 07:28:15,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 07:28:15,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... [2021-06-13 07:28:15,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 07:28:15,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 07:28:15,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 07:28:15,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 07:28:15,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:28:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-13 07:28:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-13 07:28:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-13 07:28:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-13 07:28:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-13 07:28:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-13 07:28:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-13 07:28:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-13 07:28:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-13 07:28:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-13 07:28:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-13 07:28:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-13 07:28:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 07:28:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 07:28:15,492 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 07:28:18,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 07:28:18,318 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-13 07:28:18,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:28:18 BoogieIcfgContainer [2021-06-13 07:28:18,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 07:28:18,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 07:28:18,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 07:28:18,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 07:28:18,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.06 07:28:14" (1/3) ... [2021-06-13 07:28:18,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439fd32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:28:18, skipping insertion in model container [2021-06-13 07:28:18,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:28:15" (2/3) ... [2021-06-13 07:28:18,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439fd32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:28:18, skipping insertion in model container [2021-06-13 07:28:18,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:28:18" (3/3) ... [2021-06-13 07:28:18,326 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_rmo.oepc.i [2021-06-13 07:28:18,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 07:28:18,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 07:28:18,332 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,403 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,403 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,414 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,414 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:28:18,415 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 07:28:18,434 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:28:18,451 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:28:18,451 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:28:18,451 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:28:18,451 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:28:18,451 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:28:18,452 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:28:18,452 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:28:18,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-13 07:28:18,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:18,491 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-06-13 07:28:18,492 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:18,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:28:18,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:18,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2021-06-13 07:28:18,498 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-13 07:28:18,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:18,499 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-13 07:28:18,500 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-13 07:28:18,507 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:28:18,507 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:28:18,507 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:28:18,507 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:28:18,507 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:28:18,507 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:28:18,507 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:28:18,507 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 07:28:18,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:18,546 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-06-13 07:28:18,546 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:18,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:28:18,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:18,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 92 transitions, 193 flow [2021-06-13 07:28:18,571 INFO L129 PetriNetUnfolder]: 1/91 cut-off events. [2021-06-13 07:28:18,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:18,572 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:18,573 INFO L255 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] [2021-06-13 07:28:18,573 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1616810894, now seen corresponding path program 1 times [2021-06-13 07:28:18,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:18,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40000631] [2021-06-13 07:28:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:19,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:19,038 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:19,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:19,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:19,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:19,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40000631] [2021-06-13 07:28:19,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40000631] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:19,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:19,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:28:19,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786402465] [2021-06-13 07:28:19,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:28:19,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:28:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:28:19,094 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2021-06-13 07:28:19,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:19,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:19,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2021-06-13 07:28:19,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:19,241 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2021-06-13 07:28:19,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:19,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 4/109 useless extension candidates. Maximal degree in co-relation 88. Up to 7 conditions per place. [2021-06-13 07:28:19,244 INFO L132 encePairwiseOnDemand]: 100/107 looper letters, 6 selfloop transitions, 2 changer transitions 11/101 dead transitions. [2021-06-13 07:28:19,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 247 flow [2021-06-13 07:28:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:28:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:28:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2021-06-13 07:28:19,266 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9106957424714434 [2021-06-13 07:28:19,267 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2021-06-13 07:28:19,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2021-06-13 07:28:19,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:19,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2021-06-13 07:28:19,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 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) [2021-06-13 07:28:19,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:19,291 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:19,293 INFO L185 Difference]: Start difference. First operand has 101 places, 92 transitions, 193 flow. Second operand 9 states and 877 transitions. [2021-06-13 07:28:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 247 flow [2021-06-13 07:28:19,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 244 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:28:19,302 INFO L241 Difference]: Finished difference. Result has 113 places, 90 transitions, 206 flow [2021-06-13 07:28:19,304 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=113, PETRI_TRANSITIONS=90} [2021-06-13 07:28:19,305 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 12 predicate places. [2021-06-13 07:28:19,305 INFO L482 AbstractCegarLoop]: Abstraction has has 113 places, 90 transitions, 206 flow [2021-06-13 07:28:19,306 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:19,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:19,306 INFO L255 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] [2021-06-13 07:28:19,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 07:28:19,306 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1526915181, now seen corresponding path program 1 times [2021-06-13 07:28:19,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:19,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100516576] [2021-06-13 07:28:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:19,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:19,500 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:19,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:19,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:19,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:19,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100516576] [2021-06-13 07:28:19,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100516576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:19,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:19,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:28:19,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271451166] [2021-06-13 07:28:19,535 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:28:19,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:28:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:28:19,536 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2021-06-13 07:28:19,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 90 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:19,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:19,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2021-06-13 07:28:19,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:19,677 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2021-06-13 07:28:19,677 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-13 07:28:19,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 113 events. 3/113 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 152. Up to 7 conditions per place. [2021-06-13 07:28:19,678 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 6 selfloop transitions, 2 changer transitions 10/100 dead transitions. [2021-06-13 07:28:19,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 280 flow [2021-06-13 07:28:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:28:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:28:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2021-06-13 07:28:19,687 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9086188992731049 [2021-06-13 07:28:19,687 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2021-06-13 07:28:19,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2021-06-13 07:28:19,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:19,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2021-06-13 07:28:19,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 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) [2021-06-13 07:28:19,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:19,692 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:19,692 INFO L185 Difference]: Start difference. First operand has 113 places, 90 transitions, 206 flow. Second operand 9 states and 875 transitions. [2021-06-13 07:28:19,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 280 flow [2021-06-13 07:28:19,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 248 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-13 07:28:19,695 INFO L241 Difference]: Finished difference. Result has 113 places, 90 transitions, 210 flow [2021-06-13 07:28:19,695 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=113, PETRI_TRANSITIONS=90} [2021-06-13 07:28:19,696 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 12 predicate places. [2021-06-13 07:28:19,696 INFO L482 AbstractCegarLoop]: Abstraction has has 113 places, 90 transitions, 210 flow [2021-06-13 07:28:19,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:19,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:19,699 INFO L255 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] [2021-06-13 07:28:19,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 07:28:19,699 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1240711246, now seen corresponding path program 1 times [2021-06-13 07:28:19,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:19,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614869734] [2021-06-13 07:28:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:19,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:19,957 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:19,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:19,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:19,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:19,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:19,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:19,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614869734] [2021-06-13 07:28:19,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614869734] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:19,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:19,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:28:19,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245839396] [2021-06-13 07:28:19,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:28:19,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:28:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:28:20,001 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2021-06-13 07:28:20,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 90 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:20,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:20,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2021-06-13 07:28:20,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:20,139 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2021-06-13 07:28:20,140 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-13 07:28:20,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 106 events. 3/106 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 148. Up to 7 conditions per place. [2021-06-13 07:28:20,141 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 6 selfloop transitions, 2 changer transitions 10/100 dead transitions. [2021-06-13 07:28:20,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 286 flow [2021-06-13 07:28:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:28:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:28:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2021-06-13 07:28:20,144 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9086188992731049 [2021-06-13 07:28:20,144 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2021-06-13 07:28:20,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2021-06-13 07:28:20,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:20,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2021-06-13 07:28:20,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 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) [2021-06-13 07:28:20,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:20,149 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:20,149 INFO L185 Difference]: Start difference. First operand has 113 places, 90 transitions, 210 flow. Second operand 9 states and 875 transitions. [2021-06-13 07:28:20,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 286 flow [2021-06-13 07:28:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 254 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-13 07:28:20,153 INFO L241 Difference]: Finished difference. Result has 114 places, 90 transitions, 214 flow [2021-06-13 07:28:20,153 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2021-06-13 07:28:20,153 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 13 predicate places. [2021-06-13 07:28:20,153 INFO L482 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 214 flow [2021-06-13 07:28:20,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-06-13 07:28:20,154 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:20,154 INFO L255 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] [2021-06-13 07:28:20,154 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 07:28:20,154 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:20,155 INFO L82 PathProgramCache]: Analyzing trace with hash 519089019, now seen corresponding path program 1 times [2021-06-13 07:28:20,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:20,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255218763] [2021-06-13 07:28:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:20,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:20,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:20,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:20,259 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:20,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:20,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:20,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:20,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:20,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:20,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255218763] [2021-06-13 07:28:20,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255218763] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:20,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:20,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:28:20,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738881607] [2021-06-13 07:28:20,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:28:20,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:28:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:28:20,300 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-06-13 07:28:20,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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) [2021-06-13 07:28:20,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:20,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-06-13 07:28:20,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:20,454 INFO L129 PetriNetUnfolder]: 4/113 cut-off events. [2021-06-13 07:28:20,454 INFO L130 PetriNetUnfolder]: For 34/41 co-relation queries the response was YES. [2021-06-13 07:28:20,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 113 events. 4/113 cut-off events. For 34/41 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 168. Up to 7 conditions per place. [2021-06-13 07:28:20,455 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 6 selfloop transitions, 4 changer transitions 13/102 dead transitions. [2021-06-13 07:28:20,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 102 transitions, 313 flow [2021-06-13 07:28:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:28:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:28:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 954 transitions. [2021-06-13 07:28:20,458 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.891588785046729 [2021-06-13 07:28:20,459 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 954 transitions. [2021-06-13 07:28:20,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 954 transitions. [2021-06-13 07:28:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:20,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 954 transitions. [2021-06-13 07:28:20,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 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) [2021-06-13 07:28:20,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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) [2021-06-13 07:28:20,464 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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) [2021-06-13 07:28:20,464 INFO L185 Difference]: Start difference. First operand has 114 places, 90 transitions, 214 flow. Second operand 10 states and 954 transitions. [2021-06-13 07:28:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 102 transitions, 313 flow [2021-06-13 07:28:20,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 279 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-13 07:28:20,467 INFO L241 Difference]: Finished difference. Result has 117 places, 89 transitions, 226 flow [2021-06-13 07:28:20,467 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=89} [2021-06-13 07:28:20,467 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 16 predicate places. [2021-06-13 07:28:20,468 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 89 transitions, 226 flow [2021-06-13 07:28:20,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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) [2021-06-13 07:28:20,468 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:20,468 INFO L255 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] [2021-06-13 07:28:20,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 07:28:20,469 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash -611437554, now seen corresponding path program 1 times [2021-06-13 07:28:20,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:20,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151604432] [2021-06-13 07:28:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:20,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:20,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:20,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:20,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:28:20,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:20,600 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:20,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:20,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:20,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:20,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:20,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:20,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:20,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151604432] [2021-06-13 07:28:20,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151604432] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:20,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:20,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-13 07:28:20,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761048392] [2021-06-13 07:28:20,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-13 07:28:20,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-13 07:28:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-13 07:28:20,640 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2021-06-13 07:28:20,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 89 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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) [2021-06-13 07:28:20,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:20,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2021-06-13 07:28:20,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:21,030 INFO L129 PetriNetUnfolder]: 307/705 cut-off events. [2021-06-13 07:28:21,030 INFO L130 PetriNetUnfolder]: For 382/386 co-relation queries the response was YES. [2021-06-13 07:28:21,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 705 events. 307/705 cut-off events. For 382/386 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3439 event pairs, 83 based on Foata normal form. 12/696 useless extension candidates. Maximal degree in co-relation 1470. Up to 271 conditions per place. [2021-06-13 07:28:21,037 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 19 selfloop transitions, 10 changer transitions 19/119 dead transitions. [2021-06-13 07:28:21,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 403 flow [2021-06-13 07:28:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:28:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:28:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 805 transitions. [2021-06-13 07:28:21,041 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8359293873312564 [2021-06-13 07:28:21,041 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 805 transitions. [2021-06-13 07:28:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 805 transitions. [2021-06-13 07:28:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:21,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 805 transitions. [2021-06-13 07:28:21,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.44444444444444) internal successors, (805), 9 states have internal predecessors, (805), 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) [2021-06-13 07:28:21,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:21,045 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:21,045 INFO L185 Difference]: Start difference. First operand has 117 places, 89 transitions, 226 flow. Second operand 9 states and 805 transitions. [2021-06-13 07:28:21,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 403 flow [2021-06-13 07:28:21,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 119 transitions, 365 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-06-13 07:28:21,053 INFO L241 Difference]: Finished difference. Result has 114 places, 95 transitions, 266 flow [2021-06-13 07:28:21,053 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=114, PETRI_TRANSITIONS=95} [2021-06-13 07:28:21,054 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 13 predicate places. [2021-06-13 07:28:21,054 INFO L482 AbstractCegarLoop]: Abstraction has has 114 places, 95 transitions, 266 flow [2021-06-13 07:28:21,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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) [2021-06-13 07:28:21,054 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:21,054 INFO L255 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] [2021-06-13 07:28:21,055 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 07:28:21,055 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1028708466, now seen corresponding path program 2 times [2021-06-13 07:28:21,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:21,055 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760095050] [2021-06-13 07:28:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:21,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:21,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:21,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:21,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:28:21,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-13 07:28:21,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-13 07:28:21,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:28:21,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:21,283 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:21,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:21,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:21,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:21,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:21,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:21,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:21,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760095050] [2021-06-13 07:28:21,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760095050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:21,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:21,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-13 07:28:21,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349243697] [2021-06-13 07:28:21,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-13 07:28:21,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-13 07:28:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-13 07:28:21,329 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-06-13 07:28:21,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 95 transitions, 266 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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) [2021-06-13 07:28:21,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:21,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-06-13 07:28:21,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:21,868 INFO L129 PetriNetUnfolder]: 268/641 cut-off events. [2021-06-13 07:28:21,868 INFO L130 PetriNetUnfolder]: For 458/666 co-relation queries the response was YES. [2021-06-13 07:28:21,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 641 events. 268/641 cut-off events. For 458/666 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3072 event pairs, 30 based on Foata normal form. 24/650 useless extension candidates. Maximal degree in co-relation 1494. Up to 201 conditions per place. [2021-06-13 07:28:21,872 INFO L132 encePairwiseOnDemand]: 92/107 looper letters, 18 selfloop transitions, 14 changer transitions 40/140 dead transitions. [2021-06-13 07:28:21,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 140 transitions, 579 flow [2021-06-13 07:28:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-13 07:28:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-13 07:28:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1364 transitions. [2021-06-13 07:28:21,876 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7967289719626168 [2021-06-13 07:28:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1364 transitions. [2021-06-13 07:28:21,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1364 transitions. [2021-06-13 07:28:21,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:21,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1364 transitions. [2021-06-13 07:28:21,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.25) internal successors, (1364), 16 states have internal predecessors, (1364), 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) [2021-06-13 07:28:21,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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) [2021-06-13 07:28:21,883 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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) [2021-06-13 07:28:21,883 INFO L185 Difference]: Start difference. First operand has 114 places, 95 transitions, 266 flow. Second operand 16 states and 1364 transitions. [2021-06-13 07:28:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 140 transitions, 579 flow [2021-06-13 07:28:21,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 140 transitions, 543 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-06-13 07:28:21,887 INFO L241 Difference]: Finished difference. Result has 128 places, 96 transitions, 322 flow [2021-06-13 07:28:21,887 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=322, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2021-06-13 07:28:21,887 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 27 predicate places. [2021-06-13 07:28:21,888 INFO L482 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 322 flow [2021-06-13 07:28:21,888 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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) [2021-06-13 07:28:21,888 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:21,888 INFO L255 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] [2021-06-13 07:28:21,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 07:28:21,888 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -982707276, now seen corresponding path program 1 times [2021-06-13 07:28:21,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:21,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055457381] [2021-06-13 07:28:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:22,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:22,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:22,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:22,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-13 07:28:22,059 INFO L142 QuantifierPusher]: treesize reduction 30, result has 60.5 percent of original size [2021-06-13 07:28:22,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-13 07:28:22,090 INFO L142 QuantifierPusher]: treesize reduction 30, result has 58.9 percent of original size [2021-06-13 07:28:22,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-13 07:28:22,123 INFO L142 QuantifierPusher]: treesize reduction 30, result has 61.5 percent of original size [2021-06-13 07:28:22,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-13 07:28:22,156 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:22,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:22,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:22,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:22,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:22,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:22,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:22,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055457381] [2021-06-13 07:28:22,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055457381] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:22,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:22,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-13 07:28:22,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895448049] [2021-06-13 07:28:22,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-13 07:28:22,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:22,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-13 07:28:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-13 07:28:22,205 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-06-13 07:28:22,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 322 flow. Second operand has 11 states, 11 states have (on average 83.63636363636364) internal successors, (920), 11 states have internal predecessors, (920), 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) [2021-06-13 07:28:22,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:22,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-06-13 07:28:22,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:22,899 INFO L129 PetriNetUnfolder]: 223/621 cut-off events. [2021-06-13 07:28:22,899 INFO L130 PetriNetUnfolder]: For 1614/1677 co-relation queries the response was YES. [2021-06-13 07:28:22,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 621 events. 223/621 cut-off events. For 1614/1677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3329 event pairs, 13 based on Foata normal form. 29/641 useless extension candidates. Maximal degree in co-relation 1801. Up to 152 conditions per place. [2021-06-13 07:28:22,904 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 27 selfloop transitions, 11 changer transitions 41/147 dead transitions. [2021-06-13 07:28:22,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 147 transitions, 785 flow [2021-06-13 07:28:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-13 07:28:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-13 07:28:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1388 transitions. [2021-06-13 07:28:22,908 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8107476635514018 [2021-06-13 07:28:22,908 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1388 transitions. [2021-06-13 07:28:22,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1388 transitions. [2021-06-13 07:28:22,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:22,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1388 transitions. [2021-06-13 07:28:22,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.75) internal successors, (1388), 16 states have internal predecessors, (1388), 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) [2021-06-13 07:28:22,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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) [2021-06-13 07:28:22,916 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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) [2021-06-13 07:28:22,916 INFO L185 Difference]: Start difference. First operand has 128 places, 96 transitions, 322 flow. Second operand 16 states and 1388 transitions. [2021-06-13 07:28:22,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 147 transitions, 785 flow [2021-06-13 07:28:22,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 722 flow, removed 17 selfloop flow, removed 12 redundant places. [2021-06-13 07:28:22,922 INFO L241 Difference]: Finished difference. Result has 137 places, 102 transitions, 398 flow [2021-06-13 07:28:22,922 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=398, PETRI_PLACES=137, PETRI_TRANSITIONS=102} [2021-06-13 07:28:22,922 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 36 predicate places. [2021-06-13 07:28:22,922 INFO L482 AbstractCegarLoop]: Abstraction has has 137 places, 102 transitions, 398 flow [2021-06-13 07:28:22,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 83.63636363636364) internal successors, (920), 11 states have internal predecessors, (920), 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) [2021-06-13 07:28:22,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:22,923 INFO L255 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] [2021-06-13 07:28:22,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 07:28:22,923 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1535463800, now seen corresponding path program 1 times [2021-06-13 07:28:22,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:22,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953365408] [2021-06-13 07:28:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:23,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:23,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:23,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:23,034 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-06-13 07:28:23,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-13 07:28:23,052 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-06-13 07:28:23,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-13 07:28:23,072 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:23,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:23,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:23,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:23,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:23,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:23,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953365408] [2021-06-13 07:28:23,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953365408] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:23,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:23,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-13 07:28:23,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876801998] [2021-06-13 07:28:23,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-13 07:28:23,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-13 07:28:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-13 07:28:23,114 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2021-06-13 07:28:23,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 102 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 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) [2021-06-13 07:28:23,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:23,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2021-06-13 07:28:23,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:23,474 INFO L129 PetriNetUnfolder]: 140/487 cut-off events. [2021-06-13 07:28:23,475 INFO L130 PetriNetUnfolder]: For 1421/1525 co-relation queries the response was YES. [2021-06-13 07:28:23,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 487 events. 140/487 cut-off events. For 1421/1525 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2665 event pairs, 44 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 1419. Up to 220 conditions per place. [2021-06-13 07:28:23,480 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 25 selfloop transitions, 11 changer transitions 19/127 dead transitions. [2021-06-13 07:28:23,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 127 transitions, 643 flow [2021-06-13 07:28:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-13 07:28:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-13 07:28:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 990 transitions. [2021-06-13 07:28:23,483 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8411214953271028 [2021-06-13 07:28:23,483 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 990 transitions. [2021-06-13 07:28:23,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 990 transitions. [2021-06-13 07:28:23,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:23,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 990 transitions. [2021-06-13 07:28:23,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.0) internal successors, (990), 11 states have internal predecessors, (990), 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) [2021-06-13 07:28:23,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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) [2021-06-13 07:28:23,488 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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) [2021-06-13 07:28:23,488 INFO L185 Difference]: Start difference. First operand has 137 places, 102 transitions, 398 flow. Second operand 11 states and 990 transitions. [2021-06-13 07:28:23,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 127 transitions, 643 flow [2021-06-13 07:28:23,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 563 flow, removed 37 selfloop flow, removed 12 redundant places. [2021-06-13 07:28:23,518 INFO L241 Difference]: Finished difference. Result has 133 places, 107 transitions, 444 flow [2021-06-13 07:28:23,519 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=444, PETRI_PLACES=133, PETRI_TRANSITIONS=107} [2021-06-13 07:28:23,519 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 32 predicate places. [2021-06-13 07:28:23,519 INFO L482 AbstractCegarLoop]: Abstraction has has 133 places, 107 transitions, 444 flow [2021-06-13 07:28:23,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 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) [2021-06-13 07:28:23,519 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:23,519 INFO L255 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] [2021-06-13 07:28:23,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 07:28:23,520 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1371265084, now seen corresponding path program 2 times [2021-06-13 07:28:23,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:23,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416050189] [2021-06-13 07:28:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:23,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:23,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:23,603 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:28:23,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:28:23,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:23,627 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:28:23,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:23,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:23,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:23,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:23,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416050189] [2021-06-13 07:28:23,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416050189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:23,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:23,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:28:23,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374812358] [2021-06-13 07:28:23,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:28:23,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:23,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:28:23,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:28:23,644 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-06-13 07:28:23,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 107 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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) [2021-06-13 07:28:23,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:23,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-06-13 07:28:23,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:23,948 INFO L129 PetriNetUnfolder]: 606/1528 cut-off events. [2021-06-13 07:28:23,949 INFO L130 PetriNetUnfolder]: For 1665/1720 co-relation queries the response was YES. [2021-06-13 07:28:23,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 1528 events. 606/1528 cut-off events. For 1665/1720 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 11897 event pairs, 98 based on Foata normal form. 48/1451 useless extension candidates. Maximal degree in co-relation 3405. Up to 453 conditions per place. [2021-06-13 07:28:23,964 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 19 selfloop transitions, 16 changer transitions 0/127 dead transitions. [2021-06-13 07:28:23,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 531 flow [2021-06-13 07:28:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:28:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:28:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2021-06-13 07:28:23,967 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9075804776739356 [2021-06-13 07:28:23,967 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2021-06-13 07:28:23,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2021-06-13 07:28:23,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:23,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2021-06-13 07:28:23,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 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) [2021-06-13 07:28:23,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:23,972 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2021-06-13 07:28:23,972 INFO L185 Difference]: Start difference. First operand has 133 places, 107 transitions, 444 flow. Second operand 9 states and 874 transitions. [2021-06-13 07:28:23,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 127 transitions, 531 flow [2021-06-13 07:28:23,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 492 flow, removed 10 selfloop flow, removed 9 redundant places. [2021-06-13 07:28:23,981 INFO L241 Difference]: Finished difference. Result has 131 places, 116 transitions, 483 flow [2021-06-13 07:28:23,981 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2021-06-13 07:28:23,982 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 30 predicate places. [2021-06-13 07:28:23,982 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 483 flow [2021-06-13 07:28:23,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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) [2021-06-13 07:28:23,982 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:23,982 INFO L255 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] [2021-06-13 07:28:23,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-13 07:28:23,982 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1164517645, now seen corresponding path program 1 times [2021-06-13 07:28:23,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:23,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198298669] [2021-06-13 07:28:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:24,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:24,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:24,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:24,081 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:28:24,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:28:24,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:24,105 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:28:24,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:24,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:24,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:24,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198298669] [2021-06-13 07:28:24,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198298669] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:24,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:24,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:28:24,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342481217] [2021-06-13 07:28:24,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:28:24,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:28:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:28:24,118 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-06-13 07:28:24,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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) [2021-06-13 07:28:24,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:24,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-06-13 07:28:24,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:24,465 INFO L129 PetriNetUnfolder]: 518/1475 cut-off events. [2021-06-13 07:28:24,465 INFO L130 PetriNetUnfolder]: For 3494/4690 co-relation queries the response was YES. [2021-06-13 07:28:24,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 1475 events. 518/1475 cut-off events. For 3494/4690 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 12337 event pairs, 5 based on Foata normal form. 276/1642 useless extension candidates. Maximal degree in co-relation 4768. Up to 522 conditions per place. [2021-06-13 07:28:24,479 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 15 selfloop transitions, 31 changer transitions 6/144 dead transitions. [2021-06-13 07:28:24,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 144 transitions, 768 flow [2021-06-13 07:28:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-13 07:28:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-13 07:28:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1166 transitions. [2021-06-13 07:28:24,482 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9080996884735203 [2021-06-13 07:28:24,482 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1166 transitions. [2021-06-13 07:28:24,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1166 transitions. [2021-06-13 07:28:24,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:24,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1166 transitions. [2021-06-13 07:28:24,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 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) [2021-06-13 07:28:24,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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) [2021-06-13 07:28:24,488 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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) [2021-06-13 07:28:24,488 INFO L185 Difference]: Start difference. First operand has 131 places, 116 transitions, 483 flow. Second operand 12 states and 1166 transitions. [2021-06-13 07:28:24,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 144 transitions, 768 flow [2021-06-13 07:28:24,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 144 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-13 07:28:24,497 INFO L241 Difference]: Finished difference. Result has 144 places, 135 transitions, 711 flow [2021-06-13 07:28:24,498 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=711, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2021-06-13 07:28:24,498 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 43 predicate places. [2021-06-13 07:28:24,498 INFO L482 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 711 flow [2021-06-13 07:28:24,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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) [2021-06-13 07:28:24,498 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:24,498 INFO L255 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] [2021-06-13 07:28:24,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-13 07:28:24,499 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1613117412, now seen corresponding path program 1 times [2021-06-13 07:28:24,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:24,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282086171] [2021-06-13 07:28:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:24,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:24,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:24,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:24,630 INFO L142 QuantifierPusher]: treesize reduction 9, result has 72.7 percent of original size [2021-06-13 07:28:24,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-13 07:28:24,645 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-13 07:28:24,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-13 07:28:24,668 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-06-13 07:28:24,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-06-13 07:28:24,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-13 07:28:24,709 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-06-13 07:28:24,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-13 07:28:24,726 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-06-13 07:28:24,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-13 07:28:24,740 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.0 percent of original size [2021-06-13 07:28:24,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-13 07:28:24,768 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:24,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:24,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:24,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:24,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:24,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:24,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:24,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282086171] [2021-06-13 07:28:24,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282086171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:24,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:24,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-13 07:28:24,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509259390] [2021-06-13 07:28:24,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-13 07:28:24,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-13 07:28:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-13 07:28:24,812 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2021-06-13 07:28:24,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 711 flow. Second operand has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 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) [2021-06-13 07:28:24,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:24,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2021-06-13 07:28:24,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:25,640 INFO L129 PetriNetUnfolder]: 568/2036 cut-off events. [2021-06-13 07:28:25,640 INFO L130 PetriNetUnfolder]: For 6489/7096 co-relation queries the response was YES. [2021-06-13 07:28:25,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 2036 events. 568/2036 cut-off events. For 6489/7096 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 20196 event pairs, 16 based on Foata normal form. 14/1924 useless extension candidates. Maximal degree in co-relation 6870. Up to 605 conditions per place. [2021-06-13 07:28:25,658 INFO L132 encePairwiseOnDemand]: 93/107 looper letters, 42 selfloop transitions, 19 changer transitions 17/178 dead transitions. [2021-06-13 07:28:25,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 178 transitions, 1199 flow [2021-06-13 07:28:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-13 07:28:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-06-13 07:28:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1584 transitions. [2021-06-13 07:28:25,662 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7791441219872111 [2021-06-13 07:28:25,662 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1584 transitions. [2021-06-13 07:28:25,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1584 transitions. [2021-06-13 07:28:25,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:25,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1584 transitions. [2021-06-13 07:28:25,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 83.36842105263158) internal successors, (1584), 19 states have internal predecessors, (1584), 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) [2021-06-13 07:28:25,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 107.0) internal successors, (2140), 20 states have internal predecessors, (2140), 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) [2021-06-13 07:28:25,675 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 107.0) internal successors, (2140), 20 states have internal predecessors, (2140), 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) [2021-06-13 07:28:25,675 INFO L185 Difference]: Start difference. First operand has 144 places, 135 transitions, 711 flow. Second operand 19 states and 1584 transitions. [2021-06-13 07:28:25,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 178 transitions, 1199 flow [2021-06-13 07:28:25,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 178 transitions, 1085 flow, removed 44 selfloop flow, removed 6 redundant places. [2021-06-13 07:28:25,734 INFO L241 Difference]: Finished difference. Result has 169 places, 143 transitions, 773 flow [2021-06-13 07:28:25,735 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=773, PETRI_PLACES=169, PETRI_TRANSITIONS=143} [2021-06-13 07:28:25,735 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 68 predicate places. [2021-06-13 07:28:25,735 INFO L482 AbstractCegarLoop]: Abstraction has has 169 places, 143 transitions, 773 flow [2021-06-13 07:28:25,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 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) [2021-06-13 07:28:25,735 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:25,736 INFO L255 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] [2021-06-13 07:28:25,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-13 07:28:25,736 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1306016948, now seen corresponding path program 1 times [2021-06-13 07:28:25,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:25,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451796324] [2021-06-13 07:28:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:25,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:25,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:25,838 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-06-13 07:28:25,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-13 07:28:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:28:25,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:25,867 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:25,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:25,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:25,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:25,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:25,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:25,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:25,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451796324] [2021-06-13 07:28:25,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451796324] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:25,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:25,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-13 07:28:25,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641912759] [2021-06-13 07:28:25,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-13 07:28:25,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-13 07:28:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-13 07:28:25,908 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-06-13 07:28:25,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 143 transitions, 773 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 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) [2021-06-13 07:28:25,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:25,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-06-13 07:28:25,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:26,462 INFO L129 PetriNetUnfolder]: 690/2411 cut-off events. [2021-06-13 07:28:26,463 INFO L130 PetriNetUnfolder]: For 4136/4362 co-relation queries the response was YES. [2021-06-13 07:28:26,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 2411 events. 690/2411 cut-off events. For 4136/4362 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 25068 event pairs, 25 based on Foata normal form. 14/2265 useless extension candidates. Maximal degree in co-relation 6286. Up to 302 conditions per place. [2021-06-13 07:28:26,486 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 47 selfloop transitions, 15 changer transitions 11/174 dead transitions. [2021-06-13 07:28:26,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 174 transitions, 1213 flow [2021-06-13 07:28:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:28:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:28:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 860 transitions. [2021-06-13 07:28:26,488 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8037383177570093 [2021-06-13 07:28:26,488 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 860 transitions. [2021-06-13 07:28:26,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 860 transitions. [2021-06-13 07:28:26,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:26,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 860 transitions. [2021-06-13 07:28:26,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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) [2021-06-13 07:28:26,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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) [2021-06-13 07:28:26,492 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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) [2021-06-13 07:28:26,492 INFO L185 Difference]: Start difference. First operand has 169 places, 143 transitions, 773 flow. Second operand 10 states and 860 transitions. [2021-06-13 07:28:26,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 174 transitions, 1213 flow [2021-06-13 07:28:26,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 174 transitions, 1123 flow, removed 40 selfloop flow, removed 13 redundant places. [2021-06-13 07:28:26,530 INFO L241 Difference]: Finished difference. Result has 163 places, 151 transitions, 850 flow [2021-06-13 07:28:26,531 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=850, PETRI_PLACES=163, PETRI_TRANSITIONS=151} [2021-06-13 07:28:26,531 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 62 predicate places. [2021-06-13 07:28:26,531 INFO L482 AbstractCegarLoop]: Abstraction has has 163 places, 151 transitions, 850 flow [2021-06-13 07:28:26,531 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 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) [2021-06-13 07:28:26,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:26,532 INFO L255 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] [2021-06-13 07:28:26,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-13 07:28:26,532 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash 157172944, now seen corresponding path program 2 times [2021-06-13 07:28:26,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:26,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312202040] [2021-06-13 07:28:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:26,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:26,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:26,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:26,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:26,618 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:28:26,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:28:26,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:26,642 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:28:26,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:26,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:26,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:26,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:26,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312202040] [2021-06-13 07:28:26,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312202040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:26,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:26,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:28:26,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808363185] [2021-06-13 07:28:26,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:28:26,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:28:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:28:26,657 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-06-13 07:28:26,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 151 transitions, 850 flow. Second operand has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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) [2021-06-13 07:28:26,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:26,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-06-13 07:28:26,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:27,184 INFO L129 PetriNetUnfolder]: 840/2582 cut-off events. [2021-06-13 07:28:27,184 INFO L130 PetriNetUnfolder]: For 3349/5738 co-relation queries the response was YES. [2021-06-13 07:28:27,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 2582 events. 840/2582 cut-off events. For 3349/5738 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 26715 event pairs, 0 based on Foata normal form. 621/3001 useless extension candidates. Maximal degree in co-relation 7410. Up to 512 conditions per place. [2021-06-13 07:28:27,207 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 10 selfloop transitions, 36 changer transitions 31/169 dead transitions. [2021-06-13 07:28:27,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 1065 flow [2021-06-13 07:28:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-13 07:28:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-13 07:28:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1446 transitions. [2021-06-13 07:28:27,210 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9009345794392524 [2021-06-13 07:28:27,210 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1446 transitions. [2021-06-13 07:28:27,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1446 transitions. [2021-06-13 07:28:27,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:27,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1446 transitions. [2021-06-13 07:28:27,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 96.4) internal successors, (1446), 15 states have internal predecessors, (1446), 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) [2021-06-13 07:28:27,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 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) [2021-06-13 07:28:27,228 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 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) [2021-06-13 07:28:27,229 INFO L185 Difference]: Start difference. First operand has 163 places, 151 transitions, 850 flow. Second operand 15 states and 1446 transitions. [2021-06-13 07:28:27,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 1065 flow [2021-06-13 07:28:27,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 169 transitions, 988 flow, removed 27 selfloop flow, removed 12 redundant places. [2021-06-13 07:28:27,260 INFO L241 Difference]: Finished difference. Result has 168 places, 135 transitions, 728 flow [2021-06-13 07:28:27,261 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=728, PETRI_PLACES=168, PETRI_TRANSITIONS=135} [2021-06-13 07:28:27,261 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 67 predicate places. [2021-06-13 07:28:27,261 INFO L482 AbstractCegarLoop]: Abstraction has has 168 places, 135 transitions, 728 flow [2021-06-13 07:28:27,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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) [2021-06-13 07:28:27,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:27,261 INFO L255 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] [2021-06-13 07:28:27,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-13 07:28:27,262 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1822566897, now seen corresponding path program 1 times [2021-06-13 07:28:27,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:27,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527328401] [2021-06-13 07:28:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:27,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:27,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:27,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:28:27,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:28:27,425 INFO L142 QuantifierPusher]: treesize reduction 9, result has 72.7 percent of original size [2021-06-13 07:28:27,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-13 07:28:27,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-13 07:28:27,453 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-13 07:28:27,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-13 07:28:27,466 INFO L142 QuantifierPusher]: treesize reduction 7, result has 93.4 percent of original size [2021-06-13 07:28:27,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2021-06-13 07:28:27,522 INFO L142 QuantifierPusher]: treesize reduction 29, result has 58.0 percent of original size [2021-06-13 07:28:27,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-06-13 07:28:27,552 INFO L142 QuantifierPusher]: treesize reduction 48, result has 37.7 percent of original size [2021-06-13 07:28:27,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-13 07:28:27,580 INFO L142 QuantifierPusher]: treesize reduction 19, result has 75.0 percent of original size [2021-06-13 07:28:27,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-06-13 07:28:27,609 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:28:27,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:28:27,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:27,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:28:27,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:27,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:27,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:27,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527328401] [2021-06-13 07:28:27,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527328401] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:27,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:27,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-13 07:28:27,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734417702] [2021-06-13 07:28:27,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-13 07:28:27,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-13 07:28:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-06-13 07:28:27,657 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2021-06-13 07:28:27,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 135 transitions, 728 flow. Second operand has 14 states, 14 states have (on average 79.71428571428571) internal successors, (1116), 14 states have internal predecessors, (1116), 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) [2021-06-13 07:28:27,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:27,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2021-06-13 07:28:27,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:28,257 INFO L129 PetriNetUnfolder]: 320/1364 cut-off events. [2021-06-13 07:28:28,257 INFO L130 PetriNetUnfolder]: For 2752/2880 co-relation queries the response was YES. [2021-06-13 07:28:28,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3909 conditions, 1364 events. 320/1364 cut-off events. For 2752/2880 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 13343 event pairs, 3 based on Foata normal form. 10/1305 useless extension candidates. Maximal degree in co-relation 3838. Up to 171 conditions per place. [2021-06-13 07:28:28,266 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 26 selfloop transitions, 9 changer transitions 12/145 dead transitions. [2021-06-13 07:28:28,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 145 transitions, 888 flow [2021-06-13 07:28:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-13 07:28:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-13 07:28:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 895 transitions. [2021-06-13 07:28:28,268 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7604078164825828 [2021-06-13 07:28:28,269 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 895 transitions. [2021-06-13 07:28:28,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 895 transitions. [2021-06-13 07:28:28,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:28,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 895 transitions. [2021-06-13 07:28:28,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.36363636363636) internal successors, (895), 11 states have internal predecessors, (895), 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) [2021-06-13 07:28:28,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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) [2021-06-13 07:28:28,272 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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) [2021-06-13 07:28:28,272 INFO L185 Difference]: Start difference. First operand has 168 places, 135 transitions, 728 flow. Second operand 11 states and 895 transitions. [2021-06-13 07:28:28,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 145 transitions, 888 flow [2021-06-13 07:28:28,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 145 transitions, 751 flow, removed 30 selfloop flow, removed 21 redundant places. [2021-06-13 07:28:28,293 INFO L241 Difference]: Finished difference. Result has 157 places, 131 transitions, 620 flow [2021-06-13 07:28:28,294 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=620, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2021-06-13 07:28:28,294 INFO L335 CegarLoopForPetriNet]: 101 programPoint places, 56 predicate places. [2021-06-13 07:28:28,294 INFO L482 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 620 flow [2021-06-13 07:28:28,294 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 79.71428571428571) internal successors, (1116), 14 states have internal predecessors, (1116), 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) [2021-06-13 07:28:28,294 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:28,294 INFO L255 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] [2021-06-13 07:28:28,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-13 07:28:28,295 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1661350839, now seen corresponding path program 2 times [2021-06-13 07:28:28,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:28,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869884026] [2021-06-13 07:28:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:28:28,347 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:28:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:28:28,410 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:28:28,459 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 07:28:28,460 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 07:28:28,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-13 07:28:28,460 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-13 07:28:28,462 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:28:28,462 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:28:28,462 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:28:28,462 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:28:28,462 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:28:28,463 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:28:28,463 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:28:28,463 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:28:28,463 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork2======== [2021-06-13 07:28:28,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:28,479 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-06-13 07:28:28,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:28,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:28:28,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-06-13 07:28:28,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-06-13 07:28:28,482 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-06-13 07:28:28,482 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:28,482 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:28:28,482 INFO L255 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] [2021-06-13 07:28:28,483 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:28:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:28:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2090399406, now seen corresponding path program 1 times [2021-06-13 07:28:28,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:28:28,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170332085] [2021-06-13 07:28:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:28:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:28:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:28,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:28:28,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:28:28,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:28:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:28:28,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:28:28,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170332085] [2021-06-13 07:28:28,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170332085] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:28:28,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:28:28,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 07:28:28,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117831065] [2021-06-13 07:28:28,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 07:28:28,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:28:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 07:28:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 07:28:28,506 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 107 [2021-06-13 07:28:28,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2021-06-13 07:28:28,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:28:28,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 107 [2021-06-13 07:28:28,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:28:28,600 INFO L129 PetriNetUnfolder]: 115/686 cut-off events. [2021-06-13 07:28:28,600 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:28:28,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 686 events. 115/686 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4541 event pairs, 92 based on Foata normal form. 34/676 useless extension candidates. Maximal degree in co-relation 836. Up to 141 conditions per place. [2021-06-13 07:28:28,602 INFO L132 encePairwiseOnDemand]: 102/107 looper letters, 0 selfloop transitions, 0 changer transitions 106/106 dead transitions. [2021-06-13 07:28:28,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 251 flow [2021-06-13 07:28:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 07:28:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-13 07:28:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2021-06-13 07:28:28,604 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.940809968847352 [2021-06-13 07:28:28,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2021-06-13 07:28:28,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2021-06-13 07:28:28,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:28:28,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2021-06-13 07:28:28,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2021-06-13 07:28:28,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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) [2021-06-13 07:28:28,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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) [2021-06-13 07:28:28,605 INFO L185 Difference]: Start difference. First operand has 112 places, 104 transitions, 217 flow. Second operand 3 states and 302 transitions. [2021-06-13 07:28:28,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 251 flow [2021-06-13 07:28:28,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 106 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:28:28,607 INFO L241 Difference]: Finished difference. Result has 109 places, 0 transitions, 0 flow [2021-06-13 07:28:28,607 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=109, PETRI_TRANSITIONS=0} [2021-06-13 07:28:28,607 INFO L335 CegarLoopForPetriNet]: 112 programPoint places, -3 predicate places. [2021-06-13 07:28:28,607 INFO L482 AbstractCegarLoop]: Abstraction has has 109 places, 0 transitions, 0 flow [2021-06-13 07:28:28,607 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2021-06-13 07:28:28,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-13 07:28:28,608 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork2 was SAFE (3/3) [2021-06-13 07:28:28,608 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 07:28:28,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 07:28:28 BasicIcfg [2021-06-13 07:28:28,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 07:28:28,772 INFO L168 Benchmark]: Toolchain (without parser) took 14088.43 ms. Allocated memory was 195.0 MB in the beginning and 553.6 MB in the end (delta: 358.6 MB). Free memory was 157.6 MB in the beginning and 302.6 MB in the end (delta: -145.1 MB). Peak memory consumption was 213.7 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,772 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 195.0 MB. Free memory is still 176.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 07:28:28,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.02 ms. Allocated memory is still 195.0 MB. Free memory was 157.4 MB in the beginning and 150.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.84 ms. Allocated memory is still 195.0 MB. Free memory was 150.1 MB in the beginning and 147.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,772 INFO L168 Benchmark]: Boogie Preprocessor took 80.41 ms. Allocated memory is still 195.0 MB. Free memory was 147.5 MB in the beginning and 144.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,773 INFO L168 Benchmark]: RCFGBuilder took 2911.15 ms. Allocated memory was 195.0 MB in the beginning and 238.0 MB in the end (delta: 43.0 MB). Free memory was 144.3 MB in the beginning and 149.3 MB in the end (delta: -5.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,773 INFO L168 Benchmark]: TraceAbstraction took 10450.49 ms. Allocated memory was 238.0 MB in the beginning and 553.6 MB in the end (delta: 315.6 MB). Free memory was 148.8 MB in the beginning and 302.6 MB in the end (delta: -153.8 MB). Peak memory consumption was 161.3 MB. Max. memory is 8.0 GB. [2021-06-13 07:28:28,773 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.12 ms. Allocated memory is still 195.0 MB. Free memory is still 176.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 578.02 ms. Allocated memory is still 195.0 MB. Free memory was 157.4 MB in the beginning and 150.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.84 ms. Allocated memory is still 195.0 MB. Free memory was 150.1 MB in the beginning and 147.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.41 ms. Allocated memory is still 195.0 MB. Free memory was 147.5 MB in the beginning and 144.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2911.15 ms. Allocated memory was 195.0 MB in the beginning and 238.0 MB in the end (delta: 43.0 MB). Free memory was 144.3 MB in the beginning and 149.3 MB in the end (delta: -5.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10450.49 ms. Allocated memory was 238.0 MB in the beginning and 553.6 MB in the end (delta: 315.6 MB). Free memory was 148.8 MB in the beginning and 302.6 MB in the end (delta: -153.8 MB). Peak memory consumption was 161.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1861; VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1862; VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L850] 0 pthread_t t1863; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L797] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L798] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L799] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L801] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L801] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L802] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __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=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L813] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L814] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L817] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0 with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 50.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 22.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9953.7ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6309.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 176 SDtfs, 497 SDslu, 666 SDs, 0 SdLazy, 1138 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1347.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 2993.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=12, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.4ms SsaConstructionTime, 990.8ms SatisfiabilityAnalysisTime, 2172.9ms InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 5680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 145.3ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 101.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 2.3ms SatisfiabilityAnalysisTime, 13.2ms InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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! Received shutdown request...