./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/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 ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-01 13:05:32,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:05:32,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:05:32,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:05:32,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:05:32,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:05:32,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:05:32,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:05:32,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:05:32,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:05:32,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:05:32,445 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:05:32,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:05:32,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:05:32,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:05:32,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:05:32,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:05:32,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:05:32,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:05:32,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:05:32,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:05:32,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:05:32,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:05:32,452 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:05:32,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:05:32,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:05:32,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:05:32,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:05:32,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:05:32,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:05:32,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:05:32,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:05:32,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:05:32,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:05:32,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:05:32,455 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:05:32,455 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 13:05:32,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:05:32,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:05:32,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 13:05:32,463 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 13:05:32,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:05:32,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:05:32,463 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:05:32,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:05:32,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:05:32,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 13:05:32,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:05:32,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 13:05:32,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/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 -> ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 [2018-12-01 13:05:32,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:05:32,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:05:32,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:05:32,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:05:32,496 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:05:32,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-12-01 13:05:32,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/data/031366159/21b4792d673e4a35b5db2591ad67442e/FLAG5d54b2768 [2018-12-01 13:05:32,963 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:05:32,964 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-12-01 13:05:32,971 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/data/031366159/21b4792d673e4a35b5db2591ad67442e/FLAG5d54b2768 [2018-12-01 13:05:32,979 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/data/031366159/21b4792d673e4a35b5db2591ad67442e [2018-12-01 13:05:32,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:05:32,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 13:05:32,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:05:32,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:05:32,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:05:32,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:05:32" (1/1) ... [2018-12-01 13:05:32,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:32, skipping insertion in model container [2018-12-01 13:05:32,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:05:32" (1/1) ... [2018-12-01 13:05:32,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:05:33,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:05:33,193 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:05:33,201 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:05:33,279 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:05:33,311 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:05:33,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33 WrapperNode [2018-12-01 13:05:33,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:05:33,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 13:05:33,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 13:05:33,312 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 13:05:33,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 13:05:33,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:05:33,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:05:33,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:05:33,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... [2018-12-01 13:05:33,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:05:33,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:05:33,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:05:33,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:05:33,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/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 [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 13:05:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 13:05:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 13:05:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 13:05:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-01 13:05:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-01 13:05:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 13:05:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:05:33,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:05:33,404 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 13:05:33,706 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:05:33,706 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 13:05:33,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:33 BoogieIcfgContainer [2018-12-01 13:05:33,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:05:33,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 13:05:33,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 13:05:33,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 13:05:33,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:05:32" (1/3) ... [2018-12-01 13:05:33,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d848d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:05:33, skipping insertion in model container [2018-12-01 13:05:33,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:33" (2/3) ... [2018-12-01 13:05:33,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d848d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:05:33, skipping insertion in model container [2018-12-01 13:05:33,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:33" (3/3) ... [2018-12-01 13:05:33,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt_false-unreach-call.i [2018-12-01 13:05:33,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,736 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,736 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,736 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,736 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,736 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,743 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:05:33,753 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 13:05:33,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 13:05:33,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 13:05:33,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 13:05:33,793 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:05:33,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 13:05:33,794 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 13:05:33,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 13:05:33,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:05:33,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:05:33,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 13:05:33,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:05:33,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 13:05:33,801 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-01 13:05:48,101 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-01 13:05:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-01 13:05:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 13:05:48,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:48,111 INFO L402 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] [2018-12-01 13:05:48,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:05:48,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-01 13:05:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:48,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:48,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:05:48,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:05:48,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:05:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:05:48,276 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-01 13:05:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:49,489 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-01 13:05:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:05:49,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-01 13:05:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:51,757 INFO L225 Difference]: With dead ends: 233474 [2018-12-01 13:05:51,757 INFO L226 Difference]: Without dead ends: 203724 [2018-12-01 13:05:51,758 INFO L631 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 [2018-12-01 13:05:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-01 13:05:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-01 13:05:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-01 13:05:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-01 13:05:55,283 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-01 13:05:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:55,284 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-01 13:05:55,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:05:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-01 13:05:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 13:05:55,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:55,290 INFO L402 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] [2018-12-01 13:05:55,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:05:55,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-01 13:05:55,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:55,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:55,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 13:05:55,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:05:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:05:55,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:05:55,327 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-01 13:05:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:56,280 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-01 13:05:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:05:56,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-01 13:05:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:56,598 INFO L225 Difference]: With dead ends: 118894 [2018-12-01 13:05:56,599 INFO L226 Difference]: Without dead ends: 118894 [2018-12-01 13:05:56,599 INFO L631 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 [2018-12-01 13:05:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-01 13:06:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-01 13:06:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-01 13:06:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-01 13:06:00,935 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-01 13:06:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:00,935 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-01 13:06:00,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:06:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-01 13:06:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 13:06:00,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:00,939 INFO L402 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] [2018-12-01 13:06:00,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:00,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-01 13:06:00,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:06:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:06:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:06:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:06:00,992 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-01 13:06:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:02,684 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-01 13:06:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:06:02,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-01 13:06:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:04,088 INFO L225 Difference]: With dead ends: 325274 [2018-12-01 13:06:04,088 INFO L226 Difference]: Without dead ends: 324274 [2018-12-01 13:06:04,089 INFO L631 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 [2018-12-01 13:06:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-01 13:06:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-01 13:06:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-01 13:06:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-01 13:06:11,401 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-01 13:06:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:11,401 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-01 13:06:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:06:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-01 13:06:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 13:06:11,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:11,409 INFO L402 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] [2018-12-01 13:06:11,409 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-01 13:06:11,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:06:11,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:06:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:06:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:06:11,468 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 5 states. [2018-12-01 13:06:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:13,629 INFO L93 Difference]: Finished difference Result 334054 states and 1500995 transitions. [2018-12-01 13:06:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:06:13,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-01 13:06:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:14,553 INFO L225 Difference]: With dead ends: 334054 [2018-12-01 13:06:14,554 INFO L226 Difference]: Without dead ends: 333004 [2018-12-01 13:06:14,554 INFO L631 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 [2018-12-01 13:06:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-12-01 13:06:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-12-01 13:06:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-01 13:06:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876474 transitions. [2018-12-01 13:06:22,775 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876474 transitions. Word has length 53 [2018-12-01 13:06:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:22,775 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876474 transitions. [2018-12-01 13:06:22,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:06:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876474 transitions. [2018-12-01 13:06:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 13:06:22,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:22,800 INFO L402 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] [2018-12-01 13:06:22,800 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:22,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1090824439, now seen corresponding path program 1 times [2018-12-01 13:06:22,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:22,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:22,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:06:22,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:06:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:06:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:06:22,839 INFO L87 Difference]: Start difference. First operand 194884 states and 876474 transitions. Second operand 4 states. [2018-12-01 13:06:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:23,573 INFO L93 Difference]: Finished difference Result 172220 states and 761327 transitions. [2018-12-01 13:06:23,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:06:23,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-01 13:06:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:23,984 INFO L225 Difference]: With dead ends: 172220 [2018-12-01 13:06:23,984 INFO L226 Difference]: Without dead ends: 169615 [2018-12-01 13:06:23,985 INFO L631 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 [2018-12-01 13:06:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169615 states. [2018-12-01 13:06:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169615 to 169615. [2018-12-01 13:06:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-12-01 13:06:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752655 transitions. [2018-12-01 13:06:28,057 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752655 transitions. Word has length 60 [2018-12-01 13:06:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:28,057 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752655 transitions. [2018-12-01 13:06:28,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:06:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752655 transitions. [2018-12-01 13:06:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 13:06:28,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:28,077 INFO L402 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] [2018-12-01 13:06:28,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:28,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash -78953799, now seen corresponding path program 1 times [2018-12-01 13:06:28,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:28,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:28,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:28,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:28,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:28,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:06:28,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:06:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:06:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:06:28,126 INFO L87 Difference]: Start difference. First operand 169615 states and 752655 transitions. Second operand 6 states. [2018-12-01 13:06:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:30,236 INFO L93 Difference]: Finished difference Result 292571 states and 1274504 transitions. [2018-12-01 13:06:30,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 13:06:30,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-01 13:06:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:30,977 INFO L225 Difference]: With dead ends: 292571 [2018-12-01 13:06:30,977 INFO L226 Difference]: Without dead ends: 291731 [2018-12-01 13:06:30,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-01 13:06:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291731 states. [2018-12-01 13:06:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291731 to 164647. [2018-12-01 13:06:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-12-01 13:06:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730661 transitions. [2018-12-01 13:06:37,753 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730661 transitions. Word has length 61 [2018-12-01 13:06:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:37,754 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730661 transitions. [2018-12-01 13:06:37,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:06:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730661 transitions. [2018-12-01 13:06:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 13:06:37,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:37,813 INFO L402 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] [2018-12-01 13:06:37,813 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:37,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1004810369, now seen corresponding path program 1 times [2018-12-01 13:06:37,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:37,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:37,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:37,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:37,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 13:06:37,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:06:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:06:37,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:06:37,860 INFO L87 Difference]: Start difference. First operand 164647 states and 730661 transitions. Second operand 3 states. [2018-12-01 13:06:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:38,603 INFO L93 Difference]: Finished difference Result 164647 states and 730625 transitions. [2018-12-01 13:06:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:06:38,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-01 13:06:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:39,395 INFO L225 Difference]: With dead ends: 164647 [2018-12-01 13:06:39,395 INFO L226 Difference]: Without dead ends: 164647 [2018-12-01 13:06:39,396 INFO L631 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 [2018-12-01 13:06:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164647 states. [2018-12-01 13:06:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164647 to 164647. [2018-12-01 13:06:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-12-01 13:06:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730625 transitions. [2018-12-01 13:06:42,565 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730625 transitions. Word has length 68 [2018-12-01 13:06:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:42,565 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730625 transitions. [2018-12-01 13:06:42,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:06:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730625 transitions. [2018-12-01 13:06:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 13:06:42,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:42,623 INFO L402 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] [2018-12-01 13:06:42,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:42,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1033245920, now seen corresponding path program 1 times [2018-12-01 13:06:42,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:42,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:42,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:42,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:06:42,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:06:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:06:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:06:42,670 INFO L87 Difference]: Start difference. First operand 164647 states and 730625 transitions. Second operand 4 states. [2018-12-01 13:06:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:44,324 INFO L93 Difference]: Finished difference Result 264423 states and 1158909 transitions. [2018-12-01 13:06:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:06:44,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-01 13:06:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:45,011 INFO L225 Difference]: With dead ends: 264423 [2018-12-01 13:06:45,011 INFO L226 Difference]: Without dead ends: 263063 [2018-12-01 13:06:45,011 INFO L631 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 [2018-12-01 13:06:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263063 states. [2018-12-01 13:06:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263063 to 220279. [2018-12-01 13:06:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220279 states. [2018-12-01 13:06:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220279 states to 220279 states and 974873 transitions. [2018-12-01 13:06:52,468 INFO L78 Accepts]: Start accepts. Automaton has 220279 states and 974873 transitions. Word has length 68 [2018-12-01 13:06:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:52,468 INFO L480 AbstractCegarLoop]: Abstraction has 220279 states and 974873 transitions. [2018-12-01 13:06:52,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:06:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 220279 states and 974873 transitions. [2018-12-01 13:06:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 13:06:52,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:52,558 INFO L402 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] [2018-12-01 13:06:52,558 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:06:52,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash 320063777, now seen corresponding path program 1 times [2018-12-01 13:06:52,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:52,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:52,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:06:52,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:06:52,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:06:52,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:06:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:06:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:06:52,607 INFO L87 Difference]: Start difference. First operand 220279 states and 974873 transitions. Second operand 6 states. [2018-12-01 13:06:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:55,259 INFO L93 Difference]: Finished difference Result 441807 states and 1933390 transitions. [2018-12-01 13:06:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 13:06:55,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-01 13:06:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:56,483 INFO L225 Difference]: With dead ends: 441807 [2018-12-01 13:06:56,483 INFO L226 Difference]: Without dead ends: 440527 [2018-12-01 13:06:56,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:06:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440527 states. [2018-12-01 13:07:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440527 to 253351. [2018-12-01 13:07:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253351 states. [2018-12-01 13:07:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253351 states to 253351 states and 1112981 transitions. [2018-12-01 13:07:03,729 INFO L78 Accepts]: Start accepts. Automaton has 253351 states and 1112981 transitions. Word has length 68 [2018-12-01 13:07:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:03,729 INFO L480 AbstractCegarLoop]: Abstraction has 253351 states and 1112981 transitions. [2018-12-01 13:07:03,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:07:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 253351 states and 1112981 transitions. [2018-12-01 13:07:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 13:07:03,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:03,847 INFO L402 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] [2018-12-01 13:07:03,848 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:07:03,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash -449953231, now seen corresponding path program 1 times [2018-12-01 13:07:03,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:03,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:03,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:07:03,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 13:07:03,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:07:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:07:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:07:03,881 INFO L87 Difference]: Start difference. First operand 253351 states and 1112981 transitions. Second operand 3 states. [2018-12-01 13:07:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:05,263 INFO L93 Difference]: Finished difference Result 309531 states and 1343548 transitions. [2018-12-01 13:07:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:07:05,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-01 13:07:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:06,723 INFO L225 Difference]: With dead ends: 309531 [2018-12-01 13:07:06,724 INFO L226 Difference]: Without dead ends: 309531 [2018-12-01 13:07:06,724 INFO L631 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 [2018-12-01 13:07:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309531 states. [2018-12-01 13:07:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309531 to 270479. [2018-12-01 13:07:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270479 states. [2018-12-01 13:07:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270479 states to 270479 states and 1183827 transitions. [2018-12-01 13:07:15,319 INFO L78 Accepts]: Start accepts. Automaton has 270479 states and 1183827 transitions. Word has length 70 [2018-12-01 13:07:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:15,319 INFO L480 AbstractCegarLoop]: Abstraction has 270479 states and 1183827 transitions. [2018-12-01 13:07:15,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:07:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 270479 states and 1183827 transitions. [2018-12-01 13:07:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-01 13:07:15,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:15,503 INFO L402 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] [2018-12-01 13:07:15,503 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:07:15,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1674165454, now seen corresponding path program 1 times [2018-12-01 13:07:15,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:07:16,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:07:16,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:07:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:07:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:07:16,026 INFO L87 Difference]: Start difference. First operand 270479 states and 1183827 transitions. Second operand 5 states. [2018-12-01 13:07:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:18,559 INFO L93 Difference]: Finished difference Result 424271 states and 1839427 transitions. [2018-12-01 13:07:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:07:18,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-01 13:07:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:19,731 INFO L225 Difference]: With dead ends: 424271 [2018-12-01 13:07:19,731 INFO L226 Difference]: Without dead ends: 423527 [2018-12-01 13:07:19,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:07:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423527 states. [2018-12-01 13:07:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423527 to 387899. [2018-12-01 13:07:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387899 states. [2018-12-01 13:07:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387899 states to 387899 states and 1689952 transitions. [2018-12-01 13:07:28,313 INFO L78 Accepts]: Start accepts. Automaton has 387899 states and 1689952 transitions. Word has length 74 [2018-12-01 13:07:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:28,313 INFO L480 AbstractCegarLoop]: Abstraction has 387899 states and 1689952 transitions. [2018-12-01 13:07:28,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:07:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 387899 states and 1689952 transitions. [2018-12-01 13:07:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-01 13:07:28,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:28,597 INFO L402 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] [2018-12-01 13:07:28,597 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:07:28,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 829693583, now seen corresponding path program 1 times [2018-12-01 13:07:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:28,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:28,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:07:28,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:28,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:07:28,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:07:28,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:07:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:07:28,651 INFO L87 Difference]: Start difference. First operand 387899 states and 1689952 transitions. Second operand 7 states. [2018-12-01 13:07:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:35,451 INFO L93 Difference]: Finished difference Result 687523 states and 2963297 transitions. [2018-12-01 13:07:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 13:07:35,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-01 13:07:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:37,900 INFO L225 Difference]: With dead ends: 687523 [2018-12-01 13:07:37,900 INFO L226 Difference]: Without dead ends: 686243 [2018-12-01 13:07:37,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-01 13:07:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686243 states. [2018-12-01 13:07:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686243 to 397515. [2018-12-01 13:07:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397515 states. [2018-12-01 13:07:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397515 states to 397515 states and 1728736 transitions. [2018-12-01 13:07:48,710 INFO L78 Accepts]: Start accepts. Automaton has 397515 states and 1728736 transitions. Word has length 74 [2018-12-01 13:07:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:48,710 INFO L480 AbstractCegarLoop]: Abstraction has 397515 states and 1728736 transitions. [2018-12-01 13:07:48,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:07:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 397515 states and 1728736 transitions. [2018-12-01 13:07:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-01 13:07:49,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:49,534 INFO L402 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] [2018-12-01 13:07:49,534 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:07:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash -756700490, now seen corresponding path program 1 times [2018-12-01 13:07:49,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:07:49,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:49,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:07:49,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:07:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:07:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:07:49,600 INFO L87 Difference]: Start difference. First operand 397515 states and 1728736 transitions. Second operand 7 states. [2018-12-01 13:07:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:56,085 INFO L93 Difference]: Finished difference Result 515847 states and 2230337 transitions. [2018-12-01 13:07:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 13:07:56,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-01 13:07:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:57,549 INFO L225 Difference]: With dead ends: 515847 [2018-12-01 13:07:57,549 INFO L226 Difference]: Without dead ends: 514687 [2018-12-01 13:07:57,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-01 13:07:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514687 states. [2018-12-01 13:08:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514687 to 400655. [2018-12-01 13:08:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400655 states. [2018-12-01 13:08:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400655 states to 400655 states and 1741263 transitions. [2018-12-01 13:08:07,453 INFO L78 Accepts]: Start accepts. Automaton has 400655 states and 1741263 transitions. Word has length 75 [2018-12-01 13:08:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:07,454 INFO L480 AbstractCegarLoop]: Abstraction has 400655 states and 1741263 transitions. [2018-12-01 13:08:07,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:08:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 400655 states and 1741263 transitions. [2018-12-01 13:08:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 13:08:07,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:07,846 INFO L402 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] [2018-12-01 13:08:07,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:08:07,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1674825725, now seen corresponding path program 1 times [2018-12-01 13:08:07,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:07,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:08:07,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:08:07,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:08:07,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:08:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:08:07,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:08:07,907 INFO L87 Difference]: Start difference. First operand 400655 states and 1741263 transitions. Second operand 6 states. [2018-12-01 13:08:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:11,359 INFO L93 Difference]: Finished difference Result 472323 states and 2037105 transitions. [2018-12-01 13:08:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:08:11,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-01 13:08:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:12,653 INFO L225 Difference]: With dead ends: 472323 [2018-12-01 13:08:12,653 INFO L226 Difference]: Without dead ends: 467531 [2018-12-01 13:08:12,653 INFO L631 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 [2018-12-01 13:08:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467531 states. [2018-12-01 13:08:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467531 to 396771. [2018-12-01 13:08:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396771 states. [2018-12-01 13:08:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396771 states to 396771 states and 1724829 transitions. [2018-12-01 13:08:27,496 INFO L78 Accepts]: Start accepts. Automaton has 396771 states and 1724829 transitions. Word has length 77 [2018-12-01 13:08:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:27,496 INFO L480 AbstractCegarLoop]: Abstraction has 396771 states and 1724829 transitions. [2018-12-01 13:08:27,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:08:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 396771 states and 1724829 transitions. [2018-12-01 13:08:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 13:08:27,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:27,883 INFO L402 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] [2018-12-01 13:08:27,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:08:27,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1957976189, now seen corresponding path program 1 times [2018-12-01 13:08:27,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:08:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:08:27,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:08:27,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:08:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:08:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:08:27,949 INFO L87 Difference]: Start difference. First operand 396771 states and 1724829 transitions. Second operand 7 states. [2018-12-01 13:08:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:31,417 INFO L93 Difference]: Finished difference Result 517291 states and 2209451 transitions. [2018-12-01 13:08:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 13:08:31,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-01 13:08:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:32,842 INFO L225 Difference]: With dead ends: 517291 [2018-12-01 13:08:32,842 INFO L226 Difference]: Without dead ends: 517291 [2018-12-01 13:08:32,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-01 13:08:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517291 states. [2018-12-01 13:08:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517291 to 479331. [2018-12-01 13:08:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479331 states. [2018-12-01 13:08:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479331 states to 479331 states and 2060157 transitions. [2018-12-01 13:08:43,390 INFO L78 Accepts]: Start accepts. Automaton has 479331 states and 2060157 transitions. Word has length 77 [2018-12-01 13:08:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:43,390 INFO L480 AbstractCegarLoop]: Abstraction has 479331 states and 2060157 transitions. [2018-12-01 13:08:43,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:08:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 479331 states and 2060157 transitions. [2018-12-01 13:08:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 13:08:43,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:43,865 INFO L402 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] [2018-12-01 13:08:43,865 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:08:43,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -713211708, now seen corresponding path program 1 times [2018-12-01 13:08:43,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:08:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:08:43,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:08:43,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:08:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:08:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:08:43,912 INFO L87 Difference]: Start difference. First operand 479331 states and 2060157 transitions. Second operand 5 states. [2018-12-01 13:08:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:48,105 INFO L93 Difference]: Finished difference Result 145491 states and 577373 transitions. [2018-12-01 13:08:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:08:48,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-01 13:08:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:48,422 INFO L225 Difference]: With dead ends: 145491 [2018-12-01 13:08:48,422 INFO L226 Difference]: Without dead ends: 143099 [2018-12-01 13:08:48,422 INFO L631 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 [2018-12-01 13:08:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143099 states. [2018-12-01 13:08:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143099 to 143039. [2018-12-01 13:08:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143039 states. [2018-12-01 13:08:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143039 states to 143039 states and 568209 transitions. [2018-12-01 13:08:50,633 INFO L78 Accepts]: Start accepts. Automaton has 143039 states and 568209 transitions. Word has length 77 [2018-12-01 13:08:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 143039 states and 568209 transitions. [2018-12-01 13:08:50,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:08:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 143039 states and 568209 transitions. [2018-12-01 13:08:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 13:08:50,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:50,769 INFO L402 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] [2018-12-01 13:08:50,769 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:08:50,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash -101941788, now seen corresponding path program 1 times [2018-12-01 13:08:50,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:50,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:50,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:50,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:08:50,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:08:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:08:50,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:08:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:08:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:08:50,812 INFO L87 Difference]: Start difference. First operand 143039 states and 568209 transitions. Second operand 4 states. [2018-12-01 13:08:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:51,956 INFO L93 Difference]: Finished difference Result 180711 states and 711830 transitions. [2018-12-01 13:08:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:08:51,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-01 13:08:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:52,344 INFO L225 Difference]: With dead ends: 180711 [2018-12-01 13:08:52,344 INFO L226 Difference]: Without dead ends: 180711 [2018-12-01 13:08:52,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:08:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180711 states. [2018-12-01 13:08:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180711 to 148311. [2018-12-01 13:08:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148311 states. [2018-12-01 13:08:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148311 states to 148311 states and 587982 transitions. [2018-12-01 13:08:55,006 INFO L78 Accepts]: Start accepts. Automaton has 148311 states and 587982 transitions. Word has length 87 [2018-12-01 13:08:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:55,006 INFO L480 AbstractCegarLoop]: Abstraction has 148311 states and 587982 transitions. [2018-12-01 13:08:55,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:08:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 148311 states and 587982 transitions. [2018-12-01 13:08:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 13:08:55,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:55,150 INFO L402 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] [2018-12-01 13:08:55,151 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:08:55,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1732558019, now seen corresponding path program 1 times [2018-12-01 13:08:55,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:55,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:55,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:08:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:08:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:08:55,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:08:55,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:08:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:08:55,188 INFO L87 Difference]: Start difference. First operand 148311 states and 587982 transitions. Second operand 4 states. [2018-12-01 13:08:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:56,671 INFO L93 Difference]: Finished difference Result 203302 states and 797948 transitions. [2018-12-01 13:08:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:08:56,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-01 13:08:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:57,157 INFO L225 Difference]: With dead ends: 203302 [2018-12-01 13:08:57,157 INFO L226 Difference]: Without dead ends: 203302 [2018-12-01 13:08:57,157 INFO L631 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 [2018-12-01 13:08:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203302 states. [2018-12-01 13:08:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203302 to 184999. [2018-12-01 13:08:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184999 states. [2018-12-01 13:09:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184999 states to 184999 states and 729750 transitions. [2018-12-01 13:09:00,726 INFO L78 Accepts]: Start accepts. Automaton has 184999 states and 729750 transitions. Word has length 87 [2018-12-01 13:09:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:00,726 INFO L480 AbstractCegarLoop]: Abstraction has 184999 states and 729750 transitions. [2018-12-01 13:09:00,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:09:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 184999 states and 729750 transitions. [2018-12-01 13:09:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 13:09:00,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:00,918 INFO L402 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] [2018-12-01 13:09:00,918 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:00,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash -203102268, now seen corresponding path program 1 times [2018-12-01 13:09:00,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:00,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:00,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:01,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 13:09:01,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 13:09:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 13:09:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:09:01,005 INFO L87 Difference]: Start difference. First operand 184999 states and 729750 transitions. Second operand 8 states. [2018-12-01 13:09:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:02,679 INFO L93 Difference]: Finished difference Result 258409 states and 999798 transitions. [2018-12-01 13:09:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:09:02,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-12-01 13:09:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:03,280 INFO L225 Difference]: With dead ends: 258409 [2018-12-01 13:09:03,281 INFO L226 Difference]: Without dead ends: 256809 [2018-12-01 13:09:03,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:09:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256809 states. [2018-12-01 13:09:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256809 to 194680. [2018-12-01 13:09:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194680 states. [2018-12-01 13:09:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194680 states to 194680 states and 766052 transitions. [2018-12-01 13:09:07,098 INFO L78 Accepts]: Start accepts. Automaton has 194680 states and 766052 transitions. Word has length 87 [2018-12-01 13:09:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:07,099 INFO L480 AbstractCegarLoop]: Abstraction has 194680 states and 766052 transitions. [2018-12-01 13:09:07,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 13:09:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 194680 states and 766052 transitions. [2018-12-01 13:09:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 13:09:07,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:07,306 INFO L402 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] [2018-12-01 13:09:07,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:07,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1047574139, now seen corresponding path program 1 times [2018-12-01 13:09:07,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:07,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:07,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:07,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:07,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:07,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:07,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:07,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:07,372 INFO L87 Difference]: Start difference. First operand 194680 states and 766052 transitions. Second operand 6 states. [2018-12-01 13:09:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:08,691 INFO L93 Difference]: Finished difference Result 205854 states and 805519 transitions. [2018-12-01 13:09:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:09:08,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-01 13:09:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:09,174 INFO L225 Difference]: With dead ends: 205854 [2018-12-01 13:09:09,174 INFO L226 Difference]: Without dead ends: 205854 [2018-12-01 13:09:09,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:09:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205854 states. [2018-12-01 13:09:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205854 to 197947. [2018-12-01 13:09:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197947 states. [2018-12-01 13:09:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197947 states to 197947 states and 777564 transitions. [2018-12-01 13:09:15,721 INFO L78 Accepts]: Start accepts. Automaton has 197947 states and 777564 transitions. Word has length 87 [2018-12-01 13:09:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:15,721 INFO L480 AbstractCegarLoop]: Abstraction has 197947 states and 777564 transitions. [2018-12-01 13:09:15,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 197947 states and 777564 transitions. [2018-12-01 13:09:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 13:09:15,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:15,930 INFO L402 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] [2018-12-01 13:09:15,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:15,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash 902726116, now seen corresponding path program 1 times [2018-12-01 13:09:15,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:15,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:15,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:15,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:15,962 INFO L87 Difference]: Start difference. First operand 197947 states and 777564 transitions. Second operand 6 states. [2018-12-01 13:09:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:16,055 INFO L93 Difference]: Finished difference Result 27307 states and 92036 transitions. [2018-12-01 13:09:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:09:16,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-01 13:09:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:16,086 INFO L225 Difference]: With dead ends: 27307 [2018-12-01 13:09:16,086 INFO L226 Difference]: Without dead ends: 23973 [2018-12-01 13:09:16,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-01 13:09:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23973 states. [2018-12-01 13:09:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23973 to 22488. [2018-12-01 13:09:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22488 states. [2018-12-01 13:09:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22488 states to 22488 states and 76178 transitions. [2018-12-01 13:09:16,345 INFO L78 Accepts]: Start accepts. Automaton has 22488 states and 76178 transitions. Word has length 87 [2018-12-01 13:09:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 22488 states and 76178 transitions. [2018-12-01 13:09:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22488 states and 76178 transitions. [2018-12-01 13:09:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 13:09:16,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:16,367 INFO L402 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, 1, 1, 1, 1] [2018-12-01 13:09:16,367 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:16,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash -899863943, now seen corresponding path program 1 times [2018-12-01 13:09:16,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:16,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:16,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:09:16,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:09:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:09:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:09:16,402 INFO L87 Difference]: Start difference. First operand 22488 states and 76178 transitions. Second operand 5 states. [2018-12-01 13:09:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:16,542 INFO L93 Difference]: Finished difference Result 24138 states and 81193 transitions. [2018-12-01 13:09:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:09:16,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 13:09:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:16,572 INFO L225 Difference]: With dead ends: 24138 [2018-12-01 13:09:16,572 INFO L226 Difference]: Without dead ends: 24138 [2018-12-01 13:09:16,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:09:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24138 states. [2018-12-01 13:09:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24138 to 22678. [2018-12-01 13:09:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22678 states. [2018-12-01 13:09:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22678 states to 22678 states and 76850 transitions. [2018-12-01 13:09:16,832 INFO L78 Accepts]: Start accepts. Automaton has 22678 states and 76850 transitions. Word has length 100 [2018-12-01 13:09:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:16,832 INFO L480 AbstractCegarLoop]: Abstraction has 22678 states and 76850 transitions. [2018-12-01 13:09:16,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:09:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22678 states and 76850 transitions. [2018-12-01 13:09:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 13:09:16,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:16,853 INFO L402 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, 1, 1, 1, 1] [2018-12-01 13:09:16,853 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:16,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1211886702, now seen corresponding path program 1 times [2018-12-01 13:09:16,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:16,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:16,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:09:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:09:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:09:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:09:16,895 INFO L87 Difference]: Start difference. First operand 22678 states and 76850 transitions. Second operand 4 states. [2018-12-01 13:09:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:17,025 INFO L93 Difference]: Finished difference Result 25544 states and 85720 transitions. [2018-12-01 13:09:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:09:17,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 13:09:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:17,059 INFO L225 Difference]: With dead ends: 25544 [2018-12-01 13:09:17,059 INFO L226 Difference]: Without dead ends: 25404 [2018-12-01 13:09:17,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:09:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25404 states. [2018-12-01 13:09:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25404 to 25096. [2018-12-01 13:09:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25096 states. [2018-12-01 13:09:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25096 states to 25096 states and 84428 transitions. [2018-12-01 13:09:17,360 INFO L78 Accepts]: Start accepts. Automaton has 25096 states and 84428 transitions. Word has length 100 [2018-12-01 13:09:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:17,361 INFO L480 AbstractCegarLoop]: Abstraction has 25096 states and 84428 transitions. [2018-12-01 13:09:17,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:09:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 25096 states and 84428 transitions. [2018-12-01 13:09:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 13:09:17,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:17,382 INFO L402 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, 1, 1, 1, 1] [2018-12-01 13:09:17,383 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:17,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash -242305679, now seen corresponding path program 1 times [2018-12-01 13:09:17,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:17,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:17,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:17,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:17,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:09:17,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:09:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:09:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:09:17,421 INFO L87 Difference]: Start difference. First operand 25096 states and 84428 transitions. Second operand 4 states. [2018-12-01 13:09:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:17,711 INFO L93 Difference]: Finished difference Result 30681 states and 103784 transitions. [2018-12-01 13:09:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:09:17,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 13:09:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:17,748 INFO L225 Difference]: With dead ends: 30681 [2018-12-01 13:09:17,748 INFO L226 Difference]: Without dead ends: 30681 [2018-12-01 13:09:17,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:09:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30681 states. [2018-12-01 13:09:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30681 to 24361. [2018-12-01 13:09:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24361 states. [2018-12-01 13:09:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24361 states to 24361 states and 81785 transitions. [2018-12-01 13:09:18,044 INFO L78 Accepts]: Start accepts. Automaton has 24361 states and 81785 transitions. Word has length 100 [2018-12-01 13:09:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:18,045 INFO L480 AbstractCegarLoop]: Abstraction has 24361 states and 81785 transitions. [2018-12-01 13:09:18,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:09:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 24361 states and 81785 transitions. [2018-12-01 13:09:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 13:09:18,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:18,065 INFO L402 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, 1, 1, 1, 1] [2018-12-01 13:09:18,066 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:18,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -978148605, now seen corresponding path program 2 times [2018-12-01 13:09:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:18,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:18,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:09:18,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:09:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:09:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:09:18,103 INFO L87 Difference]: Start difference. First operand 24361 states and 81785 transitions. Second operand 5 states. [2018-12-01 13:09:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:18,302 INFO L93 Difference]: Finished difference Result 26337 states and 87913 transitions. [2018-12-01 13:09:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:09:18,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 13:09:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:18,335 INFO L225 Difference]: With dead ends: 26337 [2018-12-01 13:09:18,335 INFO L226 Difference]: Without dead ends: 26197 [2018-12-01 13:09:18,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:09:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2018-12-01 13:09:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 24171. [2018-12-01 13:09:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24171 states. [2018-12-01 13:09:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24171 states to 24171 states and 81103 transitions. [2018-12-01 13:09:18,609 INFO L78 Accepts]: Start accepts. Automaton has 24171 states and 81103 transitions. Word has length 100 [2018-12-01 13:09:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:18,609 INFO L480 AbstractCegarLoop]: Abstraction has 24171 states and 81103 transitions. [2018-12-01 13:09:18,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:09:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 24171 states and 81103 transitions. [2018-12-01 13:09:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 13:09:18,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:18,630 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:18,630 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:18,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1242911627, now seen corresponding path program 1 times [2018-12-01 13:09:18,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:18,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:18,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:09:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:18,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:18,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:18,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:18,674 INFO L87 Difference]: Start difference. First operand 24171 states and 81103 transitions. Second operand 6 states. [2018-12-01 13:09:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:18,944 INFO L93 Difference]: Finished difference Result 26091 states and 86424 transitions. [2018-12-01 13:09:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:09:18,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 13:09:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:18,976 INFO L225 Difference]: With dead ends: 26091 [2018-12-01 13:09:18,976 INFO L226 Difference]: Without dead ends: 25466 [2018-12-01 13:09:18,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25466 states. [2018-12-01 13:09:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25466 to 25001. [2018-12-01 13:09:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25001 states. [2018-12-01 13:09:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25001 states to 25001 states and 83487 transitions. [2018-12-01 13:09:19,266 INFO L78 Accepts]: Start accepts. Automaton has 25001 states and 83487 transitions. Word has length 102 [2018-12-01 13:09:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:19,266 INFO L480 AbstractCegarLoop]: Abstraction has 25001 states and 83487 transitions. [2018-12-01 13:09:19,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 25001 states and 83487 transitions. [2018-12-01 13:09:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 13:09:19,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:19,289 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:19,289 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:19,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 457828852, now seen corresponding path program 1 times [2018-12-01 13:09:19,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:19,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:19,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:19,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:19,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:19,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:19,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:09:19,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:09:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:09:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:19,341 INFO L87 Difference]: Start difference. First operand 25001 states and 83487 transitions. Second operand 7 states. [2018-12-01 13:09:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:19,608 INFO L93 Difference]: Finished difference Result 26495 states and 88275 transitions. [2018-12-01 13:09:19,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:09:19,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 13:09:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:19,643 INFO L225 Difference]: With dead ends: 26495 [2018-12-01 13:09:19,643 INFO L226 Difference]: Without dead ends: 26495 [2018-12-01 13:09:19,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26495 states. [2018-12-01 13:09:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26495 to 24881. [2018-12-01 13:09:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24881 states. [2018-12-01 13:09:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24881 states to 24881 states and 83156 transitions. [2018-12-01 13:09:19,938 INFO L78 Accepts]: Start accepts. Automaton has 24881 states and 83156 transitions. Word has length 102 [2018-12-01 13:09:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:19,938 INFO L480 AbstractCegarLoop]: Abstraction has 24881 states and 83156 transitions. [2018-12-01 13:09:19,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:09:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 24881 states and 83156 transitions. [2018-12-01 13:09:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 13:09:19,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:19,961 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:19,961 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:19,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1868708372, now seen corresponding path program 1 times [2018-12-01 13:09:19,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:19,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:19,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:19,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:20,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:20,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:09:20,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:09:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:09:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:09:20,012 INFO L87 Difference]: Start difference. First operand 24881 states and 83156 transitions. Second operand 5 states. [2018-12-01 13:09:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:20,198 INFO L93 Difference]: Finished difference Result 22217 states and 74227 transitions. [2018-12-01 13:09:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:09:20,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 13:09:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:20,225 INFO L225 Difference]: With dead ends: 22217 [2018-12-01 13:09:20,225 INFO L226 Difference]: Without dead ends: 22217 [2018-12-01 13:09:20,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22217 states. [2018-12-01 13:09:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22217 to 21732. [2018-12-01 13:09:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21732 states. [2018-12-01 13:09:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21732 states to 21732 states and 72839 transitions. [2018-12-01 13:09:20,465 INFO L78 Accepts]: Start accepts. Automaton has 21732 states and 72839 transitions. Word has length 102 [2018-12-01 13:09:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:20,465 INFO L480 AbstractCegarLoop]: Abstraction has 21732 states and 72839 transitions. [2018-12-01 13:09:20,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:09:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21732 states and 72839 transitions. [2018-12-01 13:09:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 13:09:20,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:20,485 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:20,486 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:20,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1420011733, now seen corresponding path program 1 times [2018-12-01 13:09:20,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:20,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:20,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:20,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:20,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:20,556 INFO L87 Difference]: Start difference. First operand 21732 states and 72839 transitions. Second operand 6 states. [2018-12-01 13:09:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:20,649 INFO L93 Difference]: Finished difference Result 14564 states and 47239 transitions. [2018-12-01 13:09:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:09:20,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 13:09:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:20,666 INFO L225 Difference]: With dead ends: 14564 [2018-12-01 13:09:20,666 INFO L226 Difference]: Without dead ends: 14564 [2018-12-01 13:09:20,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14564 states. [2018-12-01 13:09:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14564 to 12758. [2018-12-01 13:09:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2018-12-01 13:09:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 41637 transitions. [2018-12-01 13:09:20,810 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 41637 transitions. Word has length 102 [2018-12-01 13:09:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:20,810 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 41637 transitions. [2018-12-01 13:09:20,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 41637 transitions. [2018-12-01 13:09:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:20,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:20,821 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:20,821 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:20,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:20,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1941612432, now seen corresponding path program 1 times [2018-12-01 13:09:20,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:20,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:20,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:20,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:09:20,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:09:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:09:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:20,878 INFO L87 Difference]: Start difference. First operand 12758 states and 41637 transitions. Second operand 7 states. [2018-12-01 13:09:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:21,200 INFO L93 Difference]: Finished difference Result 20190 states and 64768 transitions. [2018-12-01 13:09:21,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 13:09:21,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-01 13:09:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:21,223 INFO L225 Difference]: With dead ends: 20190 [2018-12-01 13:09:21,223 INFO L226 Difference]: Without dead ends: 20190 [2018-12-01 13:09:21,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 13:09:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20190 states. [2018-12-01 13:09:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20190 to 14348. [2018-12-01 13:09:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14348 states. [2018-12-01 13:09:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14348 states to 14348 states and 46669 transitions. [2018-12-01 13:09:21,404 INFO L78 Accepts]: Start accepts. Automaton has 14348 states and 46669 transitions. Word has length 104 [2018-12-01 13:09:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:21,405 INFO L480 AbstractCegarLoop]: Abstraction has 14348 states and 46669 transitions. [2018-12-01 13:09:21,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:09:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 14348 states and 46669 transitions. [2018-12-01 13:09:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:21,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:21,417 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:21,417 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:21,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1108590383, now seen corresponding path program 1 times [2018-12-01 13:09:21,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:21,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:21,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:21,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:21,472 INFO L87 Difference]: Start difference. First operand 14348 states and 46669 transitions. Second operand 6 states. [2018-12-01 13:09:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:21,599 INFO L93 Difference]: Finished difference Result 14998 states and 48254 transitions. [2018-12-01 13:09:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 13:09:21,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 13:09:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:21,616 INFO L225 Difference]: With dead ends: 14998 [2018-12-01 13:09:21,616 INFO L226 Difference]: Without dead ends: 14998 [2018-12-01 13:09:21,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 13:09:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14998 states. [2018-12-01 13:09:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14998 to 14348. [2018-12-01 13:09:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14348 states. [2018-12-01 13:09:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14348 states to 14348 states and 46504 transitions. [2018-12-01 13:09:21,769 INFO L78 Accepts]: Start accepts. Automaton has 14348 states and 46504 transitions. Word has length 104 [2018-12-01 13:09:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:21,770 INFO L480 AbstractCegarLoop]: Abstraction has 14348 states and 46504 transitions. [2018-12-01 13:09:21,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14348 states and 46504 transitions. [2018-12-01 13:09:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:21,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:21,782 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:21,782 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:21,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2023589103, now seen corresponding path program 1 times [2018-12-01 13:09:21,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:21,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:21,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:21,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:21,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:09:21,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:09:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:09:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:09:21,832 INFO L87 Difference]: Start difference. First operand 14348 states and 46504 transitions. Second operand 5 states. [2018-12-01 13:09:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:21,969 INFO L93 Difference]: Finished difference Result 16140 states and 52264 transitions. [2018-12-01 13:09:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:09:21,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-01 13:09:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:21,986 INFO L225 Difference]: With dead ends: 16140 [2018-12-01 13:09:21,986 INFO L226 Difference]: Without dead ends: 16012 [2018-12-01 13:09:21,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2018-12-01 13:09:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 12112. [2018-12-01 13:09:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-01 13:09:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 39391 transitions. [2018-12-01 13:09:22,134 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 39391 transitions. Word has length 104 [2018-12-01 13:09:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:22,134 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 39391 transitions. [2018-12-01 13:09:22,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:09:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 39391 transitions. [2018-12-01 13:09:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:22,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:22,145 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:22,145 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:22,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-01 13:09:22,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:22,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:22,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:22,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 13:09:22,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 13:09:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 13:09:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 13:09:22,239 INFO L87 Difference]: Start difference. First operand 12112 states and 39391 transitions. Second operand 10 states. [2018-12-01 13:09:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:22,582 INFO L93 Difference]: Finished difference Result 22916 states and 74990 transitions. [2018-12-01 13:09:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 13:09:22,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-01 13:09:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:22,595 INFO L225 Difference]: With dead ends: 22916 [2018-12-01 13:09:22,595 INFO L226 Difference]: Without dead ends: 11388 [2018-12-01 13:09:22,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-01 13:09:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2018-12-01 13:09:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 11388. [2018-12-01 13:09:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11388 states. [2018-12-01 13:09:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11388 states to 11388 states and 37263 transitions. [2018-12-01 13:09:22,707 INFO L78 Accepts]: Start accepts. Automaton has 11388 states and 37263 transitions. Word has length 104 [2018-12-01 13:09:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:22,707 INFO L480 AbstractCegarLoop]: Abstraction has 11388 states and 37263 transitions. [2018-12-01 13:09:22,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 13:09:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 11388 states and 37263 transitions. [2018-12-01 13:09:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:22,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:22,716 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:22,716 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:22,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-01 13:09:22,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:22,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:22,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:22,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:22,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:22,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:22,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:09:22,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:09:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:09:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:09:22,784 INFO L87 Difference]: Start difference. First operand 11388 states and 37263 transitions. Second operand 7 states. [2018-12-01 13:09:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:23,064 INFO L93 Difference]: Finished difference Result 18978 states and 63024 transitions. [2018-12-01 13:09:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:09:23,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-01 13:09:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:23,073 INFO L225 Difference]: With dead ends: 18978 [2018-12-01 13:09:23,073 INFO L226 Difference]: Without dead ends: 7823 [2018-12-01 13:09:23,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-01 13:09:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2018-12-01 13:09:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2018-12-01 13:09:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7823 states. [2018-12-01 13:09:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 26371 transitions. [2018-12-01 13:09:23,152 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 26371 transitions. Word has length 104 [2018-12-01 13:09:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:23,152 INFO L480 AbstractCegarLoop]: Abstraction has 7823 states and 26371 transitions. [2018-12-01 13:09:23,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:09:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 26371 transitions. [2018-12-01 13:09:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:23,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:23,159 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:23,159 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:23,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-01 13:09:23,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:23,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:09:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:23,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:23,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:23,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:23,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:23,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:23,210 INFO L87 Difference]: Start difference. First operand 7823 states and 26371 transitions. Second operand 6 states. [2018-12-01 13:09:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:23,459 INFO L93 Difference]: Finished difference Result 8743 states and 28913 transitions. [2018-12-01 13:09:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:09:23,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 13:09:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:23,479 INFO L225 Difference]: With dead ends: 8743 [2018-12-01 13:09:23,479 INFO L226 Difference]: Without dead ends: 8743 [2018-12-01 13:09:23,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:09:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2018-12-01 13:09:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8003. [2018-12-01 13:09:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2018-12-01 13:09:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 26854 transitions. [2018-12-01 13:09:23,569 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 26854 transitions. Word has length 104 [2018-12-01 13:09:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 8003 states and 26854 transitions. [2018-12-01 13:09:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 26854 transitions. [2018-12-01 13:09:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:23,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:23,575 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:23,575 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:23,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-01 13:09:23,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:23,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:23,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:23,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:23,621 INFO L87 Difference]: Start difference. First operand 8003 states and 26854 transitions. Second operand 6 states. [2018-12-01 13:09:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:23,760 INFO L93 Difference]: Finished difference Result 8063 states and 26991 transitions. [2018-12-01 13:09:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:09:23,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 13:09:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:23,769 INFO L225 Difference]: With dead ends: 8063 [2018-12-01 13:09:23,769 INFO L226 Difference]: Without dead ends: 7983 [2018-12-01 13:09:23,769 INFO L631 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 [2018-12-01 13:09:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2018-12-01 13:09:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7791. [2018-12-01 13:09:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7791 states. [2018-12-01 13:09:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 26267 transitions. [2018-12-01 13:09:23,848 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 26267 transitions. Word has length 104 [2018-12-01 13:09:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:23,849 INFO L480 AbstractCegarLoop]: Abstraction has 7791 states and 26267 transitions. [2018-12-01 13:09:23,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 26267 transitions. [2018-12-01 13:09:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:23,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:23,855 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:23,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:23,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 1 times [2018-12-01 13:09:23,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:23,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:23,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:09:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:09:23,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:09:23,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:09:23,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:09:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:09:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:09:23,914 INFO L87 Difference]: Start difference. First operand 7791 states and 26267 transitions. Second operand 6 states. [2018-12-01 13:09:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:09:24,009 INFO L93 Difference]: Finished difference Result 7959 states and 26677 transitions. [2018-12-01 13:09:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 13:09:24,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 13:09:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:09:24,018 INFO L225 Difference]: With dead ends: 7959 [2018-12-01 13:09:24,018 INFO L226 Difference]: Without dead ends: 7959 [2018-12-01 13:09:24,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-01 13:09:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2018-12-01 13:09:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7931. [2018-12-01 13:09:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7931 states. [2018-12-01 13:09:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 26604 transitions. [2018-12-01 13:09:24,096 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 26604 transitions. Word has length 104 [2018-12-01 13:09:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:09:24,096 INFO L480 AbstractCegarLoop]: Abstraction has 7931 states and 26604 transitions. [2018-12-01 13:09:24,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:09:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 26604 transitions. [2018-12-01 13:09:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 13:09:24,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:09:24,103 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:09:24,103 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:09:24,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:09:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-01 13:09:24,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:09:24,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:09:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:09:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:09:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:09:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:09:24,144 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 13:09:24,216 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 13:09:24,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 01:09:24 BasicIcfg [2018-12-01 13:09:24,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 13:09:24,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:09:24,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:09:24,217 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:09:24,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:33" (3/4) ... [2018-12-01 13:09:24,219 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 13:09:24,292 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_03351e86-738c-4db5-8a85-464ad216391f/bin-2019/uautomizer/witness.graphml [2018-12-01 13:09:24,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:09:24,293 INFO L168 Benchmark]: Toolchain (without parser) took 231311.75 ms. Allocated memory was 1.0 GB in the beginning and 11.4 GB in the end (delta: 10.4 GB). Free memory was 950.6 MB in the beginning and 8.2 GB in the end (delta: -7.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,294 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:09:24,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,294 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,294 INFO L168 Benchmark]: RCFGBuilder took 337.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,295 INFO L168 Benchmark]: TraceAbstraction took 230509.70 ms. Allocated memory was 1.1 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: -7.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,295 INFO L168 Benchmark]: Witness Printer took 75.48 ms. Allocated memory is still 11.4 GB. Free memory was 8.2 GB in the beginning and 8.2 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:09:24,296 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 230509.70 ms. Allocated memory was 1.1 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: -7.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 75.48 ms. Allocated memory is still 11.4 GB. Free memory was 8.2 GB in the beginning and 8.2 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1204; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1205; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1206; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_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, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_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, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_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, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_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, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_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, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_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, z=1] [L731] 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_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, z=1] [L733] 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 230.4s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 71.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9941 SDtfs, 10560 SDslu, 21924 SDs, 0 SdLazy, 9238 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 103 SyntacticMatches, 24 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479331occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 137.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 1452124 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3230 NumberOfCodeBlocks, 3230 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3089 ConstructedInterpolants, 0 QuantifiedInterpolants, 659634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...