./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef0628b20db46bc14cfcc47365ed24e38ce755d5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:43:43,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:43:43,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:43:43,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:43:43,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:43:43,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:43:43,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:43:43,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:43:43,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:43:43,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:43:43,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:43:43,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:43:43,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:43:43,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:43:43,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:43:43,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:43:43,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:43:43,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:43:43,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:43:43,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:43:43,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:43:43,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:43:43,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:43:43,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:43:43,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:43:43,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:43:43,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:43:43,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:43:43,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:43:43,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:43:43,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:43:43,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:43:43,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:43:43,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:43:43,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:43:43,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:43:43,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:43:43,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:43:43,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:43:43,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:43:43,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:43:43,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:43:43,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:43:43,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:43:43,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:43:43,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:43:43,706 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:43:43,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:43:43,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:43:43,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:43:43,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:43:43,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:43:43,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:43:43,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:43:43,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:43:43,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:43:43,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:43:43,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:43:43,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:43:43,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:43:43,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:43:43,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:43:43,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:43:43,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:43:43,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:43:43,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:43:43,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:43:43,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:43:43,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:43:43,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:43:43,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef0628b20db46bc14cfcc47365ed24e38ce755d5 [2019-11-15 23:43:43,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:43:43,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:43:43,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:43:43,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:43:43,774 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:43:43,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-11-15 23:43:43,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/data/a87f39d50/3ec2ed7a07f642f2a028e0bf5f5c75bf/FLAG297288cf5 [2019-11-15 23:43:44,340 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:43:44,341 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-11-15 23:43:44,367 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/data/a87f39d50/3ec2ed7a07f642f2a028e0bf5f5c75bf/FLAG297288cf5 [2019-11-15 23:43:44,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/data/a87f39d50/3ec2ed7a07f642f2a028e0bf5f5c75bf [2019-11-15 23:43:44,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:43:44,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:43:44,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:44,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:43:44,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:43:44,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:44" (1/1) ... [2019-11-15 23:43:44,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32febd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:44, skipping insertion in model container [2019-11-15 23:43:44,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:44" (1/1) ... [2019-11-15 23:43:44,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:43:44,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:43:45,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:45,227 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:43:45,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:45,373 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:43:45,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45 WrapperNode [2019-11-15 23:43:45,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:45,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:45,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:43:45,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:43:45,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:45,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:43:45,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:43:45,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:43:45,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... [2019-11-15 23:43:45,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:43:45,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:43:45,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:43:45,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:43:45,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/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 [2019-11-15 23:43:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:43:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:43:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:43:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:43:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:43:45,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:43:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:43:45,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:43:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:43:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:43:45,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:43:45,553 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:43:46,337 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:43:46,338 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:43:46,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:46 BoogieIcfgContainer [2019-11-15 23:43:46,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:43:46,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:43:46,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:43:46,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:43:46,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:43:44" (1/3) ... [2019-11-15 23:43:46,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5d0284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:43:46, skipping insertion in model container [2019-11-15 23:43:46,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:45" (2/3) ... [2019-11-15 23:43:46,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5d0284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:43:46, skipping insertion in model container [2019-11-15 23:43:46,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:46" (3/3) ... [2019-11-15 23:43:46,346 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-11-15 23:43:46,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,390 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,425 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,426 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,444 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,445 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,445 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,445 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,445 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,447 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,447 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:43:46,460 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:43:46,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:43:46,470 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:43:46,481 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:43:46,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:43:46,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:43:46,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:43:46,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:43:46,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:43:46,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:43:46,502 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:43:46,502 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:43:46,517 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-11-15 23:43:48,631 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25975 states. [2019-11-15 23:43:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 25975 states. [2019-11-15 23:43:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:43:48,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:48,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:48,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1135396639, now seen corresponding path program 1 times [2019-11-15 23:43:48,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:48,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304693677] [2019-11-15 23:43:48,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:48,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:48,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:48,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304693677] [2019-11-15 23:43:48,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:48,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:43:48,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322891241] [2019-11-15 23:43:48,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:43:48,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:43:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:43:48,972 INFO L87 Difference]: Start difference. First operand 25975 states. Second operand 4 states. [2019-11-15 23:43:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:49,605 INFO L93 Difference]: Finished difference Result 26615 states and 102120 transitions. [2019-11-15 23:43:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:43:49,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 23:43:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:49,850 INFO L225 Difference]: With dead ends: 26615 [2019-11-15 23:43:49,850 INFO L226 Difference]: Without dead ends: 20359 [2019-11-15 23:43:49,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:43:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20359 states. [2019-11-15 23:43:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20359 to 20359. [2019-11-15 23:43:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20359 states. [2019-11-15 23:43:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20359 states to 20359 states and 78424 transitions. [2019-11-15 23:43:51,129 INFO L78 Accepts]: Start accepts. Automaton has 20359 states and 78424 transitions. Word has length 38 [2019-11-15 23:43:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:51,130 INFO L462 AbstractCegarLoop]: Abstraction has 20359 states and 78424 transitions. [2019-11-15 23:43:51,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:43:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20359 states and 78424 transitions. [2019-11-15 23:43:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:43:51,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:51,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:51,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1334378173, now seen corresponding path program 1 times [2019-11-15 23:43:51,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:51,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797896846] [2019-11-15 23:43:51,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:51,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:51,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:51,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797896846] [2019-11-15 23:43:51,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:51,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:43:51,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391134365] [2019-11-15 23:43:51,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:43:51,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:43:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:43:51,341 INFO L87 Difference]: Start difference. First operand 20359 states and 78424 transitions. Second operand 5 states. [2019-11-15 23:43:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:52,226 INFO L93 Difference]: Finished difference Result 31837 states and 116041 transitions. [2019-11-15 23:43:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:43:52,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:43:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:52,383 INFO L225 Difference]: With dead ends: 31837 [2019-11-15 23:43:52,384 INFO L226 Difference]: Without dead ends: 31285 [2019-11-15 23:43:52,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:43:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2019-11-15 23:43:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 29704. [2019-11-15 23:43:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29704 states. [2019-11-15 23:43:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29704 states to 29704 states and 109518 transitions. [2019-11-15 23:43:53,578 INFO L78 Accepts]: Start accepts. Automaton has 29704 states and 109518 transitions. Word has length 46 [2019-11-15 23:43:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:53,580 INFO L462 AbstractCegarLoop]: Abstraction has 29704 states and 109518 transitions. [2019-11-15 23:43:53,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:43:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29704 states and 109518 transitions. [2019-11-15 23:43:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:43:53,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:53,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:53,588 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:53,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1293014968, now seen corresponding path program 1 times [2019-11-15 23:43:53,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:53,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542831417] [2019-11-15 23:43:53,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:53,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:53,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:53,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542831417] [2019-11-15 23:43:53,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:53,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:43:53,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942335612] [2019-11-15 23:43:53,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:43:53,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:43:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:43:53,687 INFO L87 Difference]: Start difference. First operand 29704 states and 109518 transitions. Second operand 5 states. [2019-11-15 23:43:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:54,638 INFO L93 Difference]: Finished difference Result 38695 states and 139690 transitions. [2019-11-15 23:43:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:43:54,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:43:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:54,792 INFO L225 Difference]: With dead ends: 38695 [2019-11-15 23:43:54,793 INFO L226 Difference]: Without dead ends: 38247 [2019-11-15 23:43:54,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:43:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38247 states. [2019-11-15 23:43:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38247 to 32950. [2019-11-15 23:43:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2019-11-15 23:43:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 120527 transitions. [2019-11-15 23:43:55,768 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 120527 transitions. Word has length 47 [2019-11-15 23:43:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:55,768 INFO L462 AbstractCegarLoop]: Abstraction has 32950 states and 120527 transitions. [2019-11-15 23:43:55,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:43:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 120527 transitions. [2019-11-15 23:43:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:43:55,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:55,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:55,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -458309778, now seen corresponding path program 1 times [2019-11-15 23:43:55,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:55,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168530258] [2019-11-15 23:43:55,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:55,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:55,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:55,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168530258] [2019-11-15 23:43:55,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:55,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:43:55,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45406815] [2019-11-15 23:43:55,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:43:55,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:55,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:43:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:43:55,848 INFO L87 Difference]: Start difference. First operand 32950 states and 120527 transitions. Second operand 3 states. [2019-11-15 23:43:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:56,136 INFO L93 Difference]: Finished difference Result 42411 states and 152018 transitions. [2019-11-15 23:43:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:43:56,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:43:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:56,307 INFO L225 Difference]: With dead ends: 42411 [2019-11-15 23:43:56,307 INFO L226 Difference]: Without dead ends: 42411 [2019-11-15 23:43:56,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:43:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42411 states. [2019-11-15 23:43:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42411 to 37664. [2019-11-15 23:43:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37664 states. [2019-11-15 23:43:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37664 states to 37664 states and 136331 transitions. [2019-11-15 23:43:57,551 INFO L78 Accepts]: Start accepts. Automaton has 37664 states and 136331 transitions. Word has length 49 [2019-11-15 23:43:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:57,552 INFO L462 AbstractCegarLoop]: Abstraction has 37664 states and 136331 transitions. [2019-11-15 23:43:57,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:43:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37664 states and 136331 transitions. [2019-11-15 23:43:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:43:57,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:57,569 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:57,569 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1978906735, now seen corresponding path program 1 times [2019-11-15 23:43:57,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:57,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675093045] [2019-11-15 23:43:57,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:57,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:57,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:57,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675093045] [2019-11-15 23:43:57,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:57,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:43:57,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759319797] [2019-11-15 23:43:57,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:43:57,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:57,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:43:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:43:57,652 INFO L87 Difference]: Start difference. First operand 37664 states and 136331 transitions. Second operand 6 states. [2019-11-15 23:43:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:58,487 INFO L93 Difference]: Finished difference Result 48755 states and 172980 transitions. [2019-11-15 23:43:58,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:43:58,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:43:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:58,601 INFO L225 Difference]: With dead ends: 48755 [2019-11-15 23:43:58,601 INFO L226 Difference]: Without dead ends: 48235 [2019-11-15 23:43:58,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:43:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-11-15 23:43:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 38228. [2019-11-15 23:43:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38228 states. [2019-11-15 23:43:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38228 states to 38228 states and 138494 transitions. [2019-11-15 23:43:59,874 INFO L78 Accepts]: Start accepts. Automaton has 38228 states and 138494 transitions. Word has length 53 [2019-11-15 23:43:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:59,874 INFO L462 AbstractCegarLoop]: Abstraction has 38228 states and 138494 transitions. [2019-11-15 23:43:59,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:43:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38228 states and 138494 transitions. [2019-11-15 23:43:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:43:59,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:59,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:59,889 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1933781412, now seen corresponding path program 1 times [2019-11-15 23:43:59,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:59,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336784220] [2019-11-15 23:43:59,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:59,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:59,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:00,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336784220] [2019-11-15 23:44:00,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:00,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:00,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532213603] [2019-11-15 23:44:00,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:00,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:00,034 INFO L87 Difference]: Start difference. First operand 38228 states and 138494 transitions. Second operand 6 states. [2019-11-15 23:44:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:00,889 INFO L93 Difference]: Finished difference Result 53004 states and 189570 transitions. [2019-11-15 23:44:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:00,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:44:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:01,015 INFO L225 Difference]: With dead ends: 53004 [2019-11-15 23:44:01,015 INFO L226 Difference]: Without dead ends: 52028 [2019-11-15 23:44:01,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52028 states. [2019-11-15 23:44:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52028 to 48781. [2019-11-15 23:44:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48781 states. [2019-11-15 23:44:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48781 states to 48781 states and 175225 transitions. [2019-11-15 23:44:01,945 INFO L78 Accepts]: Start accepts. Automaton has 48781 states and 175225 transitions. Word has length 53 [2019-11-15 23:44:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:01,946 INFO L462 AbstractCegarLoop]: Abstraction has 48781 states and 175225 transitions. [2019-11-15 23:44:01,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 48781 states and 175225 transitions. [2019-11-15 23:44:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:01,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:01,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:01,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 136830053, now seen corresponding path program 1 times [2019-11-15 23:44:01,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:01,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055925653] [2019-11-15 23:44:01,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:01,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:01,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:02,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055925653] [2019-11-15 23:44:02,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:02,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:02,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326066619] [2019-11-15 23:44:02,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:02,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:02,683 INFO L87 Difference]: Start difference. First operand 48781 states and 175225 transitions. Second operand 7 states. [2019-11-15 23:44:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:03,685 INFO L93 Difference]: Finished difference Result 70896 states and 244522 transitions. [2019-11-15 23:44:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:03,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 23:44:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:03,833 INFO L225 Difference]: With dead ends: 70896 [2019-11-15 23:44:03,833 INFO L226 Difference]: Without dead ends: 70896 [2019-11-15 23:44:03,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70896 states. [2019-11-15 23:44:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70896 to 57889. [2019-11-15 23:44:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57889 states. [2019-11-15 23:44:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57889 states to 57889 states and 203149 transitions. [2019-11-15 23:44:04,913 INFO L78 Accepts]: Start accepts. Automaton has 57889 states and 203149 transitions. Word has length 53 [2019-11-15 23:44:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:04,914 INFO L462 AbstractCegarLoop]: Abstraction has 57889 states and 203149 transitions. [2019-11-15 23:44:04,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 57889 states and 203149 transitions. [2019-11-15 23:44:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:04,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:04,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:04,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1024333734, now seen corresponding path program 1 times [2019-11-15 23:44:04,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:04,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506887387] [2019-11-15 23:44:04,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:04,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:04,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:04,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506887387] [2019-11-15 23:44:04,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:04,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:04,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802086230] [2019-11-15 23:44:04,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:04,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:04,977 INFO L87 Difference]: Start difference. First operand 57889 states and 203149 transitions. Second operand 3 states. [2019-11-15 23:44:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:05,194 INFO L93 Difference]: Finished difference Result 43855 states and 152832 transitions. [2019-11-15 23:44:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:05,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 23:44:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:05,306 INFO L225 Difference]: With dead ends: 43855 [2019-11-15 23:44:05,306 INFO L226 Difference]: Without dead ends: 43351 [2019-11-15 23:44:05,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43351 states. [2019-11-15 23:44:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43351 to 41885. [2019-11-15 23:44:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41885 states. [2019-11-15 23:44:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41885 states to 41885 states and 146703 transitions. [2019-11-15 23:44:06,436 INFO L78 Accepts]: Start accepts. Automaton has 41885 states and 146703 transitions. Word has length 53 [2019-11-15 23:44:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:06,437 INFO L462 AbstractCegarLoop]: Abstraction has 41885 states and 146703 transitions. [2019-11-15 23:44:06,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 41885 states and 146703 transitions. [2019-11-15 23:44:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:44:06,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:06,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:06,448 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:06,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 765117548, now seen corresponding path program 1 times [2019-11-15 23:44:06,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:06,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951666422] [2019-11-15 23:44:06,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:06,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:06,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:06,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951666422] [2019-11-15 23:44:06,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:06,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:06,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707633150] [2019-11-15 23:44:06,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:06,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:06,542 INFO L87 Difference]: Start difference. First operand 41885 states and 146703 transitions. Second operand 6 states. [2019-11-15 23:44:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:07,185 INFO L93 Difference]: Finished difference Result 54548 states and 184833 transitions. [2019-11-15 23:44:07,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:07,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:44:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:07,298 INFO L225 Difference]: With dead ends: 54548 [2019-11-15 23:44:07,298 INFO L226 Difference]: Without dead ends: 54548 [2019-11-15 23:44:07,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54548 states. [2019-11-15 23:44:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54548 to 45860. [2019-11-15 23:44:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2019-11-15 23:44:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 158166 transitions. [2019-11-15 23:44:08,140 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 158166 transitions. Word has length 54 [2019-11-15 23:44:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:08,140 INFO L462 AbstractCegarLoop]: Abstraction has 45860 states and 158166 transitions. [2019-11-15 23:44:08,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 158166 transitions. [2019-11-15 23:44:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:44:08,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:08,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:08,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1652621229, now seen corresponding path program 1 times [2019-11-15 23:44:08,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:08,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233798950] [2019-11-15 23:44:08,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:08,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233798950] [2019-11-15 23:44:08,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:08,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:08,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789008498] [2019-11-15 23:44:08,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:08,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:08,224 INFO L87 Difference]: Start difference. First operand 45860 states and 158166 transitions. Second operand 4 states. [2019-11-15 23:44:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:08,285 INFO L93 Difference]: Finished difference Result 8162 states and 24870 transitions. [2019-11-15 23:44:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:08,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 23:44:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:08,299 INFO L225 Difference]: With dead ends: 8162 [2019-11-15 23:44:08,300 INFO L226 Difference]: Without dead ends: 6753 [2019-11-15 23:44:08,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-11-15 23:44:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6705. [2019-11-15 23:44:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6705 states. [2019-11-15 23:44:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 20039 transitions. [2019-11-15 23:44:08,421 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 20039 transitions. Word has length 54 [2019-11-15 23:44:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:08,422 INFO L462 AbstractCegarLoop]: Abstraction has 6705 states and 20039 transitions. [2019-11-15 23:44:08,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 20039 transitions. [2019-11-15 23:44:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:44:08,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:08,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:08,428 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash 779185304, now seen corresponding path program 1 times [2019-11-15 23:44:08,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:08,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873369951] [2019-11-15 23:44:08,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:08,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873369951] [2019-11-15 23:44:08,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:08,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:08,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046026803] [2019-11-15 23:44:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:08,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:08,530 INFO L87 Difference]: Start difference. First operand 6705 states and 20039 transitions. Second operand 4 states. [2019-11-15 23:44:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:08,703 INFO L93 Difference]: Finished difference Result 7890 states and 23388 transitions. [2019-11-15 23:44:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:08,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 23:44:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:08,718 INFO L225 Difference]: With dead ends: 7890 [2019-11-15 23:44:08,718 INFO L226 Difference]: Without dead ends: 7890 [2019-11-15 23:44:08,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2019-11-15 23:44:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7212. [2019-11-15 23:44:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7212 states. [2019-11-15 23:44:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 21445 transitions. [2019-11-15 23:44:08,855 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 21445 transitions. Word has length 63 [2019-11-15 23:44:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:08,856 INFO L462 AbstractCegarLoop]: Abstraction has 7212 states and 21445 transitions. [2019-11-15 23:44:08,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 21445 transitions. [2019-11-15 23:44:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:44:08,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:08,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:08,870 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1772971657, now seen corresponding path program 1 times [2019-11-15 23:44:08,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:08,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898669203] [2019-11-15 23:44:08,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:08,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898669203] [2019-11-15 23:44:08,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:08,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:08,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772380133] [2019-11-15 23:44:08,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:08,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:08,979 INFO L87 Difference]: Start difference. First operand 7212 states and 21445 transitions. Second operand 6 states. [2019-11-15 23:44:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:09,373 INFO L93 Difference]: Finished difference Result 9267 states and 27194 transitions. [2019-11-15 23:44:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:09,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-15 23:44:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:09,385 INFO L225 Difference]: With dead ends: 9267 [2019-11-15 23:44:09,385 INFO L226 Difference]: Without dead ends: 9219 [2019-11-15 23:44:09,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:44:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2019-11-15 23:44:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 8051. [2019-11-15 23:44:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8051 states. [2019-11-15 23:44:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8051 states to 8051 states and 23825 transitions. [2019-11-15 23:44:09,499 INFO L78 Accepts]: Start accepts. Automaton has 8051 states and 23825 transitions. Word has length 63 [2019-11-15 23:44:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:09,499 INFO L462 AbstractCegarLoop]: Abstraction has 8051 states and 23825 transitions. [2019-11-15 23:44:09,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8051 states and 23825 transitions. [2019-11-15 23:44:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:09,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:09,506 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:09,506 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash 238487578, now seen corresponding path program 1 times [2019-11-15 23:44:09,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:09,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777979412] [2019-11-15 23:44:09,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:09,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777979412] [2019-11-15 23:44:09,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:09,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:09,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253680699] [2019-11-15 23:44:09,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:09,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:09,569 INFO L87 Difference]: Start difference. First operand 8051 states and 23825 transitions. Second operand 4 states. [2019-11-15 23:44:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:09,830 INFO L93 Difference]: Finished difference Result 10664 states and 31174 transitions. [2019-11-15 23:44:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:09,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 23:44:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:09,848 INFO L225 Difference]: With dead ends: 10664 [2019-11-15 23:44:09,848 INFO L226 Difference]: Without dead ends: 10664 [2019-11-15 23:44:09,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2019-11-15 23:44:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 9074. [2019-11-15 23:44:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2019-11-15 23:44:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 26644 transitions. [2019-11-15 23:44:09,989 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 26644 transitions. Word has length 67 [2019-11-15 23:44:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:09,989 INFO L462 AbstractCegarLoop]: Abstraction has 9074 states and 26644 transitions. [2019-11-15 23:44:09,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 26644 transitions. [2019-11-15 23:44:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:09,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:09,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:09,999 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:09,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1483252059, now seen corresponding path program 1 times [2019-11-15 23:44:10,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:10,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87160453] [2019-11-15 23:44:10,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:10,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87160453] [2019-11-15 23:44:10,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:10,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:10,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007974460] [2019-11-15 23:44:10,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:10,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:10,113 INFO L87 Difference]: Start difference. First operand 9074 states and 26644 transitions. Second operand 6 states. [2019-11-15 23:44:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:10,666 INFO L93 Difference]: Finished difference Result 10384 states and 29895 transitions. [2019-11-15 23:44:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:10,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:44:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:10,682 INFO L225 Difference]: With dead ends: 10384 [2019-11-15 23:44:10,682 INFO L226 Difference]: Without dead ends: 10384 [2019-11-15 23:44:10,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2019-11-15 23:44:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 10081. [2019-11-15 23:44:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10081 states. [2019-11-15 23:44:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10081 states to 10081 states and 29118 transitions. [2019-11-15 23:44:10,941 INFO L78 Accepts]: Start accepts. Automaton has 10081 states and 29118 transitions. Word has length 67 [2019-11-15 23:44:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:10,941 INFO L462 AbstractCegarLoop]: Abstraction has 10081 states and 29118 transitions. [2019-11-15 23:44:10,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10081 states and 29118 transitions. [2019-11-15 23:44:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:10,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:10,955 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:10,955 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -593957284, now seen corresponding path program 1 times [2019-11-15 23:44:10,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:10,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806410700] [2019-11-15 23:44:10,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:11,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806410700] [2019-11-15 23:44:11,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:11,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:11,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695590834] [2019-11-15 23:44:11,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:11,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:11,096 INFO L87 Difference]: Start difference. First operand 10081 states and 29118 transitions. Second operand 6 states. [2019-11-15 23:44:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:11,530 INFO L93 Difference]: Finished difference Result 11998 states and 33625 transitions. [2019-11-15 23:44:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:11,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:44:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:11,544 INFO L225 Difference]: With dead ends: 11998 [2019-11-15 23:44:11,544 INFO L226 Difference]: Without dead ends: 11998 [2019-11-15 23:44:11,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-11-15 23:44:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 10300. [2019-11-15 23:44:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-11-15 23:44:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 29170 transitions. [2019-11-15 23:44:11,677 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 29170 transitions. Word has length 67 [2019-11-15 23:44:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:11,677 INFO L462 AbstractCegarLoop]: Abstraction has 10300 states and 29170 transitions. [2019-11-15 23:44:11,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 29170 transitions. [2019-11-15 23:44:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:11,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:11,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:11,686 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -382606371, now seen corresponding path program 1 times [2019-11-15 23:44:11,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:11,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425376001] [2019-11-15 23:44:11,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:11,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:11,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:11,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425376001] [2019-11-15 23:44:11,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:11,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:11,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114732329] [2019-11-15 23:44:11,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:11,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:11,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:11,766 INFO L87 Difference]: Start difference. First operand 10300 states and 29170 transitions. Second operand 5 states. [2019-11-15 23:44:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:12,125 INFO L93 Difference]: Finished difference Result 12575 states and 35463 transitions. [2019-11-15 23:44:12,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:12,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:44:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:12,143 INFO L225 Difference]: With dead ends: 12575 [2019-11-15 23:44:12,143 INFO L226 Difference]: Without dead ends: 12575 [2019-11-15 23:44:12,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-11-15 23:44:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 11075. [2019-11-15 23:44:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2019-11-15 23:44:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 31104 transitions. [2019-11-15 23:44:12,295 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 31104 transitions. Word has length 67 [2019-11-15 23:44:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:12,295 INFO L462 AbstractCegarLoop]: Abstraction has 11075 states and 31104 transitions. [2019-11-15 23:44:12,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 31104 transitions. [2019-11-15 23:44:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:12,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:12,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:12,303 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -893140548, now seen corresponding path program 1 times [2019-11-15 23:44:12,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:12,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516948810] [2019-11-15 23:44:12,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:12,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516948810] [2019-11-15 23:44:12,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:12,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:12,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603113745] [2019-11-15 23:44:12,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:12,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:12,408 INFO L87 Difference]: Start difference. First operand 11075 states and 31104 transitions. Second operand 6 states. [2019-11-15 23:44:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:12,553 INFO L93 Difference]: Finished difference Result 11507 states and 31350 transitions. [2019-11-15 23:44:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:12,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:44:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:12,567 INFO L225 Difference]: With dead ends: 11507 [2019-11-15 23:44:12,567 INFO L226 Difference]: Without dead ends: 11507 [2019-11-15 23:44:12,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-11-15 23:44:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 9713. [2019-11-15 23:44:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9713 states. [2019-11-15 23:44:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9713 states to 9713 states and 26564 transitions. [2019-11-15 23:44:12,695 INFO L78 Accepts]: Start accepts. Automaton has 9713 states and 26564 transitions. Word has length 67 [2019-11-15 23:44:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:12,695 INFO L462 AbstractCegarLoop]: Abstraction has 9713 states and 26564 transitions. [2019-11-15 23:44:12,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 9713 states and 26564 transitions. [2019-11-15 23:44:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:12,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:12,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:12,701 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1802588226, now seen corresponding path program 1 times [2019-11-15 23:44:12,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:12,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553820225] [2019-11-15 23:44:12,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:12,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553820225] [2019-11-15 23:44:12,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:12,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:12,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499460898] [2019-11-15 23:44:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:12,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:12,788 INFO L87 Difference]: Start difference. First operand 9713 states and 26564 transitions. Second operand 5 states. [2019-11-15 23:44:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:12,836 INFO L93 Difference]: Finished difference Result 3464 states and 8115 transitions. [2019-11-15 23:44:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:12,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:44:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:12,839 INFO L225 Difference]: With dead ends: 3464 [2019-11-15 23:44:12,839 INFO L226 Difference]: Without dead ends: 2956 [2019-11-15 23:44:12,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-11-15 23:44:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2777. [2019-11-15 23:44:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-11-15 23:44:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 6375 transitions. [2019-11-15 23:44:12,865 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 6375 transitions. Word has length 67 [2019-11-15 23:44:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:12,865 INFO L462 AbstractCegarLoop]: Abstraction has 2777 states and 6375 transitions. [2019-11-15 23:44:12,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 6375 transitions. [2019-11-15 23:44:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:44:12,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:12,867 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:12,868 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1788146014, now seen corresponding path program 1 times [2019-11-15 23:44:12,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:12,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99489839] [2019-11-15 23:44:12,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:12,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99489839] [2019-11-15 23:44:12,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:12,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:12,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537075263] [2019-11-15 23:44:12,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:12,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:12,996 INFO L87 Difference]: Start difference. First operand 2777 states and 6375 transitions. Second operand 6 states. [2019-11-15 23:44:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:13,320 INFO L93 Difference]: Finished difference Result 3127 states and 7123 transitions. [2019-11-15 23:44:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:13,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 23:44:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:13,325 INFO L225 Difference]: With dead ends: 3127 [2019-11-15 23:44:13,325 INFO L226 Difference]: Without dead ends: 3071 [2019-11-15 23:44:13,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-11-15 23:44:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2643. [2019-11-15 23:44:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-15 23:44:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6010 transitions. [2019-11-15 23:44:13,362 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 6010 transitions. Word has length 84 [2019-11-15 23:44:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:13,363 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 6010 transitions. [2019-11-15 23:44:13,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 6010 transitions. [2019-11-15 23:44:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:44:13,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:13,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:13,367 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash 429611939, now seen corresponding path program 1 times [2019-11-15 23:44:13,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:13,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576927023] [2019-11-15 23:44:13,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:13,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576927023] [2019-11-15 23:44:13,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:13,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:13,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842108537] [2019-11-15 23:44:13,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:13,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:13,535 INFO L87 Difference]: Start difference. First operand 2643 states and 6010 transitions. Second operand 6 states. [2019-11-15 23:44:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:13,601 INFO L93 Difference]: Finished difference Result 4586 states and 10507 transitions. [2019-11-15 23:44:13,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:13,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 23:44:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:13,603 INFO L225 Difference]: With dead ends: 4586 [2019-11-15 23:44:13,603 INFO L226 Difference]: Without dead ends: 2033 [2019-11-15 23:44:13,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-11-15 23:44:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2033. [2019-11-15 23:44:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-11-15 23:44:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4646 transitions. [2019-11-15 23:44:13,623 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4646 transitions. Word has length 84 [2019-11-15 23:44:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:13,623 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4646 transitions. [2019-11-15 23:44:13,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4646 transitions. [2019-11-15 23:44:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:44:13,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:13,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:13,627 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash 605039045, now seen corresponding path program 2 times [2019-11-15 23:44:13,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:13,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270800214] [2019-11-15 23:44:13,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:44:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:44:13,708 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:44:13,708 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:44:13,823 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:44:13,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:44:13 BasicIcfg [2019-11-15 23:44:13,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:44:13,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:44:13,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:44:13,830 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:44:13,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:46" (3/4) ... [2019-11-15 23:44:13,833 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:44:13,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5846701c-d0b5-4e54-a937-4a359547ec34/bin/uautomizer/witness.graphml [2019-11-15 23:44:13,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:44:13,990 INFO L168 Benchmark]: Toolchain (without parser) took 29322.44 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 944.8 MB in the beginning and 1.9 GB in the end (delta: -940.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,990 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:44:13,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,991 INFO L168 Benchmark]: Boogie Preprocessor took 41.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:44:13,992 INFO L168 Benchmark]: RCFGBuilder took 864.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,992 INFO L168 Benchmark]: TraceAbstraction took 27489.56 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -905.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,992 INFO L168 Benchmark]: Witness Printer took 158.45 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:13,994 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 701.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 864.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27489.56 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -905.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 158.45 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 195 locations, 3 error locations. Result: UNSAFE, OverallTime: 27.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5035 SDtfs, 6083 SDslu, 9543 SDs, 0 SdLazy, 3758 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57889occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 57426 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 192949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...