/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 20:42:55,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 20:42:55,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 20:42:55,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 20:42:55,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 20:42:55,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 20:42:55,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 20:42:55,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 20:42:55,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 20:42:55,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 20:42:55,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 20:42:55,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 20:42:55,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 20:42:55,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 20:42:55,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 20:42:55,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 20:42:55,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 20:42:55,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 20:42:55,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 20:42:55,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 20:42:55,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 20:42:55,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 20:42:55,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 20:42:55,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 20:42:55,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 20:42:55,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 20:42:55,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 20:42:55,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 20:42:55,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 20:42:55,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 20:42:55,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 20:42:55,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 20:42:55,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 20:42:55,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 20:42:55,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 20:42:55,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 20:42:55,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 20:42:55,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 20:42:55,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 20:42:55,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 20:42:55,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 20:42:55,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-06-10 20:42:55,579 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 20:42:55,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 20:42:55,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 20:42:55,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 20:42:55,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 20:42:55,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 20:42:55,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 20:42:55,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 20:42:55,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:42:55,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 20:42:55,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 20:42:55,587 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-10 20:42:55,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 20:42:55,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 20:42:55,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 20:42:55,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 20:42:55,897 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 20:42:55,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2021-06-10 20:42:55,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f06fa321/15710e69db7941ee9189377f5fb15fd7/FLAG92a45f3ae [2021-06-10 20:42:56,737 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 20:42:56,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2021-06-10 20:42:56,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f06fa321/15710e69db7941ee9189377f5fb15fd7/FLAG92a45f3ae [2021-06-10 20:42:56,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f06fa321/15710e69db7941ee9189377f5fb15fd7 [2021-06-10 20:42:56,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 20:42:56,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 20:42:56,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 20:42:56,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 20:42:56,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 20:42:56,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:42:56" (1/1) ... [2021-06-10 20:42:56,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521cfb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:56, skipping insertion in model container [2021-06-10 20:42:56,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:42:56" (1/1) ... [2021-06-10 20:42:56,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 20:42:56,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 20:42:57,021 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i[949,962] [2021-06-10 20:42:57,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:42:57,195 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 20:42:57,205 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i[949,962] [2021-06-10 20:42:57,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:42:57,315 INFO L208 MainTranslator]: Completed translation [2021-06-10 20:42:57,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57 WrapperNode [2021-06-10 20:42:57,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 20:42:57,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 20:42:57,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 20:42:57,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 20:42:57,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 20:42:57,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 20:42:57,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 20:42:57,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 20:42:57,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (1/1) ... [2021-06-10 20:42:57,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 20:42:57,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 20:42:57,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 20:42:57,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 20:42:57,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (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-10 20:42:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 20:42:57,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 20:42:57,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 20:42:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 20:42:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 20:42:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 20:42:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 20:42:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 20:42:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 20:42:57,490 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 20:42:59,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 20:42:59,186 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 20:42:59,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:42:59 BoogieIcfgContainer [2021-06-10 20:42:59,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 20:42:59,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 20:42:59,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 20:42:59,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 20:42:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 08:42:56" (1/3) ... [2021-06-10 20:42:59,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259d8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:42:59, skipping insertion in model container [2021-06-10 20:42:59,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:42:57" (2/3) ... [2021-06-10 20:42:59,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259d8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:42:59, skipping insertion in model container [2021-06-10 20:42:59,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:42:59" (3/3) ... [2021-06-10 20:42:59,195 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2021-06-10 20:42:59,201 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 20:42:59,204 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 20:42:59,205 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 20:42:59,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,261 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,261 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:42:59,271 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 20:42:59,287 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 20:42:59,304 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 20:42:59,304 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 20:42:59,304 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 20:42:59,304 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 20:42:59,304 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 20:42:59,304 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 20:42:59,304 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 20:42:59,304 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 20:42:59,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-06-10 20:42:59,343 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-06-10 20:42:59,343 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:42:59,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-10 20:42:59,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-06-10 20:42:59,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-06-10 20:42:59,352 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 20:42:59,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-06-10 20:42:59,365 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-06-10 20:42:59,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-06-10 20:42:59,383 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-06-10 20:42:59,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:42:59,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-10 20:42:59,387 INFO L151 LiptonReduction]: Number of co-enabled transitions 1872 [2021-06-10 20:42:59,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:42:59,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,959 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 20:42:59,959 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:42:59,985 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:42:59,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:00,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:00,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:00,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:00,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:00,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:00,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:00,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:00,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:00,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,890 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 20:43:00,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:00,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:00,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:01,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:01,634 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 20:43:02,071 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-10 20:43:02,199 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-10 20:43:02,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:02,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 20:43:02,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:02,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,251 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-10 20:43:02,251 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:43:02,254 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,266 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-10 20:43:02,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:02,268 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-10 20:43:02,269 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-10 20:43:02,269 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:43:02,274 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,278 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-10 20:43:02,279 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-10 20:43:02,280 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:43:02,283 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,289 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-10 20:43:02,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:02,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:02,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:02,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:02,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:02,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:02,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:02,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:02,941 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 20:43:03,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:03,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:03,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:03,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:03,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:03,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:03,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:03,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:03,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:04,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 20:43:04,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:04,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 20:43:04,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 20:43:04,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:43:04,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 20:43:04,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:04,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:04,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:04,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:04,800 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-10 20:43:04,974 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-10 20:43:05,303 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-10 20:43:05,469 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-10 20:43:05,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:05,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:43:05,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:05,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:05,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:43:05,562 INFO L163 LiptonReduction]: Checked pairs total: 6374 [2021-06-10 20:43:05,562 INFO L165 LiptonReduction]: Total number of compositions: 92 [2021-06-10 20:43:05,564 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6213 [2021-06-10 20:43:05,570 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 20:43:05,570 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:43:05,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:05,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 20:43:05,571 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1080441, now seen corresponding path program 1 times [2021-06-10 20:43:05,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:05,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642499189] [2021-06-10 20:43:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:05,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:05,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:05,708 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-10 20:43:05,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642499189] [2021-06-10 20:43:05,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:05,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:43:05,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277351718] [2021-06-10 20:43:05,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:43:05,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:43:05,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:43:05,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 194 [2021-06-10 20:43:05,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-10 20:43:05,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:05,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 194 [2021-06-10 20:43:05,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:05,807 INFO L129 PetriNetUnfolder]: 49/143 cut-off events. [2021-06-10 20:43:05,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:43:05,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 143 events. 49/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 644 event pairs, 38 based on Foata normal form. 35/160 useless extension candidates. Maximal degree in co-relation 229. Up to 65 conditions per place. [2021-06-10 20:43:05,810 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2021-06-10 20:43:05,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 93 flow [2021-06-10 20:43:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:43:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:43:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2021-06-10 20:43:05,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8470790378006873 [2021-06-10 20:43:05,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2021-06-10 20:43:05,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2021-06-10 20:43:05,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:05,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2021-06-10 20:43:05,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-10 20:43:05,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-10 20:43:05,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-10 20:43:05,839 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 493 transitions. [2021-06-10 20:43:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 93 flow [2021-06-10 20:43:05,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 20:43:05,843 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 62 flow [2021-06-10 20:43:05,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-06-10 20:43:05,845 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2021-06-10 20:43:05,845 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 62 flow [2021-06-10 20:43:05,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-10 20:43:05,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:05,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:05,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 20:43:05,846 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1267648708, now seen corresponding path program 1 times [2021-06-10 20:43:05,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:05,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791001406] [2021-06-10 20:43:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:05,945 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:43:05,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:05,960 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-10 20:43:05,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791001406] [2021-06-10 20:43:05,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:05,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:43:05,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157313270] [2021-06-10 20:43:05,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:43:05,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:43:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:43:05,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2021-06-10 20:43:05,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:43:05,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:05,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2021-06-10 20:43:05,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,081 INFO L129 PetriNetUnfolder]: 148/403 cut-off events. [2021-06-10 20:43:06,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:43:06,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 403 events. 148/403 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2538 event pairs, 54 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 667. Up to 181 conditions per place. [2021-06-10 20:43:06,087 INFO L132 encePairwiseOnDemand]: 185/194 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-06-10 20:43:06,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 108 flow [2021-06-10 20:43:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:43:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:43:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-06-10 20:43:06,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.802405498281787 [2021-06-10 20:43:06,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-06-10 20:43:06,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-06-10 20:43:06,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-06-10 20:43:06,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-10 20:43:06,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-10 20:43:06,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-10 20:43:06,096 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 62 flow. Second operand 3 states and 467 transitions. [2021-06-10 20:43:06,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 108 flow [2021-06-10 20:43:06,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:43:06,097 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 110 flow [2021-06-10 20:43:06,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-10 20:43:06,098 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-06-10 20:43:06,098 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 110 flow [2021-06-10 20:43:06,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:43:06,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 20:43:06,099 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1301394139, now seen corresponding path program 1 times [2021-06-10 20:43:06,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145183036] [2021-06-10 20:43:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:06,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:06,186 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:43:06,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:06,196 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-10 20:43:06,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145183036] [2021-06-10 20:43:06,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:06,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:43:06,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636696057] [2021-06-10 20:43:06,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:43:06,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:43:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:43:06,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2021-06-10 20:43:06,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-10 20:43:06,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:06,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2021-06-10 20:43:06,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,253 INFO L129 PetriNetUnfolder]: 57/187 cut-off events. [2021-06-10 20:43:06,254 INFO L130 PetriNetUnfolder]: For 43/144 co-relation queries the response was YES. [2021-06-10 20:43:06,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 187 events. 57/187 cut-off events. For 43/144 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 900 event pairs, 8 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 467. Up to 96 conditions per place. [2021-06-10 20:43:06,255 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 12 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-06-10 20:43:06,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 182 flow [2021-06-10 20:43:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:43:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:43:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2021-06-10 20:43:06,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7951030927835051 [2021-06-10 20:43:06,258 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2021-06-10 20:43:06,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2021-06-10 20:43:06,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2021-06-10 20:43:06,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 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-10 20:43:06,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,262 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,262 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 110 flow. Second operand 4 states and 617 transitions. [2021-06-10 20:43:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 182 flow [2021-06-10 20:43:06,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:43:06,265 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 154 flow [2021-06-10 20:43:06,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2021-06-10 20:43:06,265 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2021-06-10 20:43:06,265 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 154 flow [2021-06-10 20:43:06,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-10 20:43:06,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,266 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 20:43:06,266 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1538797728, now seen corresponding path program 1 times [2021-06-10 20:43:06,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694572892] [2021-06-10 20:43:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:06,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:06,313 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:43:06,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:06,324 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-10 20:43:06,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694572892] [2021-06-10 20:43:06,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:06,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:43:06,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495825237] [2021-06-10 20:43:06,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:43:06,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:43:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:43:06,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2021-06-10 20:43:06,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-10 20:43:06,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:06,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2021-06-10 20:43:06,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,376 INFO L129 PetriNetUnfolder]: 51/191 cut-off events. [2021-06-10 20:43:06,377 INFO L130 PetriNetUnfolder]: For 117/214 co-relation queries the response was YES. [2021-06-10 20:43:06,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 191 events. 51/191 cut-off events. For 117/214 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1001 event pairs, 23 based on Foata normal form. 7/193 useless extension candidates. Maximal degree in co-relation 508. Up to 88 conditions per place. [2021-06-10 20:43:06,379 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 8 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2021-06-10 20:43:06,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 230 flow [2021-06-10 20:43:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:43:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:43:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2021-06-10 20:43:06,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7963917525773195 [2021-06-10 20:43:06,381 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2021-06-10 20:43:06,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2021-06-10 20:43:06,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2021-06-10 20:43:06,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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-10 20:43:06,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,385 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,385 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 154 flow. Second operand 4 states and 618 transitions. [2021-06-10 20:43:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 230 flow [2021-06-10 20:43:06,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 20:43:06,388 INFO L241 Difference]: Finished difference. Result has 44 places, 39 transitions, 229 flow [2021-06-10 20:43:06,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2021-06-10 20:43:06,388 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2021-06-10 20:43:06,388 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 229 flow [2021-06-10 20:43:06,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-10 20:43:06,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,389 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 20:43:06,389 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash -825790391, now seen corresponding path program 1 times [2021-06-10 20:43:06,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448507098] [2021-06-10 20:43:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:06,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:06,429 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:43:06,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:06,440 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-10 20:43:06,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448507098] [2021-06-10 20:43:06,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:06,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:43:06,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026128414] [2021-06-10 20:43:06,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:43:06,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:43:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:43:06,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2021-06-10 20:43:06,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-10 20:43:06,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:06,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2021-06-10 20:43:06,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,483 INFO L129 PetriNetUnfolder]: 39/149 cut-off events. [2021-06-10 20:43:06,483 INFO L130 PetriNetUnfolder]: For 239/387 co-relation queries the response was YES. [2021-06-10 20:43:06,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 149 events. 39/149 cut-off events. For 239/387 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 684 event pairs, 4 based on Foata normal form. 11/155 useless extension candidates. Maximal degree in co-relation 488. Up to 70 conditions per place. [2021-06-10 20:43:06,485 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 18 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-06-10 20:43:06,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 337 flow [2021-06-10 20:43:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:43:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:43:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2021-06-10 20:43:06,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7925257731958762 [2021-06-10 20:43:06,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2021-06-10 20:43:06,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2021-06-10 20:43:06,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2021-06-10 20:43:06,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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-10 20:43:06,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-10 20:43:06,492 INFO L185 Difference]: Start difference. First operand has 44 places, 39 transitions, 229 flow. Second operand 4 states and 615 transitions. [2021-06-10 20:43:06,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 337 flow [2021-06-10 20:43:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 335 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-06-10 20:43:06,495 INFO L241 Difference]: Finished difference. Result has 50 places, 43 transitions, 318 flow [2021-06-10 20:43:06,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2021-06-10 20:43:06,495 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2021-06-10 20:43:06,495 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 318 flow [2021-06-10 20:43:06,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-10 20:43:06,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,496 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 20:43:06,496 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 170299725, now seen corresponding path program 1 times [2021-06-10 20:43:06,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484951010] [2021-06-10 20:43:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:06,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:06,548 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:43:06,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:06,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:06,557 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-10 20:43:06,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484951010] [2021-06-10 20:43:06,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:06,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:43:06,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096170118] [2021-06-10 20:43:06,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:43:06,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:43:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:43:06,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 194 [2021-06-10 20:43:06,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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-10 20:43:06,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:06,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 194 [2021-06-10 20:43:06,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,653 INFO L129 PetriNetUnfolder]: 213/522 cut-off events. [2021-06-10 20:43:06,653 INFO L130 PetriNetUnfolder]: For 396/426 co-relation queries the response was YES. [2021-06-10 20:43:06,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 522 events. 213/522 cut-off events. For 396/426 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3654 event pairs, 62 based on Foata normal form. 43/471 useless extension candidates. Maximal degree in co-relation 1262. Up to 226 conditions per place. [2021-06-10 20:43:06,658 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 8 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2021-06-10 20:43:06,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 376 flow [2021-06-10 20:43:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:43:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:43:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2021-06-10 20:43:06,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8092783505154639 [2021-06-10 20:43:06,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2021-06-10 20:43:06,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2021-06-10 20:43:06,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2021-06-10 20:43:06,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 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-10 20:43:06,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-10 20:43:06,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-10 20:43:06,666 INFO L185 Difference]: Start difference. First operand has 50 places, 43 transitions, 318 flow. Second operand 5 states and 785 transitions. [2021-06-10 20:43:06,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 376 flow [2021-06-10 20:43:06,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 370 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 20:43:06,671 INFO L241 Difference]: Finished difference. Result has 56 places, 51 transitions, 381 flow [2021-06-10 20:43:06,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2021-06-10 20:43:06,671 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2021-06-10 20:43:06,671 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 381 flow [2021-06-10 20:43:06,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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-10 20:43:06,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,672 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 20:43:06,672 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1253302508, now seen corresponding path program 1 times [2021-06-10 20:43:06,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467792322] [2021-06-10 20:43:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:06,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:06,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:06,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:06,766 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:43:06,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:06,780 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-10 20:43:06,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467792322] [2021-06-10 20:43:06,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:06,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:43:06,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896222281] [2021-06-10 20:43:06,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:43:06,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:43:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:43:06,782 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194 [2021-06-10 20:43:06,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 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-10 20:43:06,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:06,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194 [2021-06-10 20:43:06,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:06,958 INFO L129 PetriNetUnfolder]: 239/628 cut-off events. [2021-06-10 20:43:06,958 INFO L130 PetriNetUnfolder]: For 995/1286 co-relation queries the response was YES. [2021-06-10 20:43:06,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 628 events. 239/628 cut-off events. For 995/1286 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4653 event pairs, 69 based on Foata normal form. 34/589 useless extension candidates. Maximal degree in co-relation 1999. Up to 345 conditions per place. [2021-06-10 20:43:06,965 INFO L132 encePairwiseOnDemand]: 185/194 looper letters, 14 selfloop transitions, 27 changer transitions 0/65 dead transitions. [2021-06-10 20:43:06,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 588 flow [2021-06-10 20:43:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:43:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:43:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2021-06-10 20:43:06,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7618556701030927 [2021-06-10 20:43:06,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 739 transitions. [2021-06-10 20:43:06,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 739 transitions. [2021-06-10 20:43:06,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:06,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 739 transitions. [2021-06-10 20:43:06,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 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-10 20:43:06,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-10 20:43:06,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-10 20:43:06,972 INFO L185 Difference]: Start difference. First operand has 56 places, 51 transitions, 381 flow. Second operand 5 states and 739 transitions. [2021-06-10 20:43:06,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 588 flow [2021-06-10 20:43:06,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 20:43:06,979 INFO L241 Difference]: Finished difference. Result has 63 places, 63 transitions, 605 flow [2021-06-10 20:43:06,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=605, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2021-06-10 20:43:06,980 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2021-06-10 20:43:06,980 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 605 flow [2021-06-10 20:43:06,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 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-10 20:43:06,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:06,981 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:06,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 20:43:06,981 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 582172204, now seen corresponding path program 2 times [2021-06-10 20:43:06,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:06,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828069569] [2021-06-10 20:43:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:07,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:07,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:07,061 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:43:07,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:07,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:07,071 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-10 20:43:07,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828069569] [2021-06-10 20:43:07,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:07,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:43:07,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22434] [2021-06-10 20:43:07,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:43:07,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:07,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:43:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:43:07,074 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 194 [2021-06-10 20:43:07,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 605 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-10 20:43:07,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:07,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 194 [2021-06-10 20:43:07,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:07,195 INFO L129 PetriNetUnfolder]: 208/553 cut-off events. [2021-06-10 20:43:07,195 INFO L130 PetriNetUnfolder]: For 1371/2232 co-relation queries the response was YES. [2021-06-10 20:43:07,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 553 events. 208/553 cut-off events. For 1371/2232 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3874 event pairs, 12 based on Foata normal form. 213/709 useless extension candidates. Maximal degree in co-relation 2165. Up to 290 conditions per place. [2021-06-10 20:43:07,202 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 5 selfloop transitions, 18 changer transitions 3/74 dead transitions. [2021-06-10 20:43:07,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 720 flow [2021-06-10 20:43:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:43:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:43:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions. [2021-06-10 20:43:07,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8092783505154639 [2021-06-10 20:43:07,205 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1099 transitions. [2021-06-10 20:43:07,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1099 transitions. [2021-06-10 20:43:07,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:07,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1099 transitions. [2021-06-10 20:43:07,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.0) internal successors, (1099), 7 states have internal predecessors, (1099), 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-10 20:43:07,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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-10 20:43:07,211 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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-10 20:43:07,211 INFO L185 Difference]: Start difference. First operand has 63 places, 63 transitions, 605 flow. Second operand 7 states and 1099 transitions. [2021-06-10 20:43:07,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 720 flow [2021-06-10 20:43:07,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-06-10 20:43:07,220 INFO L241 Difference]: Finished difference. Result has 72 places, 71 transitions, 712 flow [2021-06-10 20:43:07,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=712, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2021-06-10 20:43:07,221 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2021-06-10 20:43:07,221 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 712 flow [2021-06-10 20:43:07,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-10 20:43:07,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:07,221 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:43:07,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 20:43:07,221 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash -396189063, now seen corresponding path program 1 times [2021-06-10 20:43:07,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:07,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132293250] [2021-06-10 20:43:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:07,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:07,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:07,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:07,365 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:43:07,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:07,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:43:07,374 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-10 20:43:07,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132293250] [2021-06-10 20:43:07,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:07,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:43:07,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956329667] [2021-06-10 20:43:07,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:43:07,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:43:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:43:07,376 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 194 [2021-06-10 20:43:07,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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-10 20:43:07,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:07,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 194 [2021-06-10 20:43:07,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:07,511 INFO L129 PetriNetUnfolder]: 173/483 cut-off events. [2021-06-10 20:43:07,511 INFO L130 PetriNetUnfolder]: For 2697/4118 co-relation queries the response was YES. [2021-06-10 20:43:07,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 483 events. 173/483 cut-off events. For 2697/4118 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3508 event pairs, 4 based on Foata normal form. 209/636 useless extension candidates. Maximal degree in co-relation 2451. Up to 251 conditions per place. [2021-06-10 20:43:07,519 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 2 selfloop transitions, 22 changer transitions 4/76 dead transitions. [2021-06-10 20:43:07,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 806 flow [2021-06-10 20:43:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 20:43:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 20:43:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1407 transitions. [2021-06-10 20:43:07,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8058419243986255 [2021-06-10 20:43:07,523 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1407 transitions. [2021-06-10 20:43:07,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1407 transitions. [2021-06-10 20:43:07,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:07,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1407 transitions. [2021-06-10 20:43:07,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 156.33333333333334) internal successors, (1407), 9 states have internal predecessors, (1407), 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-10 20:43:07,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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-10 20:43:07,532 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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-10 20:43:07,532 INFO L185 Difference]: Start difference. First operand has 72 places, 71 transitions, 712 flow. Second operand 9 states and 1407 transitions. [2021-06-10 20:43:07,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 806 flow [2021-06-10 20:43:07,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 76 transitions, 747 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-06-10 20:43:07,544 INFO L241 Difference]: Finished difference. Result has 78 places, 72 transitions, 723 flow [2021-06-10 20:43:07,545 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=723, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2021-06-10 20:43:07,545 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2021-06-10 20:43:07,545 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 723 flow [2021-06-10 20:43:07,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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-10 20:43:07,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:07,546 INFO L263 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] [2021-06-10 20:43:07,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 20:43:07,546 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -938642479, now seen corresponding path program 1 times [2021-06-10 20:43:07,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:07,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603956148] [2021-06-10 20:43:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:07,697 INFO L142 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size [2021-06-10 20:43:07,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 20:43:07,704 INFO L142 QuantifierPusher]: treesize reduction 20, result has 55.6 percent of original size [2021-06-10 20:43:07,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-10 20:43:07,722 INFO L142 QuantifierPusher]: treesize reduction 9, result has 71.0 percent of original size [2021-06-10 20:43:07,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-10 20:43:07,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 20:43:07,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:07,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:43:07,758 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-10 20:43:07,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603956148] [2021-06-10 20:43:07,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:07,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:43:07,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411075015] [2021-06-10 20:43:07,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 20:43:07,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 20:43:07,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-10 20:43:07,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 194 [2021-06-10 20:43:07,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 723 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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-10 20:43:07,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:07,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 194 [2021-06-10 20:43:07,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:08,229 INFO L129 PetriNetUnfolder]: 667/1656 cut-off events. [2021-06-10 20:43:08,229 INFO L130 PetriNetUnfolder]: For 11850/12855 co-relation queries the response was YES. [2021-06-10 20:43:08,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 1656 events. 667/1656 cut-off events. For 11850/12855 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 14624 event pairs, 31 based on Foata normal form. 230/1695 useless extension candidates. Maximal degree in co-relation 7379. Up to 464 conditions per place. [2021-06-10 20:43:08,253 INFO L132 encePairwiseOnDemand]: 182/194 looper letters, 49 selfloop transitions, 78 changer transitions 3/160 dead transitions. [2021-06-10 20:43:08,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 160 transitions, 1834 flow [2021-06-10 20:43:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-10 20:43:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-10 20:43:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1396 transitions. [2021-06-10 20:43:08,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6541705716963448 [2021-06-10 20:43:08,257 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1396 transitions. [2021-06-10 20:43:08,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1396 transitions. [2021-06-10 20:43:08,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:08,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1396 transitions. [2021-06-10 20:43:08,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 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-10 20:43:08,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 194.0) internal successors, (2328), 12 states have internal predecessors, (2328), 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-10 20:43:08,264 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 194.0) internal successors, (2328), 12 states have internal predecessors, (2328), 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-10 20:43:08,264 INFO L185 Difference]: Start difference. First operand has 78 places, 72 transitions, 723 flow. Second operand 11 states and 1396 transitions. [2021-06-10 20:43:08,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 160 transitions, 1834 flow [2021-06-10 20:43:08,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 160 transitions, 1756 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-06-10 20:43:08,406 INFO L241 Difference]: Finished difference. Result has 84 places, 128 transitions, 1565 flow [2021-06-10 20:43:08,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1565, PETRI_PLACES=84, PETRI_TRANSITIONS=128} [2021-06-10 20:43:08,406 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2021-06-10 20:43:08,406 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 128 transitions, 1565 flow [2021-06-10 20:43:08,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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-10 20:43:08,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:08,407 INFO L263 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] [2021-06-10 20:43:08,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 20:43:08,407 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2021524143, now seen corresponding path program 2 times [2021-06-10 20:43:08,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:08,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863915875] [2021-06-10 20:43:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:43:08,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:08,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 20:43:08,488 INFO L142 QuantifierPusher]: treesize reduction 10, result has 77.3 percent of original size [2021-06-10 20:43:08,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:43:08,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:08,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:43:08,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:08,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:43:08,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:43:08,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:43:08,549 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-10 20:43:08,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863915875] [2021-06-10 20:43:08,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:43:08,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:43:08,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76703810] [2021-06-10 20:43:08,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 20:43:08,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:43:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 20:43:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-10 20:43:08,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 194 [2021-06-10 20:43:08,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 128 transitions, 1565 flow. Second operand has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 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-10 20:43:08,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:43:08,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 194 [2021-06-10 20:43:08,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:43:08,874 INFO L129 PetriNetUnfolder]: 640/1671 cut-off events. [2021-06-10 20:43:08,875 INFO L130 PetriNetUnfolder]: For 7709/8076 co-relation queries the response was YES. [2021-06-10 20:43:08,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6873 conditions, 1671 events. 640/1671 cut-off events. For 7709/8076 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 15128 event pairs, 16 based on Foata normal form. 139/1602 useless extension candidates. Maximal degree in co-relation 6834. Up to 536 conditions per place. [2021-06-10 20:43:08,894 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 23 selfloop transitions, 14 changer transitions 23/142 dead transitions. [2021-06-10 20:43:08,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 142 transitions, 1768 flow [2021-06-10 20:43:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:43:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:43:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2021-06-10 20:43:08,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.698821796759941 [2021-06-10 20:43:08,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2021-06-10 20:43:08,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2021-06-10 20:43:08,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:43:08,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2021-06-10 20:43:08,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 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-10 20:43:08,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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-10 20:43:08,902 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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-10 20:43:08,902 INFO L185 Difference]: Start difference. First operand has 84 places, 128 transitions, 1565 flow. Second operand 7 states and 949 transitions. [2021-06-10 20:43:08,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 142 transitions, 1768 flow [2021-06-10 20:43:08,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 142 transitions, 1764 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-06-10 20:43:08,975 INFO L241 Difference]: Finished difference. Result has 92 places, 111 transitions, 1345 flow [2021-06-10 20:43:08,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1345, PETRI_PLACES=92, PETRI_TRANSITIONS=111} [2021-06-10 20:43:08,975 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2021-06-10 20:43:08,975 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 111 transitions, 1345 flow [2021-06-10 20:43:08,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 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-10 20:43:08,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:43:08,976 INFO L263 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] [2021-06-10 20:43:08,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 20:43:08,976 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:43:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:43:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash -930611359, now seen corresponding path program 3 times [2021-06-10 20:43:08,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:43:08,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080338494] [2021-06-10 20:43:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:43:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:43:09,020 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:43:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:43:09,064 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:43:09,089 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 20:43:09,090 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 20:43:09,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 20:43:09,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 08:43:09 BasicIcfg [2021-06-10 20:43:09,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 20:43:09,160 INFO L168 Benchmark]: Toolchain (without parser) took 12383.47 ms. Allocated memory was 341.8 MB in the beginning and 606.1 MB in the end (delta: 264.2 MB). Free memory was 304.0 MB in the beginning and 326.8 MB in the end (delta: -22.9 MB). Peak memory consumption was 242.9 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,160 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 341.8 MB. Free memory was 322.4 MB in the beginning and 322.3 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 20:43:09,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.30 ms. Allocated memory is still 341.8 MB. Free memory was 303.7 MB in the beginning and 300.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.40 ms. Allocated memory is still 341.8 MB. Free memory was 300.6 MB in the beginning and 298.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,161 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 ms. Allocated memory is still 341.8 MB. Free memory was 298.4 MB in the beginning and 296.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,161 INFO L168 Benchmark]: RCFGBuilder took 1776.72 ms. Allocated memory is still 341.8 MB. Free memory was 296.4 MB in the beginning and 224.1 MB in the end (delta: 72.3 MB). Peak memory consumption was 141.5 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,162 INFO L168 Benchmark]: TraceAbstraction took 9969.98 ms. Allocated memory was 341.8 MB in the beginning and 606.1 MB in the end (delta: 264.2 MB). Free memory was 224.1 MB in the beginning and 326.8 MB in the end (delta: -102.7 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2021-06-10 20:43:09,163 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 341.8 MB. Free memory was 322.4 MB in the beginning and 322.3 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 536.30 ms. Allocated memory is still 341.8 MB. Free memory was 303.7 MB in the beginning and 300.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.40 ms. Allocated memory is still 341.8 MB. Free memory was 300.6 MB in the beginning and 298.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.22 ms. Allocated memory is still 341.8 MB. Free memory was 298.4 MB in the beginning and 296.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1776.72 ms. Allocated memory is still 341.8 MB. Free memory was 296.4 MB in the beginning and 224.1 MB in the end (delta: 72.3 MB). Peak memory consumption was 141.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9969.98 ms. Allocated memory was 341.8 MB in the beginning and 606.1 MB in the end (delta: 264.2 MB). Free memory was 224.1 MB in the beginning and 326.8 MB in the end (delta: -102.7 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6196.9ms, 107 PlacesBefore, 39 PlacesAfterwards, 99 TransitionsBefore, 30 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6374 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2851, positive: 2649, positive conditional: 0, positive unconditional: 2649, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1461, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1461, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1461, positive: 1381, positive conditional: 0, positive unconditional: 1381, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 906, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 861, negative conditional: 0, negative unconditional: 861, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2851, positive: 1251, positive conditional: 0, positive unconditional: 1251, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 1461, unknown conditional: 0, unknown unconditional: 1461] , Statistics on independence cache: Total cache size (in pairs): 2616, Positive cache size: 2553, Positive conditional cache size: 0, Positive unconditional cache size: 2553, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t159; [L844] FCALL, FORK 0 pthread_create(&t159, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t160; [L846] FCALL, FORK 0 pthread_create(&t160, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t161; [L848] FCALL, FORK 0 pthread_create(&t161, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L810] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L811] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __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=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L785] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9790.1ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2142.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6263.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 88 SDtfs, 65 SDslu, 73 SDs, 0 SdLazy, 330 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 438.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 350.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1565occurred in iteration=10, InterpolantAutomatonStates: 62, 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: 34.3ms SsaConstructionTime, 421.2ms SatisfiabilityAnalysisTime, 681.1ms InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...