./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.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_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 12:24:31,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:24:31,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:24:31,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:24:31,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:24:31,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:24:31,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:24:31,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:24:31,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:24:31,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:24:31,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:24:31,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:24:31,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:24:31,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:24:31,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:24:31,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:24:31,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:24:31,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:24:31,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:24:31,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:24:31,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:24:31,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:24:31,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:24:31,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:24:31,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:24:31,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:24:31,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:24:31,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:24:31,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:24:31,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:24:31,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:24:31,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:24:31,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:24:31,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:24:31,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:24:31,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:24:31,700 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:24:31,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:24:31,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:24:31,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:24:31,710 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:24:31,710 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:24:31,710 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:24:31,711 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:24:31,712 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:24:31,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:24:31,712 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:24:31,712 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:24:31,713 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:24:31,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:24:31,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:24:31,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:24:31,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:24:31,714 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:24:31,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:24:31,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:24:31,715 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:24:31,716 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan 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 -> Taipan 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 -> 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 [2018-12-09 12:24:31,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:24:31,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:24:31,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:24:31,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:24:31,752 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:24:31,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-09 12:24:31,795 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/data/5edb9376a/763eb1c86af345079f942ef1041ed48e/FLAGbc59256a7 [2018-12-09 12:24:32,162 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:24:32,163 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-09 12:24:32,171 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/data/5edb9376a/763eb1c86af345079f942ef1041ed48e/FLAGbc59256a7 [2018-12-09 12:24:32,531 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/data/5edb9376a/763eb1c86af345079f942ef1041ed48e [2018-12-09 12:24:32,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:24:32,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:24:32,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:24:32,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:24:32,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:24:32,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21df83cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32, skipping insertion in model container [2018-12-09 12:24:32,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:24:32,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:24:32,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:24:32,744 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:24:32,820 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:24:32,848 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:24:32,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32 WrapperNode [2018-12-09 12:24:32,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:24:32,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:24:32,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:24:32,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:24:32,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:24:32,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:24:32,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:24:32,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:24:32,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... [2018-12-09 12:24:32,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:24:32,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:24:32,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:24:32,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:24:32,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/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-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:24:32,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:24:32,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:24:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:24:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:24:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:24:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:24:32,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:24:32,937 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:24:33,241 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:24:33,241 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:24:33,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:33 BoogieIcfgContainer [2018-12-09 12:24:33,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:24:33,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:24:33,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:24:33,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:24:33,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:24:32" (1/3) ... [2018-12-09 12:24:33,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6938070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:24:33, skipping insertion in model container [2018-12-09 12:24:33,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:24:32" (2/3) ... [2018-12-09 12:24:33,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6938070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:24:33, skipping insertion in model container [2018-12-09 12:24:33,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:33" (3/3) ... [2018-12-09 12:24:33,246 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt_false-unreach-call.i [2018-12-09 12:24:33,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:24:33,286 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:24:33,286 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:24:33,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:24:33,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:24:33,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:24:33,316 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:24:33,316 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:24:33,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:24:33,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:24:33,317 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:24:33,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:24:33,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:24:33,324 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-09 12:24:48,651 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-09 12:24:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-09 12:24:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 12:24:48,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:24:48,660 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] [2018-12-09 12:24:48,661 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:24:48,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:24:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-09 12:24:48,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:24:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:24:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:24:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:24:48,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:24:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:24:48,812 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-09 12:24:48,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:24:48,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:24:48,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:24:48,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:24:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:24:48,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:24:48,833 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-09 12:24:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:24:51,452 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-09 12:24:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:24:51,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 12:24:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:24:52,199 INFO L225 Difference]: With dead ends: 233471 [2018-12-09 12:24:52,199 INFO L226 Difference]: Without dead ends: 203721 [2018-12-09 12:24:52,201 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-09 12:24:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-09 12:24:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-09 12:24:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 12:24:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-09 12:24:55,557 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-09 12:24:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:24:55,558 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-09 12:24:55,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:24:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-09 12:24:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:24:55,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:24:55,568 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] [2018-12-09 12:24:55,569 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:24:55,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:24:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-09 12:24:55,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:24:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:24:55,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:24:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:24:55,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:24:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:24:55,632 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-09 12:24:55,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:24:55,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:24:55,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:24:55,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:24:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:24:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:24:55,634 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-09 12:24:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:24:56,551 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-09 12:24:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:24:56,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 12:24:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:24:56,863 INFO L225 Difference]: With dead ends: 118891 [2018-12-09 12:24:56,863 INFO L226 Difference]: Without dead ends: 118891 [2018-12-09 12:24:56,864 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-09 12:24:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-09 12:25:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-09 12:25:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 12:25:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-09 12:25:00,707 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-09 12:25:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:00,707 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-09 12:25:00,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:25:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-09 12:25:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:25:00,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:00,713 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] [2018-12-09 12:25:00,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:00,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-09 12:25:00,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:00,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:00,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:00,766 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-09 12:25:00,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:00,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:25:00,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:00,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:25:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:25:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:00,767 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-09 12:25:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:02,338 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-09 12:25:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:25:02,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-09 12:25:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:03,678 INFO L225 Difference]: With dead ends: 325271 [2018-12-09 12:25:03,678 INFO L226 Difference]: Without dead ends: 324271 [2018-12-09 12:25:03,678 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-09 12:25:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-09 12:25:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-09 12:25:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-09 12:25:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-09 12:25:10,656 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-09 12:25:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:10,656 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-09 12:25:10,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:25:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-09 12:25:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 12:25:10,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:10,661 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] [2018-12-09 12:25:10,661 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:10,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-09 12:25:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:10,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:10,699 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-09 12:25:10,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:10,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:10,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:10,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:10,700 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-09 12:25:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:11,396 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-09 12:25:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:11,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 12:25:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:11,771 INFO L225 Difference]: With dead ends: 163597 [2018-12-09 12:25:11,771 INFO L226 Difference]: Without dead ends: 160992 [2018-12-09 12:25:11,771 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-09 12:25:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-09 12:25:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-09 12:25:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-09 12:25:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-09 12:25:15,512 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-09 12:25:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:15,512 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-09 12:25:15,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-09 12:25:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 12:25:15,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:15,516 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] [2018-12-09 12:25:15,517 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:15,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:15,517 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-09 12:25:15,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:15,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:15,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:15,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-09 12:25:15,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:15,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:25:15,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:15,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:25:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:25:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:15,557 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-09 12:25:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:16,960 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-09 12:25:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:25:16,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 12:25:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:17,710 INFO L225 Difference]: With dead ends: 289848 [2018-12-09 12:25:17,710 INFO L226 Difference]: Without dead ends: 289008 [2018-12-09 12:25:17,710 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-09 12:25:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-09 12:25:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-09 12:25:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-09 12:25:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-09 12:25:23,985 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-09 12:25:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-09 12:25:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:25:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-09 12:25:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:25:24,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:24,005 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] [2018-12-09 12:25:24,005 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:24,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -252934140, now seen corresponding path program 1 times [2018-12-09 12:25:24,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:24,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:24,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:24,048 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-09 12:25:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:25:24,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:24,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:25:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:25:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:25:24,049 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-09 12:25:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:25,922 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-09 12:25:25,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:25:25,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 12:25:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:26,676 INFO L225 Difference]: With dead ends: 292568 [2018-12-09 12:25:26,676 INFO L226 Difference]: Without dead ends: 291728 [2018-12-09 12:25:26,677 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-09 12:25:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-09 12:25:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-09 12:25:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-09 12:25:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-09 12:25:31,155 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-09 12:25:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:31,156 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-09 12:25:31,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:25:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-09 12:25:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:25:31,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:31,212 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] [2018-12-09 12:25:31,212 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:31,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-09 12:25:31,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:31,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:31,260 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-09 12:25:31,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:31,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:31,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:31,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:31,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:31,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:31,261 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-09 12:25:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:32,978 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-09 12:25:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:32,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 12:25:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:33,644 INFO L225 Difference]: With dead ends: 264420 [2018-12-09 12:25:33,644 INFO L226 Difference]: Without dead ends: 263060 [2018-12-09 12:25:33,644 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-09 12:25:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-09 12:25:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-09 12:25:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-09 12:25:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-09 12:25:40,480 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-09 12:25:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:40,480 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-09 12:25:40,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-09 12:25:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:25:40,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:40,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] [2018-12-09 12:25:40,559 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:40,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-09 12:25:40,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:40,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:40,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:40,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:40,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:40,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-09 12:25:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:25:40,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:40,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:25:40,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:25:40,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:40,601 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-09 12:25:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:40,901 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-09 12:25:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:25:40,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 12:25:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:41,047 INFO L225 Difference]: With dead ends: 78044 [2018-12-09 12:25:41,048 INFO L226 Difference]: Without dead ends: 75732 [2018-12-09 12:25:41,048 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-09 12:25:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-09 12:25:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-09 12:25:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-09 12:25:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-09 12:25:42,365 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-09 12:25:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:42,365 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-09 12:25:42,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:25:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-09 12:25:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:25:42,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:42,414 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] [2018-12-09 12:25:42,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:42,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-09 12:25:42,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:42,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:42,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:42,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:42,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:42,459 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-09 12:25:42,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:42,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:42,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:42,460 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-09 12:25:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:42,951 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-09 12:25:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:42,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 12:25:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:43,168 INFO L225 Difference]: With dead ends: 105528 [2018-12-09 12:25:43,168 INFO L226 Difference]: Without dead ends: 105528 [2018-12-09 12:25:43,169 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-09 12:25:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-09 12:25:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-09 12:25:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-09 12:25:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-09 12:25:44,654 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-09 12:25:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:44,654 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-09 12:25:44,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-09 12:25:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:25:44,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:44,708 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] [2018-12-09 12:25:44,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-09 12:25:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:44,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:44,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:44,748 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-09 12:25:44,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:44,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:44,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:44,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:44,749 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-09 12:25:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:45,470 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-09 12:25:45,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:45,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 12:25:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:45,868 INFO L225 Difference]: With dead ends: 113667 [2018-12-09 12:25:45,869 INFO L226 Difference]: Without dead ends: 113667 [2018-12-09 12:25:45,869 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-09 12:25:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-09 12:25:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-09 12:25:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-09 12:25:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-09 12:25:47,334 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-09 12:25:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:47,335 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-09 12:25:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-09 12:25:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:25:47,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:47,405 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] [2018-12-09 12:25:47,405 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:47,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-09 12:25:47,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:47,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:47,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:47,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:47,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:47,492 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-09 12:25:47,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:47,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:25:47,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:47,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:25:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:25:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:25:47,492 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-09 12:25:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:48,753 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-09 12:25:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:25:48,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-09 12:25:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:49,060 INFO L225 Difference]: With dead ends: 155234 [2018-12-09 12:25:49,060 INFO L226 Difference]: Without dead ends: 154210 [2018-12-09 12:25:49,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:25:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-09 12:25:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-09 12:25:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-09 12:25:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-09 12:25:51,059 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-09 12:25:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:51,059 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-09 12:25:51,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:25:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-09 12:25:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:25:51,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:51,141 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] [2018-12-09 12:25:51,142 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:51,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-09 12:25:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:51,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:51,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:51,226 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-09 12:25:51,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:25:51,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:51,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:25:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:25:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:25:51,227 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-09 12:25:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:51,822 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-09 12:25:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:25:51,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:25:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:52,071 INFO L225 Difference]: With dead ends: 124463 [2018-12-09 12:25:52,071 INFO L226 Difference]: Without dead ends: 124463 [2018-12-09 12:25:52,071 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-09 12:25:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-09 12:25:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-09 12:25:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-09 12:25:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-09 12:25:53,898 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-09 12:25:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:53,898 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-09 12:25:53,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:25:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-09 12:25:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:25:53,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:53,985 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] [2018-12-09 12:25:53,985 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:53,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-09 12:25:53,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:53,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:53,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:53,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:54,037 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-09 12:25:54,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:54,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:25:54,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:54,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:25:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:25:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:25:54,038 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 7 states. [2018-12-09 12:25:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:55,131 INFO L93 Difference]: Finished difference Result 141948 states and 558974 transitions. [2018-12-09 12:25:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:25:55,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-12-09 12:25:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:55,401 INFO L225 Difference]: With dead ends: 141948 [2018-12-09 12:25:55,401 INFO L226 Difference]: Without dead ends: 141628 [2018-12-09 12:25:55,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 12:25:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141628 states. [2018-12-09 12:25:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141628 to 125100. [2018-12-09 12:25:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125100 states. [2018-12-09 12:25:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125100 states to 125100 states and 493478 transitions. [2018-12-09 12:25:57,271 INFO L78 Accepts]: Start accepts. Automaton has 125100 states and 493478 transitions. Word has length 78 [2018-12-09 12:25:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:57,271 INFO L480 AbstractCegarLoop]: Abstraction has 125100 states and 493478 transitions. [2018-12-09 12:25:57,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:25:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 125100 states and 493478 transitions. [2018-12-09 12:25:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 12:25:57,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:57,619 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] [2018-12-09 12:25:57,619 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:57,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1971879058, now seen corresponding path program 1 times [2018-12-09 12:25:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:57,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:57,638 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-09 12:25:57,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:57,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:25:57,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:57,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:25:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:25:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:25:57,639 INFO L87 Difference]: Start difference. First operand 125100 states and 493478 transitions. Second operand 3 states. [2018-12-09 12:25:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:58,200 INFO L93 Difference]: Finished difference Result 144460 states and 564710 transitions. [2018-12-09 12:25:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:25:58,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 12:25:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:58,497 INFO L225 Difference]: With dead ends: 144460 [2018-12-09 12:25:58,497 INFO L226 Difference]: Without dead ends: 144460 [2018-12-09 12:25:58,498 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-09 12:25:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144460 states. [2018-12-09 12:26:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144460 to 131356. [2018-12-09 12:26:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131356 states. [2018-12-09 12:26:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131356 states to 131356 states and 515998 transitions. [2018-12-09 12:26:00,689 INFO L78 Accepts]: Start accepts. Automaton has 131356 states and 515998 transitions. Word has length 80 [2018-12-09 12:26:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:00,689 INFO L480 AbstractCegarLoop]: Abstraction has 131356 states and 515998 transitions. [2018-12-09 12:26:00,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:26:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 131356 states and 515998 transitions. [2018-12-09 12:26:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 12:26:00,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:00,807 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] [2018-12-09 12:26:00,807 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:00,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1138385650, now seen corresponding path program 1 times [2018-12-09 12:26:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:00,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:00,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:00,870 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-09 12:26:00,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:00,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:26:00,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:00,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:26:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:26:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:26:00,871 INFO L87 Difference]: Start difference. First operand 131356 states and 515998 transitions. Second operand 8 states. [2018-12-09 12:26:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:01,993 INFO L93 Difference]: Finished difference Result 149612 states and 583830 transitions. [2018-12-09 12:26:01,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 12:26:01,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-09 12:26:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:02,306 INFO L225 Difference]: With dead ends: 149612 [2018-12-09 12:26:02,306 INFO L226 Difference]: Without dead ends: 149292 [2018-12-09 12:26:02,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-09 12:26:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149292 states. [2018-12-09 12:26:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149292 to 134300. [2018-12-09 12:26:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134300 states. [2018-12-09 12:26:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134300 states to 134300 states and 528142 transitions. [2018-12-09 12:26:04,501 INFO L78 Accepts]: Start accepts. Automaton has 134300 states and 528142 transitions. Word has length 84 [2018-12-09 12:26:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:04,501 INFO L480 AbstractCegarLoop]: Abstraction has 134300 states and 528142 transitions. [2018-12-09 12:26:04,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:26:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 134300 states and 528142 transitions. [2018-12-09 12:26:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:26:04,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:04,634 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] [2018-12-09 12:26:04,634 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:04,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash -827137735, now seen corresponding path program 1 times [2018-12-09 12:26:04,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:04,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:04,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:04,676 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-09 12:26:04,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:04,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:26:04,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:04,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:26:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:26:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:26:04,677 INFO L87 Difference]: Start difference. First operand 134300 states and 528142 transitions. Second operand 4 states. [2018-12-09 12:26:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:05,548 INFO L93 Difference]: Finished difference Result 159012 states and 618564 transitions. [2018-12-09 12:26:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:26:05,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 12:26:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:05,864 INFO L225 Difference]: With dead ends: 159012 [2018-12-09 12:26:05,864 INFO L226 Difference]: Without dead ends: 158052 [2018-12-09 12:26:05,864 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-09 12:26:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158052 states. [2018-12-09 12:26:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158052 to 151252. [2018-12-09 12:26:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151252 states. [2018-12-09 12:26:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151252 states to 151252 states and 590508 transitions. [2018-12-09 12:26:08,212 INFO L78 Accepts]: Start accepts. Automaton has 151252 states and 590508 transitions. Word has length 86 [2018-12-09 12:26:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:08,212 INFO L480 AbstractCegarLoop]: Abstraction has 151252 states and 590508 transitions. [2018-12-09 12:26:08,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:26:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 151252 states and 590508 transitions. [2018-12-09 12:26:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:26:08,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:08,384 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] [2018-12-09 12:26:08,384 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1532169274, now seen corresponding path program 1 times [2018-12-09 12:26:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:08,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:08,408 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-09 12:26:08,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:08,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:26:08,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:08,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:26:08,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:26:08,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:26:08,409 INFO L87 Difference]: Start difference. First operand 151252 states and 590508 transitions. Second operand 3 states. [2018-12-09 12:26:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:09,125 INFO L93 Difference]: Finished difference Result 159356 states and 620840 transitions. [2018-12-09 12:26:09,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:26:09,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-09 12:26:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:09,706 INFO L225 Difference]: With dead ends: 159356 [2018-12-09 12:26:09,706 INFO L226 Difference]: Without dead ends: 159356 [2018-12-09 12:26:09,706 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-09 12:26:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159356 states. [2018-12-09 12:26:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159356 to 155280. [2018-12-09 12:26:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155280 states. [2018-12-09 12:26:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155280 states to 155280 states and 605540 transitions. [2018-12-09 12:26:12,186 INFO L78 Accepts]: Start accepts. Automaton has 155280 states and 605540 transitions. Word has length 86 [2018-12-09 12:26:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:12,186 INFO L480 AbstractCegarLoop]: Abstraction has 155280 states and 605540 transitions. [2018-12-09 12:26:12,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:26:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 155280 states and 605540 transitions. [2018-12-09 12:26:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 12:26:12,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:12,350 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-09 12:26:12,351 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1381420627, now seen corresponding path program 1 times [2018-12-09 12:26:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:12,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:12,432 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-09 12:26:12,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:12,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:12,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:12,432 INFO L87 Difference]: Start difference. First operand 155280 states and 605540 transitions. Second operand 6 states. [2018-12-09 12:26:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:13,335 INFO L93 Difference]: Finished difference Result 163731 states and 634865 transitions. [2018-12-09 12:26:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:26:13,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-09 12:26:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:13,675 INFO L225 Difference]: With dead ends: 163731 [2018-12-09 12:26:13,675 INFO L226 Difference]: Without dead ends: 163731 [2018-12-09 12:26:13,676 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-09 12:26:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163731 states. [2018-12-09 12:26:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163731 to 154129. [2018-12-09 12:26:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154129 states. [2018-12-09 12:26:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154129 states to 154129 states and 601338 transitions. [2018-12-09 12:26:16,539 INFO L78 Accepts]: Start accepts. Automaton has 154129 states and 601338 transitions. Word has length 87 [2018-12-09 12:26:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:16,540 INFO L480 AbstractCegarLoop]: Abstraction has 154129 states and 601338 transitions. [2018-12-09 12:26:16,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 154129 states and 601338 transitions. [2018-12-09 12:26:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 12:26:16,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:16,710 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-09 12:26:16,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:16,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash 977886382, now seen corresponding path program 1 times [2018-12-09 12:26:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:16,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:16,763 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-09 12:26:16,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:16,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:16,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:16,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:16,764 INFO L87 Difference]: Start difference. First operand 154129 states and 601338 transitions. Second operand 7 states. [2018-12-09 12:26:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:17,629 INFO L93 Difference]: Finished difference Result 161961 states and 627602 transitions. [2018-12-09 12:26:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:26:17,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-09 12:26:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:17,960 INFO L225 Difference]: With dead ends: 161961 [2018-12-09 12:26:17,960 INFO L226 Difference]: Without dead ends: 161961 [2018-12-09 12:26:17,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:26:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161961 states. [2018-12-09 12:26:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161961 to 149344. [2018-12-09 12:26:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149344 states. [2018-12-09 12:26:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149344 states to 149344 states and 581991 transitions. [2018-12-09 12:26:20,705 INFO L78 Accepts]: Start accepts. Automaton has 149344 states and 581991 transitions. Word has length 87 [2018-12-09 12:26:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:20,705 INFO L480 AbstractCegarLoop]: Abstraction has 149344 states and 581991 transitions. [2018-12-09 12:26:20,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 149344 states and 581991 transitions. [2018-12-09 12:26:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 12:26:20,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:20,887 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-09 12:26:20,888 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:20,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1307652143, now seen corresponding path program 1 times [2018-12-09 12:26:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:20,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:20,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:20,919 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-09 12:26:20,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:20,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:20,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:20,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:20,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:20,920 INFO L87 Difference]: Start difference. First operand 149344 states and 581991 transitions. Second operand 6 states. [2018-12-09 12:26:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:21,014 INFO L93 Difference]: Finished difference Result 24944 states and 82271 transitions. [2018-12-09 12:26:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:26:21,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-09 12:26:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:21,037 INFO L225 Difference]: With dead ends: 24944 [2018-12-09 12:26:21,037 INFO L226 Difference]: Without dead ends: 20548 [2018-12-09 12:26:21,037 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-09 12:26:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2018-12-09 12:26:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 19468. [2018-12-09 12:26:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19468 states. [2018-12-09 12:26:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19468 states to 19468 states and 64369 transitions. [2018-12-09 12:26:21,231 INFO L78 Accepts]: Start accepts. Automaton has 19468 states and 64369 transitions. Word has length 87 [2018-12-09 12:26:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:21,231 INFO L480 AbstractCegarLoop]: Abstraction has 19468 states and 64369 transitions. [2018-12-09 12:26:21,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19468 states and 64369 transitions. [2018-12-09 12:26:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 12:26:21,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:21,245 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] [2018-12-09 12:26:21,245 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:21,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-09 12:26:21,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:21,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:21,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:21,294 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-09 12:26:21,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:21,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:21,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:21,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:21,295 INFO L87 Difference]: Start difference. First operand 19468 states and 64369 transitions. Second operand 6 states. [2018-12-09 12:26:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:21,449 INFO L93 Difference]: Finished difference Result 22458 states and 72381 transitions. [2018-12-09 12:26:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:26:21,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 12:26:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:21,472 INFO L225 Difference]: With dead ends: 22458 [2018-12-09 12:26:21,473 INFO L226 Difference]: Without dead ends: 22458 [2018-12-09 12:26:21,473 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-09 12:26:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2018-12-09 12:26:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 20353. [2018-12-09 12:26:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20353 states. [2018-12-09 12:26:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20353 states to 20353 states and 66492 transitions. [2018-12-09 12:26:21,677 INFO L78 Accepts]: Start accepts. Automaton has 20353 states and 66492 transitions. Word has length 97 [2018-12-09 12:26:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:21,677 INFO L480 AbstractCegarLoop]: Abstraction has 20353 states and 66492 transitions. [2018-12-09 12:26:21,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 20353 states and 66492 transitions. [2018-12-09 12:26:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 12:26:21,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:21,692 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] [2018-12-09 12:26:21,692 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:21,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-09 12:26:21,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:21,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:21,736 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-09 12:26:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:26:21,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:21,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:26:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:26:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:26:21,737 INFO L87 Difference]: Start difference. First operand 20353 states and 66492 transitions. Second operand 5 states. [2018-12-09 12:26:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:21,928 INFO L93 Difference]: Finished difference Result 24276 states and 78291 transitions. [2018-12-09 12:26:21,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:26:21,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 12:26:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:21,954 INFO L225 Difference]: With dead ends: 24276 [2018-12-09 12:26:21,954 INFO L226 Difference]: Without dead ends: 23991 [2018-12-09 12:26:21,955 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-09 12:26:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23991 states. [2018-12-09 12:26:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23991 to 20833. [2018-12-09 12:26:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2018-12-09 12:26:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 67896 transitions. [2018-12-09 12:26:22,169 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 67896 transitions. Word has length 97 [2018-12-09 12:26:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:22,169 INFO L480 AbstractCegarLoop]: Abstraction has 20833 states and 67896 transitions. [2018-12-09 12:26:22,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:26:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 67896 transitions. [2018-12-09 12:26:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:22,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:22,184 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] [2018-12-09 12:26:22,185 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:22,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-09 12:26:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:22,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:22,242 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-09 12:26:22,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:22,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:26:22,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:22,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:26:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:26:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:26:22,243 INFO L87 Difference]: Start difference. First operand 20833 states and 67896 transitions. Second operand 9 states. [2018-12-09 12:26:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:22,786 INFO L93 Difference]: Finished difference Result 37316 states and 119621 transitions. [2018-12-09 12:26:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 12:26:22,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-09 12:26:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:22,823 INFO L225 Difference]: With dead ends: 37316 [2018-12-09 12:26:22,824 INFO L226 Difference]: Without dead ends: 37188 [2018-12-09 12:26:22,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:26:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2018-12-09 12:26:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 23941. [2018-12-09 12:26:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23941 states. [2018-12-09 12:26:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23941 states to 23941 states and 77975 transitions. [2018-12-09 12:26:23,108 INFO L78 Accepts]: Start accepts. Automaton has 23941 states and 77975 transitions. Word has length 99 [2018-12-09 12:26:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:23,108 INFO L480 AbstractCegarLoop]: Abstraction has 23941 states and 77975 transitions. [2018-12-09 12:26:23,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:26:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23941 states and 77975 transitions. [2018-12-09 12:26:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:23,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:23,126 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] [2018-12-09 12:26:23,126 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:23,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-09 12:26:23,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:23,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:23,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:23,199 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-09 12:26:23,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:23,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:23,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:23,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:23,200 INFO L87 Difference]: Start difference. First operand 23941 states and 77975 transitions. Second operand 7 states. [2018-12-09 12:26:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:23,571 INFO L93 Difference]: Finished difference Result 36707 states and 119676 transitions. [2018-12-09 12:26:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:26:23,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 12:26:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:23,611 INFO L225 Difference]: With dead ends: 36707 [2018-12-09 12:26:23,611 INFO L226 Difference]: Without dead ends: 36332 [2018-12-09 12:26:23,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:26:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36332 states. [2018-12-09 12:26:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36332 to 23996. [2018-12-09 12:26:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23996 states. [2018-12-09 12:26:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23996 states to 23996 states and 77959 transitions. [2018-12-09 12:26:23,915 INFO L78 Accepts]: Start accepts. Automaton has 23996 states and 77959 transitions. Word has length 99 [2018-12-09 12:26:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:23,915 INFO L480 AbstractCegarLoop]: Abstraction has 23996 states and 77959 transitions. [2018-12-09 12:26:23,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 23996 states and 77959 transitions. [2018-12-09 12:26:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:23,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:23,935 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] [2018-12-09 12:26:23,935 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:23,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-09 12:26:23,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:23,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:23,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:23,985 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-09 12:26:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:23,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:23,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:23,986 INFO L87 Difference]: Start difference. First operand 23996 states and 77959 transitions. Second operand 6 states. [2018-12-09 12:26:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:24,114 INFO L93 Difference]: Finished difference Result 19682 states and 64219 transitions. [2018-12-09 12:26:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:26:24,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 12:26:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:24,135 INFO L225 Difference]: With dead ends: 19682 [2018-12-09 12:26:24,135 INFO L226 Difference]: Without dead ends: 19682 [2018-12-09 12:26:24,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:26:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19682 states. [2018-12-09 12:26:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19682 to 18282. [2018-12-09 12:26:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2018-12-09 12:26:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 60069 transitions. [2018-12-09 12:26:24,318 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 60069 transitions. Word has length 99 [2018-12-09 12:26:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 18282 states and 60069 transitions. [2018-12-09 12:26:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 60069 transitions. [2018-12-09 12:26:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:24,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:24,332 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] [2018-12-09 12:26:24,333 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 881084081, now seen corresponding path program 1 times [2018-12-09 12:26:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:24,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:24,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:24,386 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-09 12:26:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:24,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:24,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:24,387 INFO L87 Difference]: Start difference. First operand 18282 states and 60069 transitions. Second operand 7 states. [2018-12-09 12:26:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:24,653 INFO L93 Difference]: Finished difference Result 20346 states and 66293 transitions. [2018-12-09 12:26:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:26:24,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 12:26:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:24,674 INFO L225 Difference]: With dead ends: 20346 [2018-12-09 12:26:24,674 INFO L226 Difference]: Without dead ends: 20346 [2018-12-09 12:26:24,674 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-09 12:26:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20346 states. [2018-12-09 12:26:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20346 to 18677. [2018-12-09 12:26:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18677 states. [2018-12-09 12:26:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18677 states to 18677 states and 61180 transitions. [2018-12-09 12:26:24,884 INFO L78 Accepts]: Start accepts. Automaton has 18677 states and 61180 transitions. Word has length 99 [2018-12-09 12:26:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:24,884 INFO L480 AbstractCegarLoop]: Abstraction has 18677 states and 61180 transitions. [2018-12-09 12:26:24,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18677 states and 61180 transitions. [2018-12-09 12:26:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:24,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:24,899 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] [2018-12-09 12:26:24,899 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:24,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -302263216, now seen corresponding path program 1 times [2018-12-09 12:26:24,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:24,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:24,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:24,974 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-09 12:26:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:26:24,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:24,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:26:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:26:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:26:24,975 INFO L87 Difference]: Start difference. First operand 18677 states and 61180 transitions. Second operand 8 states. [2018-12-09 12:26:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:25,252 INFO L93 Difference]: Finished difference Result 23880 states and 77548 transitions. [2018-12-09 12:26:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:26:25,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-09 12:26:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:25,278 INFO L225 Difference]: With dead ends: 23880 [2018-12-09 12:26:25,278 INFO L226 Difference]: Without dead ends: 23752 [2018-12-09 12:26:25,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:26:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23752 states. [2018-12-09 12:26:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23752 to 19006. [2018-12-09 12:26:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19006 states. [2018-12-09 12:26:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19006 states to 19006 states and 61979 transitions. [2018-12-09 12:26:25,491 INFO L78 Accepts]: Start accepts. Automaton has 19006 states and 61979 transitions. Word has length 99 [2018-12-09 12:26:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 19006 states and 61979 transitions. [2018-12-09 12:26:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:26:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19006 states and 61979 transitions. [2018-12-09 12:26:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:25,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:25,505 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] [2018-12-09 12:26:25,505 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:25,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash 659350801, now seen corresponding path program 1 times [2018-12-09 12:26:25,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:25,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:25,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:25,558 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-09 12:26:25,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:25,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:25,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:25,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:25,559 INFO L87 Difference]: Start difference. First operand 19006 states and 61979 transitions. Second operand 7 states. [2018-12-09 12:26:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:25,770 INFO L93 Difference]: Finished difference Result 24317 states and 78794 transitions. [2018-12-09 12:26:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:26:25,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 12:26:25,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:25,795 INFO L225 Difference]: With dead ends: 24317 [2018-12-09 12:26:25,795 INFO L226 Difference]: Without dead ends: 24317 [2018-12-09 12:26:25,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:26:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2018-12-09 12:26:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 20388. [2018-12-09 12:26:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20388 states. [2018-12-09 12:26:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20388 states to 20388 states and 66547 transitions. [2018-12-09 12:26:26,008 INFO L78 Accepts]: Start accepts. Automaton has 20388 states and 66547 transitions. Word has length 99 [2018-12-09 12:26:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:26,008 INFO L480 AbstractCegarLoop]: Abstraction has 20388 states and 66547 transitions. [2018-12-09 12:26:26,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20388 states and 66547 transitions. [2018-12-09 12:26:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:26,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:26,023 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] [2018-12-09 12:26:26,023 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:26,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1904115282, now seen corresponding path program 1 times [2018-12-09 12:26:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:26,067 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-09 12:26:26,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:26,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:26,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:26,067 INFO L87 Difference]: Start difference. First operand 20388 states and 66547 transitions. Second operand 6 states. [2018-12-09 12:26:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:26,152 INFO L93 Difference]: Finished difference Result 33572 states and 111666 transitions. [2018-12-09 12:26:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:26:26,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 12:26:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:26,191 INFO L225 Difference]: With dead ends: 33572 [2018-12-09 12:26:26,191 INFO L226 Difference]: Without dead ends: 33572 [2018-12-09 12:26:26,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33572 states. [2018-12-09 12:26:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33572 to 20248. [2018-12-09 12:26:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20248 states. [2018-12-09 12:26:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20248 states to 20248 states and 66055 transitions. [2018-12-09 12:26:26,455 INFO L78 Accepts]: Start accepts. Automaton has 20248 states and 66055 transitions. Word has length 99 [2018-12-09 12:26:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:26,455 INFO L480 AbstractCegarLoop]: Abstraction has 20248 states and 66055 transitions. [2018-12-09 12:26:26,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20248 states and 66055 transitions. [2018-12-09 12:26:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:26,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:26,471 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] [2018-12-09 12:26:26,471 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:26,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 83704689, now seen corresponding path program 1 times [2018-12-09 12:26:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:26,515 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-09 12:26:26,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:26,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:26:26,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:26,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:26:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:26:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:26:26,515 INFO L87 Difference]: Start difference. First operand 20248 states and 66055 transitions. Second operand 5 states. [2018-12-09 12:26:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:26,634 INFO L93 Difference]: Finished difference Result 30815 states and 102136 transitions. [2018-12-09 12:26:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:26:26,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 12:26:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:26,668 INFO L225 Difference]: With dead ends: 30815 [2018-12-09 12:26:26,669 INFO L226 Difference]: Without dead ends: 30815 [2018-12-09 12:26:26,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30815 states. [2018-12-09 12:26:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30815 to 18556. [2018-12-09 12:26:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18556 states. [2018-12-09 12:26:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18556 states to 18556 states and 60184 transitions. [2018-12-09 12:26:26,898 INFO L78 Accepts]: Start accepts. Automaton has 18556 states and 60184 transitions. Word has length 99 [2018-12-09 12:26:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:26,899 INFO L480 AbstractCegarLoop]: Abstraction has 18556 states and 60184 transitions. [2018-12-09 12:26:26,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:26:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 18556 states and 60184 transitions. [2018-12-09 12:26:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 12:26:26,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:26,913 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] [2018-12-09 12:26:26,913 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:26,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 564421105, now seen corresponding path program 1 times [2018-12-09 12:26:26,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:26,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:26,971 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-09 12:26:26,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:26:26,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:26,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:26:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:26:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:26:26,972 INFO L87 Difference]: Start difference. First operand 18556 states and 60184 transitions. Second operand 6 states. [2018-12-09 12:26:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:27,077 INFO L93 Difference]: Finished difference Result 17084 states and 54568 transitions. [2018-12-09 12:26:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:26:27,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 12:26:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:27,095 INFO L225 Difference]: With dead ends: 17084 [2018-12-09 12:26:27,095 INFO L226 Difference]: Without dead ends: 17084 [2018-12-09 12:26:27,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:26:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17084 states. [2018-12-09 12:26:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17084 to 13763. [2018-12-09 12:26:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13763 states. [2018-12-09 12:26:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 44839 transitions. [2018-12-09 12:26:27,240 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 44839 transitions. Word has length 99 [2018-12-09 12:26:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:27,240 INFO L480 AbstractCegarLoop]: Abstraction has 13763 states and 44839 transitions. [2018-12-09 12:26:27,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:26:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 44839 transitions. [2018-12-09 12:26:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:26:27,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:27,250 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] [2018-12-09 12:26:27,250 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:27,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-09 12:26:27,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:27,282 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-09 12:26:27,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:27,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:26:27,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:27,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:26:27,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:26:27,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:26:27,283 INFO L87 Difference]: Start difference. First operand 13763 states and 44839 transitions. Second operand 5 states. [2018-12-09 12:26:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:27,416 INFO L93 Difference]: Finished difference Result 15555 states and 50599 transitions. [2018-12-09 12:26:27,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:26:27,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 12:26:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:27,434 INFO L225 Difference]: With dead ends: 15555 [2018-12-09 12:26:27,434 INFO L226 Difference]: Without dead ends: 15427 [2018-12-09 12:26:27,434 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-09 12:26:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15427 states. [2018-12-09 12:26:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15427 to 12987. [2018-12-09 12:26:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12987 states. [2018-12-09 12:26:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 42344 transitions. [2018-12-09 12:26:27,572 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 42344 transitions. Word has length 101 [2018-12-09 12:26:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:27,572 INFO L480 AbstractCegarLoop]: Abstraction has 12987 states and 42344 transitions. [2018-12-09 12:26:27,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:26:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 42344 transitions. [2018-12-09 12:26:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:26:27,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:27,581 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] [2018-12-09 12:26:27,582 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:27,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-09 12:26:27,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:27,644 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-09 12:26:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:27,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:27,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:27,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:27,645 INFO L87 Difference]: Start difference. First operand 12987 states and 42344 transitions. Second operand 7 states. [2018-12-09 12:26:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:27,837 INFO L93 Difference]: Finished difference Result 24747 states and 81100 transitions. [2018-12-09 12:26:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:26:27,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 12:26:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:27,851 INFO L225 Difference]: With dead ends: 24747 [2018-12-09 12:26:27,851 INFO L226 Difference]: Without dead ends: 12587 [2018-12-09 12:26:27,851 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-09 12:26:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12587 states. [2018-12-09 12:26:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12587 to 12327. [2018-12-09 12:26:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12327 states. [2018-12-09 12:26:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12327 states to 12327 states and 40424 transitions. [2018-12-09 12:26:27,972 INFO L78 Accepts]: Start accepts. Automaton has 12327 states and 40424 transitions. Word has length 101 [2018-12-09 12:26:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:27,972 INFO L480 AbstractCegarLoop]: Abstraction has 12327 states and 40424 transitions. [2018-12-09 12:26:27,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12327 states and 40424 transitions. [2018-12-09 12:26:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:26:27,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:27,981 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] [2018-12-09 12:26:27,981 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:27,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-09 12:26:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:27,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:28,047 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-09 12:26:28,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:28,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:26:28,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:28,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:26:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:26:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:26:28,048 INFO L87 Difference]: Start difference. First operand 12327 states and 40424 transitions. Second operand 7 states. [2018-12-09 12:26:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:28,257 INFO L93 Difference]: Finished difference Result 20447 states and 67590 transitions. [2018-12-09 12:26:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:26:28,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 12:26:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:28,267 INFO L225 Difference]: With dead ends: 20447 [2018-12-09 12:26:28,267 INFO L226 Difference]: Without dead ends: 8160 [2018-12-09 12:26:28,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-09 12:26:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8160 states. [2018-12-09 12:26:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8160 to 8160. [2018-12-09 12:26:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8160 states. [2018-12-09 12:26:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 27269 transitions. [2018-12-09 12:26:28,345 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 27269 transitions. Word has length 101 [2018-12-09 12:26:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:28,345 INFO L480 AbstractCegarLoop]: Abstraction has 8160 states and 27269 transitions. [2018-12-09 12:26:28,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:26:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 27269 transitions. [2018-12-09 12:26:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:26:28,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:28,351 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] [2018-12-09 12:26:28,352 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:28,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-09 12:26:28,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:28,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:28,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:26:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:28,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:28,442 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-09 12:26:28,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:26:28,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 12:26:28,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:26:28,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:26:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:26:28,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:26:28,443 INFO L87 Difference]: Start difference. First operand 8160 states and 27269 transitions. Second operand 12 states. [2018-12-09 12:26:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:26:28,862 INFO L93 Difference]: Finished difference Result 15532 states and 52246 transitions. [2018-12-09 12:26:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:26:28,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-09 12:26:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:26:28,875 INFO L225 Difference]: With dead ends: 15532 [2018-12-09 12:26:28,875 INFO L226 Difference]: Without dead ends: 10988 [2018-12-09 12:26:28,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 12:26:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10988 states. [2018-12-09 12:26:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10988 to 10308. [2018-12-09 12:26:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10308 states. [2018-12-09 12:26:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10308 states to 10308 states and 33872 transitions. [2018-12-09 12:26:28,974 INFO L78 Accepts]: Start accepts. Automaton has 10308 states and 33872 transitions. Word has length 101 [2018-12-09 12:26:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:26:28,974 INFO L480 AbstractCegarLoop]: Abstraction has 10308 states and 33872 transitions. [2018-12-09 12:26:28,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:26:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 10308 states and 33872 transitions. [2018-12-09 12:26:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 12:26:28,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:26:28,982 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] [2018-12-09 12:26:28,982 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:26:28,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:26:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-09 12:26:28,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:26:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:28,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:26:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:26:28,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:26:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:26:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:26:29,029 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:26:29,106 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:26:29,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:26:29 BasicIcfg [2018-12-09 12:26:29,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:26:29,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:26:29,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:26:29,107 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:26:29,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:24:33" (3/4) ... [2018-12-09 12:26:29,109 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:26:29,182 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6229b986-a706-4a33-b8db-f4fda656347d/bin-2019/utaipan/witness.graphml [2018-12-09 12:26:29,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:26:29,183 INFO L168 Benchmark]: Toolchain (without parser) took 116650.11 ms. Allocated memory was 1.0 GB in the beginning and 8.0 GB in the end (delta: 7.0 GB). Free memory was 945.9 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-09 12:26:29,184 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:26:29,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:26:29,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.96 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-09 12:26:29,184 INFO L168 Benchmark]: Boogie Preprocessor took 19.91 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-09 12:26:29,184 INFO L168 Benchmark]: RCFGBuilder took 339.21 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-09 12:26:29,185 INFO L168 Benchmark]: TraceAbstraction took 115864.22 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 12:26:29,185 INFO L168 Benchmark]: Witness Printer took 75.83 ms. Allocated memory is still 8.0 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:26:29,186 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.96 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 19.91 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 339.21 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 115864.22 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.83 ms. Allocated memory is still 8.0 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 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] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L696] -1 int z = 0; VAL [__unbuffered_cnt=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] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L774] -1 pthread_t t2506; VAL [__unbuffered_cnt=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] [L775] FCALL, FORK -1 pthread_create(&t2506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L776] -1 pthread_t t2507; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK -1 pthread_create(&t2507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L778] -1 pthread_t t2508; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK -1 pthread_create(&t2508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=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] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2] [L752] 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, 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=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=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=2] [L752] 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) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] 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, 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=2] [L754] 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 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=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=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] 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, 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=2] [L756] 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 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L723] 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=2, 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=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 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=2, 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_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 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) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, 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$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] 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=2, 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=2] [L725] 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 [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, 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=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] 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=2, 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=2] [L727] 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 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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=2] [L785] 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, 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=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, 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=2] [L785] 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, 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=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, 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=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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, 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=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, 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=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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, 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=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, 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=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=2] [L796] 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, 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=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=2] [L796] -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) [L797] 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, 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=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=2] [L797] -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)) [L798] 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, 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=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=2] [L798] -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)) [L799] 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, 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=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=2] [L799] -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)) [L800] 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, 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=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=2] [L800] -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)) [L801] 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, 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=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=2] [L801] -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)) [L802] 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, 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=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=2] [L802] -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)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, 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=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=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, 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=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=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, 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=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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, 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=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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, 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=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 115.7s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9656 SDtfs, 10137 SDslu, 23593 SDs, 0 SdLazy, 9319 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 63.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 750208 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3006 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 621199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...