./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.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_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/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 27e4d41332fdc7e29d27690e9cf4b43965d7312b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:52:28,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:52:28,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:52:28,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:52:28,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:52:28,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:52:28,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:52:28,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:52:28,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:52:28,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:52:28,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:52:28,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:52:28,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:52:28,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:52:28,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:52:28,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:52:28,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:52:28,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:52:28,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:52:28,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:52:28,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:52:28,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:52:28,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:52:28,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:52:28,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:52:28,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:52:28,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:52:28,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:52:28,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:52:28,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:52:28,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:52:28,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:52:28,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:52:28,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:52:28,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:52:28,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:52:28,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:52:28,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:52:28,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:52:28,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:52:28,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:52:28,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:52:28,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:52:28,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:52:28,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:52:28,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:52:28,650 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:52:28,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:52:28,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:52:28,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:52:28,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:52:28,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:52:28,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:52:28,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:52:28,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:52:28,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:52:28,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:52:28,653 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:52:28,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:52:28,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:52:28,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:52:28,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:52:28,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:52:28,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:52:28,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:52:28,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:52:28,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:52:28,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:52:28,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:52:28,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:52:28,658 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_d19f0214-65a9-40e5-98ce-29c1179430fe/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 -> 27e4d41332fdc7e29d27690e9cf4b43965d7312b [2019-11-15 22:52:28,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:52:28,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:52:28,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:52:28,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:52:28,721 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:52:28,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i [2019-11-15 22:52:28,790 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/data/818ffd172/90217034b66e448f959f6e62dcc8067b/FLAG569d3cccf [2019-11-15 22:52:29,344 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:52:29,345 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i [2019-11-15 22:52:29,361 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/data/818ffd172/90217034b66e448f959f6e62dcc8067b/FLAG569d3cccf [2019-11-15 22:52:29,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/data/818ffd172/90217034b66e448f959f6e62dcc8067b [2019-11-15 22:52:29,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:52:29,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:52:29,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:29,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:52:29,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:52:29,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:29" (1/1) ... [2019-11-15 22:52:29,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f8962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:29, skipping insertion in model container [2019-11-15 22:52:29,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:29" (1/1) ... [2019-11-15 22:52:29,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:52:29,745 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:52:30,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:30,198 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:52:30,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:30,386 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:52:30,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30 WrapperNode [2019-11-15 22:52:30,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:30,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:30,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:52:30,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:52:30,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:30,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:52:30,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:52:30,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:52:30,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... [2019-11-15 22:52:30,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:52:30,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:52:30,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:52:30,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:52:30,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/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 22:52:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:52:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:52:30,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:52:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:52:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:52:30,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:52:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:52:30,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:52:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:52:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:52:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:52:30,597 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 22:52:31,509 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:52:31,510 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:52:31,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:31 BoogieIcfgContainer [2019-11-15 22:52:31,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:52:31,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:52:31,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:52:31,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:52:31,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:52:29" (1/3) ... [2019-11-15 22:52:31,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a1b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:52:31, skipping insertion in model container [2019-11-15 22:52:31,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:30" (2/3) ... [2019-11-15 22:52:31,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a1b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:52:31, skipping insertion in model container [2019-11-15 22:52:31,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:31" (3/3) ... [2019-11-15 22:52:31,519 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2019-11-15 22:52:31,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,558 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,559 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,560 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,561 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,561 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,561 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,561 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,562 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,562 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,562 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,562 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,565 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,566 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,566 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,566 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,566 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,567 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,567 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,567 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,567 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,567 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,570 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,570 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,570 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,570 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,577 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,577 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,577 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,577 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,577 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,578 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,578 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,578 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,578 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,579 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,579 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,579 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,579 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,580 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,580 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,580 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,580 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,581 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,581 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,581 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,581 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,581 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,582 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,582 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,582 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,583 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,583 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,583 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,583 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,584 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,584 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,584 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,584 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,584 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,585 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,585 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,585 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:52:31,600 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:52:31,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:52:31,608 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:52:31,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:52:31,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:52:31,636 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:52:31,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:52:31,636 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:52:31,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:52:31,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:52:31,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:52:31,637 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:52:31,649 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 22:52:34,381 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-15 22:52:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-15 22:52:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:52:34,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:34,394 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] [2019-11-15 22:52:34,397 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash 804825878, now seen corresponding path program 1 times [2019-11-15 22:52:34,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:34,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390602946] [2019-11-15 22:52:34,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:34,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:34,678 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 22:52:34,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390602946] [2019-11-15 22:52:34,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:34,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:52:34,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639604028] [2019-11-15 22:52:34,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:52:34,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:52:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:52:34,703 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-15 22:52:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:35,649 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-15 22:52:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:52:35,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 22:52:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:35,934 INFO L225 Difference]: With dead ends: 33591 [2019-11-15 22:52:35,934 INFO L226 Difference]: Without dead ends: 25703 [2019-11-15 22:52:35,936 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 22:52:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-15 22:52:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-15 22:52:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-15 22:52:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-15 22:52:37,777 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-15 22:52:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:37,780 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-15 22:52:37,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:52:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-15 22:52:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:52:37,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:37,793 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 22:52:37,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash -403070887, now seen corresponding path program 1 times [2019-11-15 22:52:37,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:37,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035900671] [2019-11-15 22:52:37,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:37,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:37,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:37,973 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 22:52:37,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035900671] [2019-11-15 22:52:37,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:37,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:52:37,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446621784] [2019-11-15 22:52:37,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:52:37,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:52:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:52:37,976 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-15 22:52:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:39,203 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-15 22:52:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:52:39,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 22:52:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:39,392 INFO L225 Difference]: With dead ends: 41081 [2019-11-15 22:52:39,392 INFO L226 Difference]: Without dead ends: 40545 [2019-11-15 22:52:39,394 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 22:52:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-15 22:52:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-15 22:52:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-15 22:52:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-15 22:52:41,026 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-15 22:52:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:41,028 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-15 22:52:41,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:52:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-15 22:52:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:52:41,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:41,042 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 22:52:41,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash -983495017, now seen corresponding path program 1 times [2019-11-15 22:52:41,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:41,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614139969] [2019-11-15 22:52:41,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:41,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:41,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:41,170 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 22:52:41,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614139969] [2019-11-15 22:52:41,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:41,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:52:41,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835464804] [2019-11-15 22:52:41,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:52:41,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:52:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:52:41,172 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-15 22:52:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:41,871 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-15 22:52:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:52:41,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 22:52:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:42,283 INFO L225 Difference]: With dead ends: 49778 [2019-11-15 22:52:42,283 INFO L226 Difference]: Without dead ends: 49274 [2019-11-15 22:52:42,284 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 22:52:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-15 22:52:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-15 22:52:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-15 22:52:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-15 22:52:44,349 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-15 22:52:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:44,350 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-15 22:52:44,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:52:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-15 22:52:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:52:44,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:44,361 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 22:52:44,362 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 725324221, now seen corresponding path program 1 times [2019-11-15 22:52:44,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:44,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781114451] [2019-11-15 22:52:44,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:44,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:44,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:44,406 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 22:52:44,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781114451] [2019-11-15 22:52:44,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:44,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:52:44,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064254067] [2019-11-15 22:52:44,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:44,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:44,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:44,408 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-15 22:52:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:44,686 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-15 22:52:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:44,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 22:52:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:45,736 INFO L225 Difference]: With dead ends: 61087 [2019-11-15 22:52:45,737 INFO L226 Difference]: Without dead ends: 61087 [2019-11-15 22:52:45,737 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 22:52:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-15 22:52:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-15 22:52:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-15 22:52:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-15 22:52:46,838 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-15 22:52:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:46,839 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-15 22:52:46,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-15 22:52:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:52:46,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:46,858 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 22:52:46,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1537407053, now seen corresponding path program 1 times [2019-11-15 22:52:46,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:46,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298062577] [2019-11-15 22:52:46,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:46,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:46,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:47,005 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 22:52:47,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298062577] [2019-11-15 22:52:47,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:47,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:52:47,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239324368] [2019-11-15 22:52:47,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:52:47,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:52:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:52:47,009 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-15 22:52:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:48,010 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-15 22:52:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:52:48,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:52:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:48,180 INFO L225 Difference]: With dead ends: 63756 [2019-11-15 22:52:48,180 INFO L226 Difference]: Without dead ends: 63756 [2019-11-15 22:52:48,181 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 22:52:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-15 22:52:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-15 22:52:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-15 22:52:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-15 22:52:52,891 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-15 22:52:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:52,891 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-15 22:52:52,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:52:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-15 22:52:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:52:52,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:52,916 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 22:52:52,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash 960608884, now seen corresponding path program 1 times [2019-11-15 22:52:52,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:52,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662476502] [2019-11-15 22:52:52,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:53,038 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 22:52:53,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662476502] [2019-11-15 22:52:53,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:53,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:52:53,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117446480] [2019-11-15 22:52:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:52:53,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:52:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:52:53,041 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-15 22:52:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:54,400 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-15 22:52:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:52:54,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 22:52:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:54,577 INFO L225 Difference]: With dead ends: 83685 [2019-11-15 22:52:54,577 INFO L226 Difference]: Without dead ends: 83685 [2019-11-15 22:52:54,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:52:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-15 22:52:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-15 22:52:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-15 22:52:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-15 22:52:56,643 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-15 22:52:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:56,644 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-15 22:52:56,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:52:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-15 22:52:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:52:56,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:56,663 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 22:52:56,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1848112565, now seen corresponding path program 1 times [2019-11-15 22:52:56,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:56,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78431061] [2019-11-15 22:52:56,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:56,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:56,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:56,736 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 22:52:56,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78431061] [2019-11-15 22:52:56,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:56,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:52:56,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536413526] [2019-11-15 22:52:56,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:56,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:56,738 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-11-15 22:52:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:56,970 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-11-15 22:52:56,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:56,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 22:52:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:57,083 INFO L225 Difference]: With dead ends: 54021 [2019-11-15 22:52:57,083 INFO L226 Difference]: Without dead ends: 54021 [2019-11-15 22:52:57,083 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 22:52:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-11-15 22:52:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-11-15 22:52:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-11-15 22:52:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-11-15 22:52:58,078 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-11-15 22:52:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:58,079 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-11-15 22:52:58,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-11-15 22:52:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:52:58,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:58,087 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 22:52:58,087 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1901030392, now seen corresponding path program 1 times [2019-11-15 22:52:58,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:58,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470632323] [2019-11-15 22:52:58,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:58,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:58,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:58,982 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 22:52:58,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470632323] [2019-11-15 22:52:58,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:58,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:52:58,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980458140] [2019-11-15 22:52:58,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:52:58,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:52:58,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:52:58,984 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-11-15 22:52:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:59,812 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-11-15 22:52:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:52:59,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:52:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:59,958 INFO L225 Difference]: With dead ends: 68646 [2019-11-15 22:52:59,959 INFO L226 Difference]: Without dead ends: 68078 [2019-11-15 22:52:59,959 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 22:53:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-11-15 22:53:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-11-15 22:53:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-11-15 22:53:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-11-15 22:53:01,100 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-11-15 22:53:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:01,100 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-11-15 22:53:01,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:53:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-11-15 22:53:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:53:01,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:01,112 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 22:53:01,112 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1997707013, now seen corresponding path program 1 times [2019-11-15 22:53:01,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:01,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208350199] [2019-11-15 22:53:01,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:01,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:01,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:01,251 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 22:53:01,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208350199] [2019-11-15 22:53:01,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:01,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:53:01,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519352853] [2019-11-15 22:53:01,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:53:01,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:01,254 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-11-15 22:53:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:02,141 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-11-15 22:53:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:53:02,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:53:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:02,284 INFO L225 Difference]: With dead ends: 67849 [2019-11-15 22:53:02,285 INFO L226 Difference]: Without dead ends: 67849 [2019-11-15 22:53:02,285 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 22:53:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-11-15 22:53:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-11-15 22:53:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-11-15 22:53:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-11-15 22:53:03,878 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-11-15 22:53:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:03,879 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-11-15 22:53:03,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:53:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-11-15 22:53:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:53:03,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:03,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, 1] [2019-11-15 22:53:03,889 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1110203332, now seen corresponding path program 1 times [2019-11-15 22:53:03,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:03,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860489024] [2019-11-15 22:53:03,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:03,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:03,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:03,965 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 22:53:03,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860489024] [2019-11-15 22:53:03,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:03,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:03,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98631615] [2019-11-15 22:53:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:03,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:03,967 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-11-15 22:53:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:04,026 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-11-15 22:53:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:04,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 22:53:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:04,038 INFO L225 Difference]: With dead ends: 10212 [2019-11-15 22:53:04,039 INFO L226 Difference]: Without dead ends: 8507 [2019-11-15 22:53:04,039 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 22:53:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-11-15 22:53:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-11-15 22:53:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-11-15 22:53:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-11-15 22:53:04,147 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-11-15 22:53:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:04,147 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-11-15 22:53:04,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-11-15 22:53:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:53:04,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:04,151 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] [2019-11-15 22:53:04,151 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1637098212, now seen corresponding path program 1 times [2019-11-15 22:53:04,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:04,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670504983] [2019-11-15 22:53:04,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:04,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:04,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:04,194 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 22:53:04,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670504983] [2019-11-15 22:53:04,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:04,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:04,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261595583] [2019-11-15 22:53:04,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:04,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:04,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:04,195 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-11-15 22:53:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:04,339 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-11-15 22:53:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:04,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 22:53:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:04,357 INFO L225 Difference]: With dead ends: 9706 [2019-11-15 22:53:04,357 INFO L226 Difference]: Without dead ends: 9706 [2019-11-15 22:53:04,358 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 22:53:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-11-15 22:53:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-11-15 22:53:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-11-15 22:53:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-11-15 22:53:04,513 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-11-15 22:53:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:04,513 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-11-15 22:53:04,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-11-15 22:53:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:53:04,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:04,516 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] [2019-11-15 22:53:04,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash -915058749, now seen corresponding path program 1 times [2019-11-15 22:53:04,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:04,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052480079] [2019-11-15 22:53:04,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:04,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:04,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:04,587 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 22:53:04,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052480079] [2019-11-15 22:53:04,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:04,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:53:04,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863098152] [2019-11-15 22:53:04,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:53:04,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:04,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:04,589 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-11-15 22:53:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:05,002 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-11-15 22:53:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:53:05,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 22:53:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:05,015 INFO L225 Difference]: With dead ends: 11195 [2019-11-15 22:53:05,015 INFO L226 Difference]: Without dead ends: 11134 [2019-11-15 22:53:05,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:53:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-11-15 22:53:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-11-15 22:53:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-11-15 22:53:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-11-15 22:53:05,152 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-11-15 22:53:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:05,152 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-11-15 22:53:05,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:53:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-11-15 22:53:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:05,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:05,157 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 22:53:05,157 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1317259294, now seen corresponding path program 1 times [2019-11-15 22:53:05,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:05,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090260071] [2019-11-15 22:53:05,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:05,201 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 22:53:05,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090260071] [2019-11-15 22:53:05,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:05,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:05,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901135792] [2019-11-15 22:53:05,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:05,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:05,203 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-11-15 22:53:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:05,579 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-11-15 22:53:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:05,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:53:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:05,598 INFO L225 Difference]: With dead ends: 15178 [2019-11-15 22:53:05,598 INFO L226 Difference]: Without dead ends: 15178 [2019-11-15 22:53:05,598 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 22:53:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-11-15 22:53:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-11-15 22:53:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-11-15 22:53:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-11-15 22:53:05,762 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-11-15 22:53:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:05,762 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-11-15 22:53:05,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-11-15 22:53:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:05,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:05,770 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 22:53:05,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1384266047, now seen corresponding path program 1 times [2019-11-15 22:53:05,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:05,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773974863] [2019-11-15 22:53:05,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:05,871 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 22:53:05,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773974863] [2019-11-15 22:53:05,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:05,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:53:05,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727249494] [2019-11-15 22:53:05,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:53:05,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:05,874 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-11-15 22:53:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:06,254 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-11-15 22:53:06,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:53:06,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 22:53:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:06,271 INFO L225 Difference]: With dead ends: 12772 [2019-11-15 22:53:06,272 INFO L226 Difference]: Without dead ends: 12772 [2019-11-15 22:53:06,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:53:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-11-15 22:53:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-11-15 22:53:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-11-15 22:53:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-11-15 22:53:06,426 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-11-15 22:53:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:06,426 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-11-15 22:53:06,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:53:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-11-15 22:53:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:06,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:06,433 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 22:53:06,433 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 872644960, now seen corresponding path program 1 times [2019-11-15 22:53:06,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:06,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690650222] [2019-11-15 22:53:06,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:06,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:06,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:06,499 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 22:53:06,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690650222] [2019-11-15 22:53:06,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:06,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:53:06,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954036358] [2019-11-15 22:53:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:53:06,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:06,500 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-11-15 22:53:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:06,818 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-11-15 22:53:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:53:06,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:53:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:06,839 INFO L225 Difference]: With dead ends: 15220 [2019-11-15 22:53:06,839 INFO L226 Difference]: Without dead ends: 15220 [2019-11-15 22:53:06,839 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 22:53:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-11-15 22:53:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-11-15 22:53:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-11-15 22:53:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-11-15 22:53:07,029 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-11-15 22:53:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:07,029 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-11-15 22:53:07,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:53:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-11-15 22:53:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:07,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:07,038 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 22:53:07,038 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 362110783, now seen corresponding path program 1 times [2019-11-15 22:53:07,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:07,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310721378] [2019-11-15 22:53:07,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:07,114 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 22:53:07,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310721378] [2019-11-15 22:53:07,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:07,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:07,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213542608] [2019-11-15 22:53:07,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:07,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:07,123 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-11-15 22:53:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:07,559 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-11-15 22:53:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:07,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:53:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:07,582 INFO L225 Difference]: With dead ends: 17525 [2019-11-15 22:53:07,582 INFO L226 Difference]: Without dead ends: 17354 [2019-11-15 22:53:07,582 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 22:53:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-11-15 22:53:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-11-15 22:53:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-11-15 22:53:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-11-15 22:53:07,798 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-11-15 22:53:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:07,798 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-11-15 22:53:07,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-11-15 22:53:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:07,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:07,807 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 22:53:07,807 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1434840576, now seen corresponding path program 1 times [2019-11-15 22:53:07,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:07,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118890927] [2019-11-15 22:53:07,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:07,966 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 22:53:07,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118890927] [2019-11-15 22:53:07,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:07,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:53:07,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029050078] [2019-11-15 22:53:07,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:53:07,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:53:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:07,967 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states. [2019-11-15 22:53:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:08,425 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-11-15 22:53:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:53:08,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-15 22:53:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:08,452 INFO L225 Difference]: With dead ends: 21898 [2019-11-15 22:53:08,453 INFO L226 Difference]: Without dead ends: 21898 [2019-11-15 22:53:08,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:53:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-11-15 22:53:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-11-15 22:53:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-11-15 22:53:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-11-15 22:53:08,753 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-11-15 22:53:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:08,753 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-11-15 22:53:08,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:53:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-11-15 22:53:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:08,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:08,763 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 22:53:08,763 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash -547336895, now seen corresponding path program 1 times [2019-11-15 22:53:08,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:08,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119575479] [2019-11-15 22:53:08,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:08,837 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 22:53:08,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119575479] [2019-11-15 22:53:08,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:08,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:53:08,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817665239] [2019-11-15 22:53:08,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:53:08,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:08,839 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states. [2019-11-15 22:53:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:08,892 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-11-15 22:53:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:53:08,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:53:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:08,896 INFO L225 Difference]: With dead ends: 5654 [2019-11-15 22:53:08,897 INFO L226 Difference]: Without dead ends: 4682 [2019-11-15 22:53:08,897 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 22:53:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-11-15 22:53:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-11-15 22:53:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-11-15 22:53:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-11-15 22:53:08,950 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-11-15 22:53:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:08,950 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-11-15 22:53:08,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:53:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-11-15 22:53:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:53:08,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:08,954 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 22:53:08,954 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1150417780, now seen corresponding path program 1 times [2019-11-15 22:53:08,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:08,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365349637] [2019-11-15 22:53:08,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:08,997 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 22:53:08,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365349637] [2019-11-15 22:53:08,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:08,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:08,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547386289] [2019-11-15 22:53:08,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:08,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:09,000 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-11-15 22:53:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:09,043 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-11-15 22:53:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:09,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:53:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:09,050 INFO L225 Difference]: With dead ends: 4819 [2019-11-15 22:53:09,050 INFO L226 Difference]: Without dead ends: 4819 [2019-11-15 22:53:09,051 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 22:53:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-11-15 22:53:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-11-15 22:53:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-11-15 22:53:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-11-15 22:53:09,121 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-11-15 22:53:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:09,122 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-11-15 22:53:09,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-11-15 22:53:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:53:09,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:09,127 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] [2019-11-15 22:53:09,128 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1049398009, now seen corresponding path program 1 times [2019-11-15 22:53:09,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:09,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234014438] [2019-11-15 22:53:09,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:09,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:09,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:09,206 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 22:53:09,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234014438] [2019-11-15 22:53:09,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:09,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:53:09,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734692615] [2019-11-15 22:53:09,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:53:09,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:09,209 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-11-15 22:53:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:09,431 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-11-15 22:53:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:53:09,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-15 22:53:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:09,437 INFO L225 Difference]: With dead ends: 4737 [2019-11-15 22:53:09,437 INFO L226 Difference]: Without dead ends: 4737 [2019-11-15 22:53:09,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:53:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-11-15 22:53:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-11-15 22:53:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-11-15 22:53:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-11-15 22:53:09,499 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-11-15 22:53:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:09,499 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-11-15 22:53:09,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:53:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-11-15 22:53:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:53:09,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:09,504 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] [2019-11-15 22:53:09,505 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 693412326, now seen corresponding path program 1 times [2019-11-15 22:53:09,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:09,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951431710] [2019-11-15 22:53:09,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:09,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:09,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:09,624 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 22:53:09,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951431710] [2019-11-15 22:53:09,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:09,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:53:09,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135517183] [2019-11-15 22:53:09,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:53:09,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:53:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:09,626 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-11-15 22:53:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:10,107 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-11-15 22:53:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:53:10,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 22:53:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:10,112 INFO L225 Difference]: With dead ends: 4873 [2019-11-15 22:53:10,112 INFO L226 Difference]: Without dead ends: 4820 [2019-11-15 22:53:10,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:53:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-11-15 22:53:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-11-15 22:53:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-11-15 22:53:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-11-15 22:53:10,155 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-11-15 22:53:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:10,155 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-11-15 22:53:10,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:53:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-11-15 22:53:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:53:10,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:10,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:10,159 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1701778149, now seen corresponding path program 1 times [2019-11-15 22:53:10,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:10,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305025029] [2019-11-15 22:53:10,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:10,239 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 22:53:10,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305025029] [2019-11-15 22:53:10,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:10,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:10,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727322798] [2019-11-15 22:53:10,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:10,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:10,241 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-11-15 22:53:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:10,371 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-11-15 22:53:10,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:10,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 22:53:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:10,376 INFO L225 Difference]: With dead ends: 5804 [2019-11-15 22:53:10,376 INFO L226 Difference]: Without dead ends: 5513 [2019-11-15 22:53:10,376 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 22:53:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-11-15 22:53:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-11-15 22:53:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-11-15 22:53:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-11-15 22:53:10,425 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-11-15 22:53:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:10,425 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-11-15 22:53:10,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-11-15 22:53:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:53:10,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:10,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:10,432 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1418627685, now seen corresponding path program 1 times [2019-11-15 22:53:10,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:10,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807268527] [2019-11-15 22:53:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:10,489 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 22:53:10,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807268527] [2019-11-15 22:53:10,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:10,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:10,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231289535] [2019-11-15 22:53:10,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:10,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:10,491 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-11-15 22:53:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:10,612 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-11-15 22:53:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:10,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 22:53:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:10,618 INFO L225 Difference]: With dead ends: 5316 [2019-11-15 22:53:10,619 INFO L226 Difference]: Without dead ends: 5316 [2019-11-15 22:53:10,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 22:53:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-11-15 22:53:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-11-15 22:53:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-11-15 22:53:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-11-15 22:53:10,690 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-11-15 22:53:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:10,690 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-11-15 22:53:10,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-11-15 22:53:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:10,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:10,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:10,697 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1732341953, now seen corresponding path program 1 times [2019-11-15 22:53:10,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:10,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137894437] [2019-11-15 22:53:10,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:10,765 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 22:53:10,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137894437] [2019-11-15 22:53:10,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:10,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:53:10,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095234876] [2019-11-15 22:53:10,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:53:10,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:10,768 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-11-15 22:53:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:10,890 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-11-15 22:53:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:53:10,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 22:53:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:10,895 INFO L225 Difference]: With dead ends: 5452 [2019-11-15 22:53:10,895 INFO L226 Difference]: Without dead ends: 5452 [2019-11-15 22:53:10,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 22:53:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-11-15 22:53:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-11-15 22:53:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-15 22:53:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-11-15 22:53:10,937 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-11-15 22:53:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:10,937 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-11-15 22:53:10,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:53:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-11-15 22:53:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:10,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:10,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:10,941 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1743658080, now seen corresponding path program 1 times [2019-11-15 22:53:10,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:10,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059997531] [2019-11-15 22:53:10,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:11,004 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 22:53:11,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059997531] [2019-11-15 22:53:11,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:11,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:11,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638853449] [2019-11-15 22:53:11,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:11,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:11,007 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-11-15 22:53:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:11,196 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-11-15 22:53:11,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:11,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:53:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:11,200 INFO L225 Difference]: With dead ends: 4884 [2019-11-15 22:53:11,200 INFO L226 Difference]: Without dead ends: 4828 [2019-11-15 22:53:11,200 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 22:53:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-11-15 22:53:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-11-15 22:53:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-11-15 22:53:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-11-15 22:53:11,247 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-11-15 22:53:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:11,247 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-11-15 22:53:11,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-11-15 22:53:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:11,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:11,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:11,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash -333551263, now seen corresponding path program 1 times [2019-11-15 22:53:11,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:11,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928103352] [2019-11-15 22:53:11,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:11,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:11,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:11,399 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 22:53:11,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928103352] [2019-11-15 22:53:11,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:11,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:53:11,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616240535] [2019-11-15 22:53:11,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:53:11,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:53:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:53:11,401 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states. [2019-11-15 22:53:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:11,984 INFO L93 Difference]: Finished difference Result 6285 states and 13941 transitions. [2019-11-15 22:53:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:53:11,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 22:53:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:11,989 INFO L225 Difference]: With dead ends: 6285 [2019-11-15 22:53:11,990 INFO L226 Difference]: Without dead ends: 6285 [2019-11-15 22:53:11,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:53:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-11-15 22:53:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107. [2019-11-15 22:53:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-11-15 22:53:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-11-15 22:53:12,046 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-11-15 22:53:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:12,046 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-11-15 22:53:12,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:53:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-11-15 22:53:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:12,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:12,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:12,051 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -122200350, now seen corresponding path program 1 times [2019-11-15 22:53:12,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:12,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639121290] [2019-11-15 22:53:12,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:12,218 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 22:53:12,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639121290] [2019-11-15 22:53:12,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:12,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:53:12,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243987999] [2019-11-15 22:53:12,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:53:12,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:53:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:53:12,221 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 9 states. [2019-11-15 22:53:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:12,801 INFO L93 Difference]: Finished difference Result 6373 states and 14097 transitions. [2019-11-15 22:53:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:53:12,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 22:53:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:12,810 INFO L225 Difference]: With dead ends: 6373 [2019-11-15 22:53:12,810 INFO L226 Difference]: Without dead ends: 6355 [2019-11-15 22:53:12,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:53:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-11-15 22:53:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5470. [2019-11-15 22:53:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-11-15 22:53:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 12131 transitions. [2019-11-15 22:53:12,872 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 12131 transitions. Word has length 96 [2019-11-15 22:53:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:12,872 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 12131 transitions. [2019-11-15 22:53:12,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:53:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 12131 transitions. [2019-11-15 22:53:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:12,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:12,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:12,880 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 765303331, now seen corresponding path program 1 times [2019-11-15 22:53:12,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:12,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646401120] [2019-11-15 22:53:12,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:13,016 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 22:53:13,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646401120] [2019-11-15 22:53:13,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:13,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:53:13,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866779311] [2019-11-15 22:53:13,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:53:13,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:53:13,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:53:13,020 INFO L87 Difference]: Start difference. First operand 5470 states and 12131 transitions. Second operand 10 states. [2019-11-15 22:53:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:13,532 INFO L93 Difference]: Finished difference Result 17542 states and 39329 transitions. [2019-11-15 22:53:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:53:13,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 22:53:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:13,545 INFO L225 Difference]: With dead ends: 17542 [2019-11-15 22:53:13,545 INFO L226 Difference]: Without dead ends: 11338 [2019-11-15 22:53:13,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:53:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2019-11-15 22:53:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 5429. [2019-11-15 22:53:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2019-11-15 22:53:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 11955 transitions. [2019-11-15 22:53:13,652 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 11955 transitions. Word has length 96 [2019-11-15 22:53:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:13,652 INFO L462 AbstractCegarLoop]: Abstraction has 5429 states and 11955 transitions. [2019-11-15 22:53:13,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:53:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 11955 transitions. [2019-11-15 22:53:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:53:13,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:13,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:13,657 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1962907283, now seen corresponding path program 2 times [2019-11-15 22:53:13,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:13,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094554755] [2019-11-15 22:53:13,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:13,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:13,752 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:53:13,902 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:53:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:53:13 BasicIcfg [2019-11-15 22:53:13,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:53:13,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:53:13,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:53:13,905 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:53:13,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:31" (3/4) ... [2019-11-15 22:53:13,908 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:53:14,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d19f0214-65a9-40e5-98ce-29c1179430fe/bin/uautomizer/witness.graphml [2019-11-15 22:53:14,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:53:14,039 INFO L168 Benchmark]: Toolchain (without parser) took 44367.40 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 943.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,039 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:14,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,041 INFO L168 Benchmark]: Boogie Preprocessor took 62.45 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 22:53:14,041 INFO L168 Benchmark]: RCFGBuilder took 1006.85 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: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,041 INFO L168 Benchmark]: TraceAbstraction took 42391.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,042 INFO L168 Benchmark]: Witness Printer took 132.54 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:14,044 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.45 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 1006.85 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: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42391.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 132.54 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 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] [L702] 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] [L704] 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 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, y=0] [L707] 0 _Bool y$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, y=0, y$flush_delayed=0] [L708] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L716] 0 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t313; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t313, ((void *)0), P0, ((void *)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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 pthread_t t314; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] FCALL, FORK 0 pthread_create(&t314, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 42.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7827 SDtfs, 8892 SDslu, 18016 SDs, 0 SdLazy, 6695 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 86547 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 349617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...