./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_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_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/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 a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 13:08:30,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:08:30,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:08:30,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:08:30,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:08:30,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:08:30,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:08:30,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:08:30,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:08:30,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:08:30,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:08:30,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:08:30,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:08:30,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:08:30,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:08:30,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:08:30,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:08:30,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:08:30,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:08:30,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:08:30,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:08:30,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:08:30,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:08:30,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:08:30,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:08:30,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:08:30,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:08:30,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:08:30,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:08:30,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:08:30,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:08:30,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:08:30,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:08:30,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:08:30,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:08:30,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:08:30,834 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 13:08:30,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:08:30,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:08:30,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 13:08:30,842 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 13:08:30,842 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 13:08:30,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:08:30,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:08:30,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:08:30,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:08:30,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:08:30,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:08:30,845 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 13:08:30,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:08:30,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:08:30,845 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 13:08:30,845 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_6c93450f-682b-4395-82a9-89bca0053295/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 -> a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 [2018-12-02 13:08:30,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:08:30,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:08:30,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:08:30,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:08:30,871 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:08:30,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-12-02 13:08:30,905 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/data/82a303bcb/209953a4b1e24fa59b6ba75a85443381/FLAGf857af35c [2018-12-02 13:08:31,391 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:08:31,391 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-12-02 13:08:31,399 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/data/82a303bcb/209953a4b1e24fa59b6ba75a85443381/FLAGf857af35c [2018-12-02 13:08:31,407 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/data/82a303bcb/209953a4b1e24fa59b6ba75a85443381 [2018-12-02 13:08:31,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:08:31,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:08:31,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:08:31,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:08:31,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:08:31,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31, skipping insertion in model container [2018-12-02 13:08:31,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:08:31,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:08:31,622 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:08:31,630 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:08:31,708 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:08:31,739 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:08:31,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31 WrapperNode [2018-12-02 13:08:31,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:08:31,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:08:31,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:08:31,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:08:31,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:08:31,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:08:31,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:08:31,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:08:31,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... [2018-12-02 13:08:31,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:08:31,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:08:31,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:08:31,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:08:31,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/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-02 13:08:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:08:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:08:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 13:08:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 13:08:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 13:08:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 13:08:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 13:08:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 13:08:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 13:08:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 13:08:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 13:08:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:08:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:08:31,830 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 13:08:32,173 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:08:32,173 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 13:08:32,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:32 BoogieIcfgContainer [2018-12-02 13:08:32,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:08:32,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:08:32,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:08:32,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:08:32,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:08:31" (1/3) ... [2018-12-02 13:08:32,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d848d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:08:32, skipping insertion in model container [2018-12-02 13:08:32,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:31" (2/3) ... [2018-12-02 13:08:32,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d848d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:08:32, skipping insertion in model container [2018-12-02 13:08:32,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:32" (3/3) ... [2018-12-02 13:08:32,179 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc_false-unreach-call.i [2018-12-02 13:08:32,204 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,205 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,205 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,205 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,205 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,205 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,206 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:08:32,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 13:08:32,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:08:32,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 13:08:32,239 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 13:08:32,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:08:32,256 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:08:32,256 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:08:32,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:08:32,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:08:32,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:08:32,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:08:32,257 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:08:32,266 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-02 13:08:46,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-02 13:08:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-02 13:08:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 13:08:46,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:08:46,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:46,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:08:46,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-02 13:08:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:08:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:46,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:08:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:46,186 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-02 13:08:46,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:08:46,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:08:46,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:08:46,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:08:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:08:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:08:46,201 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-02 13:08:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:08:47,429 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-02 13:08:47,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:08:47,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 13:08:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:08:49,775 INFO L225 Difference]: With dead ends: 233474 [2018-12-02 13:08:49,775 INFO L226 Difference]: Without dead ends: 203724 [2018-12-02 13:08:49,776 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-02 13:08:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-02 13:08:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-02 13:08:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-02 13:08:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-02 13:08:53,234 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-02 13:08:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:08:53,235 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-02 13:08:53,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:08:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-02 13:08:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 13:08:53,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:08:53,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:53,241 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:08:53,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-02 13:08:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:08:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:53,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:08:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:53,287 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-02 13:08:53,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:08:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:08:53,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:08:53,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:08:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:08:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:08:53,289 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-02 13:08:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:08:54,207 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-02 13:08:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:08:54,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 13:08:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:08:54,516 INFO L225 Difference]: With dead ends: 118894 [2018-12-02 13:08:54,516 INFO L226 Difference]: Without dead ends: 118894 [2018-12-02 13:08:54,517 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-02 13:08:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-02 13:08:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-02 13:08:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-02 13:08:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-02 13:08:58,658 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-02 13:08:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:08:58,659 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-02 13:08:58,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:08:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-02 13:08:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 13:08:58,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:08:58,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:58,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:08:58,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-02 13:08:58,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:08:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:58,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:58,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:08:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:58,717 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-02 13:08:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:08:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:08:58,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:08:58,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:08:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:08:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:08:58,719 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-02 13:09:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:00,352 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-02 13:09:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:09:00,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-02 13:09:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:01,710 INFO L225 Difference]: With dead ends: 325274 [2018-12-02 13:09:01,711 INFO L226 Difference]: Without dead ends: 324274 [2018-12-02 13:09:01,711 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-02 13:09:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-02 13:09:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-02 13:09:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-02 13:09:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-02 13:09:08,768 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-02 13:09:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:08,768 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-02 13:09:08,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:09:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-02 13:09:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 13:09:08,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:08,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:09:08,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:08,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-02 13:09:08,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:08,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:08,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:08,802 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-02 13:09:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:08,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:09:08,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:08,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:09:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:09:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:09:08,803 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 3 states. [2018-12-02 13:09:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:09,656 INFO L93 Difference]: Finished difference Result 186424 states and 840871 transitions. [2018-12-02 13:09:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:09:09,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 13:09:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:10,597 INFO L225 Difference]: With dead ends: 186424 [2018-12-02 13:09:10,597 INFO L226 Difference]: Without dead ends: 186424 [2018-12-02 13:09:10,597 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-02 13:09:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186424 states. [2018-12-02 13:09:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186424 to 186424. [2018-12-02 13:09:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-02 13:09:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840871 transitions. [2018-12-02 13:09:14,527 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840871 transitions. Word has length 53 [2018-12-02 13:09:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:14,527 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840871 transitions. [2018-12-02 13:09:14,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:09:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840871 transitions. [2018-12-02 13:09:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 13:09:14,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:14,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:09:14,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:14,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -832854916, now seen corresponding path program 1 times [2018-12-02 13:09:14,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:14,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:14,581 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-02 13:09:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:09:14,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:14,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:09:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:09:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:09:14,582 INFO L87 Difference]: Start difference. First operand 186424 states and 840871 transitions. Second operand 5 states. [2018-12-02 13:09:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:18,717 INFO L93 Difference]: Finished difference Result 334054 states and 1500950 transitions. [2018-12-02 13:09:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:09:18,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 13:09:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:19,591 INFO L225 Difference]: With dead ends: 334054 [2018-12-02 13:09:19,591 INFO L226 Difference]: Without dead ends: 333004 [2018-12-02 13:09:19,591 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-02 13:09:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-12-02 13:09:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-12-02 13:09:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-02 13:09:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876429 transitions. [2018-12-02 13:09:24,660 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876429 transitions. Word has length 53 [2018-12-02 13:09:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:24,660 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876429 transitions. [2018-12-02 13:09:24,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:09:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876429 transitions. [2018-12-02 13:09:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 13:09:24,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:24,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:09:24,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:24,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash 651985896, now seen corresponding path program 1 times [2018-12-02 13:09:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:24,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:24,719 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-02 13:09:24,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:24,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:09:24,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:24,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:09:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:09:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:09:24,720 INFO L87 Difference]: Start difference. First operand 194884 states and 876429 transitions. Second operand 6 states. [2018-12-02 13:09:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:26,894 INFO L93 Difference]: Finished difference Result 342294 states and 1509932 transitions. [2018-12-02 13:09:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 13:09:26,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 13:09:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:27,838 INFO L225 Difference]: With dead ends: 342294 [2018-12-02 13:09:27,838 INFO L226 Difference]: Without dead ends: 341294 [2018-12-02 13:09:27,839 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-02 13:09:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341294 states. [2018-12-02 13:09:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341294 to 189134. [2018-12-02 13:09:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189134 states. [2018-12-02 13:09:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189134 states to 189134 states and 850629 transitions. [2018-12-02 13:09:35,923 INFO L78 Accepts]: Start accepts. Automaton has 189134 states and 850629 transitions. Word has length 60 [2018-12-02 13:09:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:35,923 INFO L480 AbstractCegarLoop]: Abstraction has 189134 states and 850629 transitions. [2018-12-02 13:09:35,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:09:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 189134 states and 850629 transitions. [2018-12-02 13:09:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:09:35,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:35,989 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] [2018-12-02 13:09:35,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:35,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -643326952, now seen corresponding path program 1 times [2018-12-02 13:09:35,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:35,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:35,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:36,050 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-02 13:09:36,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:36,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:09:36,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:36,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:09:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:09:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:09:36,051 INFO L87 Difference]: Start difference. First operand 189134 states and 850629 transitions. Second operand 6 states. [2018-12-02 13:09:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:38,351 INFO L93 Difference]: Finished difference Result 402824 states and 1786031 transitions. [2018-12-02 13:09:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:09:38,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 13:09:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:39,473 INFO L225 Difference]: With dead ends: 402824 [2018-12-02 13:09:39,473 INFO L226 Difference]: Without dead ends: 401224 [2018-12-02 13:09:39,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:09:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401224 states. [2018-12-02 13:09:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401224 to 224569. [2018-12-02 13:09:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224569 states. [2018-12-02 13:09:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224569 states to 224569 states and 1000347 transitions. [2018-12-02 13:09:45,790 INFO L78 Accepts]: Start accepts. Automaton has 224569 states and 1000347 transitions. Word has length 67 [2018-12-02 13:09:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:45,790 INFO L480 AbstractCegarLoop]: Abstraction has 224569 states and 1000347 transitions. [2018-12-02 13:09:45,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:09:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 224569 states and 1000347 transitions. [2018-12-02 13:09:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 13:09:45,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:45,890 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] [2018-12-02 13:09:45,890 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:45,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1444492136, now seen corresponding path program 1 times [2018-12-02 13:09:45,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:45,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:45,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:48,754 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-02 13:09:48,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:48,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:09:48,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:09:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:09:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:09:48,755 INFO L87 Difference]: Start difference. First operand 224569 states and 1000347 transitions. Second operand 3 states. [2018-12-02 13:09:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:50,014 INFO L93 Difference]: Finished difference Result 283189 states and 1243373 transitions. [2018-12-02 13:09:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:09:50,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 13:09:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:09:51,000 INFO L225 Difference]: With dead ends: 283189 [2018-12-02 13:09:51,001 INFO L226 Difference]: Without dead ends: 283189 [2018-12-02 13:09:51,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:09:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283189 states. [2018-12-02 13:09:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283189 to 245734. [2018-12-02 13:09:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245734 states. [2018-12-02 13:09:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245734 states to 245734 states and 1089139 transitions. [2018-12-02 13:09:56,182 INFO L78 Accepts]: Start accepts. Automaton has 245734 states and 1089139 transitions. Word has length 69 [2018-12-02 13:09:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:09:56,182 INFO L480 AbstractCegarLoop]: Abstraction has 245734 states and 1089139 transitions. [2018-12-02 13:09:56,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:09:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 245734 states and 1089139 transitions. [2018-12-02 13:09:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:09:56,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:09:56,320 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] [2018-12-02 13:09:56,320 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:09:56,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1764017531, now seen corresponding path program 1 times [2018-12-02 13:09:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:09:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:09:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:09:56,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:09:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:56,372 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-02 13:09:56,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:09:56,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:09:56,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:09:56,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:09:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:09:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:09:56,372 INFO L87 Difference]: Start difference. First operand 245734 states and 1089139 transitions. Second operand 4 states. [2018-12-02 13:09:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:09:58,542 INFO L93 Difference]: Finished difference Result 374149 states and 1647301 transitions. [2018-12-02 13:09:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:09:58,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-02 13:09:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:10:00,104 INFO L225 Difference]: With dead ends: 374149 [2018-12-02 13:10:00,104 INFO L226 Difference]: Without dead ends: 371924 [2018-12-02 13:10:00,105 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-02 13:10:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371924 states. [2018-12-02 13:10:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371924 to 310054. [2018-12-02 13:10:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310054 states. [2018-12-02 13:10:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310054 states to 310054 states and 1375940 transitions. [2018-12-02 13:10:09,989 INFO L78 Accepts]: Start accepts. Automaton has 310054 states and 1375940 transitions. Word has length 73 [2018-12-02 13:10:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:10:09,989 INFO L480 AbstractCegarLoop]: Abstraction has 310054 states and 1375940 transitions. [2018-12-02 13:10:09,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:10:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 310054 states and 1375940 transitions. [2018-12-02 13:10:10,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:10:10,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:10:10,193 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] [2018-12-02 13:10:10,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:10:10,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:10:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash -519253050, now seen corresponding path program 1 times [2018-12-02 13:10:10,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:10:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:10,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:10:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:10,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:10:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:10:10,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-02 13:10:10,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:10:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:10:10,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:10:10,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:10:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:10:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:10:10,283 INFO L87 Difference]: Start difference. First operand 310054 states and 1375940 transitions. Second operand 5 states. [2018-12-02 13:10:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:10:13,404 INFO L93 Difference]: Finished difference Result 485539 states and 2134528 transitions. [2018-12-02 13:10:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:10:13,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 13:10:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:10:14,790 INFO L225 Difference]: With dead ends: 485539 [2018-12-02 13:10:14,790 INFO L226 Difference]: Without dead ends: 484749 [2018-12-02 13:10:14,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:10:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484749 states. [2018-12-02 13:10:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484749 to 444414. [2018-12-02 13:10:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444414 states. [2018-12-02 13:10:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444414 states to 444414 states and 1962978 transitions. [2018-12-02 13:10:30,927 INFO L78 Accepts]: Start accepts. Automaton has 444414 states and 1962978 transitions. Word has length 73 [2018-12-02 13:10:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:10:30,927 INFO L480 AbstractCegarLoop]: Abstraction has 444414 states and 1962978 transitions. [2018-12-02 13:10:30,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:10:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 444414 states and 1962978 transitions. [2018-12-02 13:10:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:10:31,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:10:31,265 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] [2018-12-02 13:10:31,265 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:10:31,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:10:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1363724921, now seen corresponding path program 1 times [2018-12-02 13:10:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:10:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:10:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:31,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:10:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:10:31,316 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-02 13:10:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:10:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:10:31,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:10:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:10:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:10:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:10:31,317 INFO L87 Difference]: Start difference. First operand 444414 states and 1962978 transitions. Second operand 7 states. [2018-12-02 13:10:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:10:35,846 INFO L93 Difference]: Finished difference Result 778794 states and 3403142 transitions. [2018-12-02 13:10:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 13:10:35,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 13:10:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:10:38,514 INFO L225 Difference]: With dead ends: 778794 [2018-12-02 13:10:38,514 INFO L226 Difference]: Without dead ends: 777194 [2018-12-02 13:10:38,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 13:10:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777194 states. [2018-12-02 13:10:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777194 to 453624. [2018-12-02 13:10:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453624 states. [2018-12-02 13:10:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453624 states to 453624 states and 2000501 transitions. [2018-12-02 13:10:51,629 INFO L78 Accepts]: Start accepts. Automaton has 453624 states and 2000501 transitions. Word has length 73 [2018-12-02 13:10:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:10:51,630 INFO L480 AbstractCegarLoop]: Abstraction has 453624 states and 2000501 transitions. [2018-12-02 13:10:51,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:10:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 453624 states and 2000501 transitions. [2018-12-02 13:10:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 13:10:51,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:10:51,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:10:51,959 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:10:51,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:10:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1686899962, now seen corresponding path program 1 times [2018-12-02 13:10:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:10:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:51,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:10:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:10:51,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:10:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:10:52,000 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-02 13:10:52,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:10:52,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:10:52,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:10:52,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:10:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:10:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:10:52,002 INFO L87 Difference]: Start difference. First operand 453624 states and 2000501 transitions. Second operand 4 states. [2018-12-02 13:10:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:10:57,894 INFO L93 Difference]: Finished difference Result 400120 states and 1737408 transitions. [2018-12-02 13:10:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:10:57,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 13:10:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:10:59,072 INFO L225 Difference]: With dead ends: 400120 [2018-12-02 13:10:59,072 INFO L226 Difference]: Without dead ends: 397515 [2018-12-02 13:10:59,073 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-02 13:11:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397515 states. [2018-12-02 13:11:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397515 to 397515. [2018-12-02 13:11:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397515 states. [2018-12-02 13:11:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397515 states to 397515 states and 1728736 transitions. [2018-12-02 13:11:06,918 INFO L78 Accepts]: Start accepts. Automaton has 397515 states and 1728736 transitions. Word has length 74 [2018-12-02 13:11:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:11:06,918 INFO L480 AbstractCegarLoop]: Abstraction has 397515 states and 1728736 transitions. [2018-12-02 13:11:06,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:11:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 397515 states and 1728736 transitions. [2018-12-02 13:11:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 13:11:07,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:11:07,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:11:07,196 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:11:07,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:11:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -756700490, now seen corresponding path program 1 times [2018-12-02 13:11:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:11:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:11:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:07,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:11:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:11:07,269 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-02 13:11:07,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:11:07,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:11:07,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:11:07,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:11:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:11:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:11:07,270 INFO L87 Difference]: Start difference. First operand 397515 states and 1728736 transitions. Second operand 7 states. [2018-12-02 13:11:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:11:10,985 INFO L93 Difference]: Finished difference Result 515847 states and 2230337 transitions. [2018-12-02 13:11:10,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 13:11:10,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-02 13:11:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:11:12,410 INFO L225 Difference]: With dead ends: 515847 [2018-12-02 13:11:12,410 INFO L226 Difference]: Without dead ends: 514687 [2018-12-02 13:11:12,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-02 13:11:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514687 states. [2018-12-02 13:11:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514687 to 400655. [2018-12-02 13:11:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400655 states. [2018-12-02 13:11:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400655 states to 400655 states and 1741263 transitions. [2018-12-02 13:11:26,386 INFO L78 Accepts]: Start accepts. Automaton has 400655 states and 1741263 transitions. Word has length 75 [2018-12-02 13:11:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:11:26,386 INFO L480 AbstractCegarLoop]: Abstraction has 400655 states and 1741263 transitions. [2018-12-02 13:11:26,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:11:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 400655 states and 1741263 transitions. [2018-12-02 13:11:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 13:11:26,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:11:26,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:11:26,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:11:26,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:11:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1674825725, now seen corresponding path program 1 times [2018-12-02 13:11:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:11:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:26,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:11:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:26,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:11:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:11:26,844 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-02 13:11:26,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:11:26,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:11:26,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:11:26,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:11:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:11:26,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:11:26,845 INFO L87 Difference]: Start difference. First operand 400655 states and 1741263 transitions. Second operand 6 states. [2018-12-02 13:11:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:11:30,094 INFO L93 Difference]: Finished difference Result 472323 states and 2037105 transitions. [2018-12-02 13:11:30,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:11:30,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 13:11:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:11:31,352 INFO L225 Difference]: With dead ends: 472323 [2018-12-02 13:11:31,352 INFO L226 Difference]: Without dead ends: 467531 [2018-12-02 13:11:31,352 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-02 13:11:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467531 states. [2018-12-02 13:11:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467531 to 396771. [2018-12-02 13:11:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396771 states. [2018-12-02 13:11:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396771 states to 396771 states and 1724829 transitions. [2018-12-02 13:11:40,402 INFO L78 Accepts]: Start accepts. Automaton has 396771 states and 1724829 transitions. Word has length 77 [2018-12-02 13:11:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:11:40,402 INFO L480 AbstractCegarLoop]: Abstraction has 396771 states and 1724829 transitions. [2018-12-02 13:11:40,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:11:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 396771 states and 1724829 transitions. [2018-12-02 13:11:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 13:11:40,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:11:40,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:11:40,795 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:11:40,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:11:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1957976189, now seen corresponding path program 1 times [2018-12-02 13:11:40,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:11:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:11:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:40,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:11:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:11:40,854 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-02 13:11:40,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:11:40,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:11:40,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:11:40,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:11:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:11:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:11:40,855 INFO L87 Difference]: Start difference. First operand 396771 states and 1724829 transitions. Second operand 7 states. [2018-12-02 13:11:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:11:46,806 INFO L93 Difference]: Finished difference Result 517291 states and 2209451 transitions. [2018-12-02 13:11:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 13:11:46,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-02 13:11:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:11:48,235 INFO L225 Difference]: With dead ends: 517291 [2018-12-02 13:11:48,235 INFO L226 Difference]: Without dead ends: 517291 [2018-12-02 13:11:48,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:11:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517291 states. [2018-12-02 13:11:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517291 to 479331. [2018-12-02 13:11:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479331 states. [2018-12-02 13:11:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479331 states to 479331 states and 2060157 transitions. [2018-12-02 13:11:58,449 INFO L78 Accepts]: Start accepts. Automaton has 479331 states and 2060157 transitions. Word has length 77 [2018-12-02 13:11:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:11:58,449 INFO L480 AbstractCegarLoop]: Abstraction has 479331 states and 2060157 transitions. [2018-12-02 13:11:58,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:11:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 479331 states and 2060157 transitions. [2018-12-02 13:11:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 13:11:58,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:11:58,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:11:58,921 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:11:58,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:11:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -713211708, now seen corresponding path program 1 times [2018-12-02 13:11:58,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:11:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:58,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:11:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:11:58,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:11:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:11:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:11:58,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:11:58,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:11:58,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:11:58,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:11:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:11:58,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:11:58,962 INFO L87 Difference]: Start difference. First operand 479331 states and 2060157 transitions. Second operand 5 states. [2018-12-02 13:12:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:00,133 INFO L93 Difference]: Finished difference Result 145491 states and 577373 transitions. [2018-12-02 13:12:00,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:12:00,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-02 13:12:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:00,456 INFO L225 Difference]: With dead ends: 145491 [2018-12-02 13:12:00,457 INFO L226 Difference]: Without dead ends: 143099 [2018-12-02 13:12:00,457 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-02 13:12:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143099 states. [2018-12-02 13:12:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143099 to 143039. [2018-12-02 13:12:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143039 states. [2018-12-02 13:12:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143039 states to 143039 states and 568209 transitions. [2018-12-02 13:12:02,802 INFO L78 Accepts]: Start accepts. Automaton has 143039 states and 568209 transitions. Word has length 77 [2018-12-02 13:12:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:02,802 INFO L480 AbstractCegarLoop]: Abstraction has 143039 states and 568209 transitions. [2018-12-02 13:12:02,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:12:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 143039 states and 568209 transitions. [2018-12-02 13:12:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 13:12:02,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:02,936 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-02 13:12:02,936 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:02,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -101941788, now seen corresponding path program 1 times [2018-12-02 13:12:02,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:02,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:02,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-02 13:12:02,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:02,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:12:02,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:02,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:12:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:12:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:12:02,972 INFO L87 Difference]: Start difference. First operand 143039 states and 568209 transitions. Second operand 4 states. [2018-12-02 13:12:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:04,021 INFO L93 Difference]: Finished difference Result 180711 states and 711830 transitions. [2018-12-02 13:12:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:12:04,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 13:12:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:04,402 INFO L225 Difference]: With dead ends: 180711 [2018-12-02 13:12:04,402 INFO L226 Difference]: Without dead ends: 180711 [2018-12-02 13:12:04,402 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-02 13:12:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180711 states. [2018-12-02 13:12:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180711 to 148311. [2018-12-02 13:12:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148311 states. [2018-12-02 13:12:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148311 states to 148311 states and 587982 transitions. [2018-12-02 13:12:08,549 INFO L78 Accepts]: Start accepts. Automaton has 148311 states and 587982 transitions. Word has length 87 [2018-12-02 13:12:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:08,549 INFO L480 AbstractCegarLoop]: Abstraction has 148311 states and 587982 transitions. [2018-12-02 13:12:08,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:12:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 148311 states and 587982 transitions. [2018-12-02 13:12:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 13:12:08,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:08,690 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-02 13:12:08,691 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:08,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1732558019, now seen corresponding path program 1 times [2018-12-02 13:12:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:08,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:08,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:08,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:08,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:08,729 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-02 13:12:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:12:08,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:08,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:12:08,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:12:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:12:08,729 INFO L87 Difference]: Start difference. First operand 148311 states and 587982 transitions. Second operand 4 states. [2018-12-02 13:12:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:10,042 INFO L93 Difference]: Finished difference Result 203302 states and 797948 transitions. [2018-12-02 13:12:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:12:10,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 13:12:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:10,493 INFO L225 Difference]: With dead ends: 203302 [2018-12-02 13:12:10,494 INFO L226 Difference]: Without dead ends: 203302 [2018-12-02 13:12:10,494 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-02 13:12:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203302 states. [2018-12-02 13:12:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203302 to 184999. [2018-12-02 13:12:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184999 states. [2018-12-02 13:12:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184999 states to 184999 states and 729750 transitions. [2018-12-02 13:12:13,912 INFO L78 Accepts]: Start accepts. Automaton has 184999 states and 729750 transitions. Word has length 87 [2018-12-02 13:12:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:13,913 INFO L480 AbstractCegarLoop]: Abstraction has 184999 states and 729750 transitions. [2018-12-02 13:12:13,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:12:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 184999 states and 729750 transitions. [2018-12-02 13:12:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 13:12:14,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:14,102 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-02 13:12:14,103 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:14,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash -203102268, now seen corresponding path program 1 times [2018-12-02 13:12:14,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:14,148 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-02 13:12:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:14,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:14,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:14,149 INFO L87 Difference]: Start difference. First operand 184999 states and 729750 transitions. Second operand 6 states. [2018-12-02 13:12:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:14,228 INFO L93 Difference]: Finished difference Result 23095 states and 78958 transitions. [2018-12-02 13:12:14,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:12:14,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 13:12:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:14,254 INFO L225 Difference]: With dead ends: 23095 [2018-12-02 13:12:14,254 INFO L226 Difference]: Without dead ends: 21003 [2018-12-02 13:12:14,255 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-02 13:12:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-12-02 13:12:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 20468. [2018-12-02 13:12:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20468 states. [2018-12-02 13:12:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20468 states to 20468 states and 69983 transitions. [2018-12-02 13:12:14,477 INFO L78 Accepts]: Start accepts. Automaton has 20468 states and 69983 transitions. Word has length 87 [2018-12-02 13:12:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 20468 states and 69983 transitions. [2018-12-02 13:12:14,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20468 states and 69983 transitions. [2018-12-02 13:12:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:12:14,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:14,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:14,494 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:14,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash -899863943, now seen corresponding path program 1 times [2018-12-02 13:12:14,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:14,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:14,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:14,547 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-02 13:12:14,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:12:14,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:14,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:12:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:12:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:12:14,548 INFO L87 Difference]: Start difference. First operand 20468 states and 69983 transitions. Second operand 5 states. [2018-12-02 13:12:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:14,697 INFO L93 Difference]: Finished difference Result 22353 states and 75776 transitions. [2018-12-02 13:12:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:12:14,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-02 13:12:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:14,723 INFO L225 Difference]: With dead ends: 22353 [2018-12-02 13:12:14,723 INFO L226 Difference]: Without dead ends: 22353 [2018-12-02 13:12:14,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:12:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2018-12-02 13:12:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 20878. [2018-12-02 13:12:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20878 states. [2018-12-02 13:12:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20878 states to 20878 states and 71326 transitions. [2018-12-02 13:12:14,947 INFO L78 Accepts]: Start accepts. Automaton has 20878 states and 71326 transitions. Word has length 100 [2018-12-02 13:12:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:14,948 INFO L480 AbstractCegarLoop]: Abstraction has 20878 states and 71326 transitions. [2018-12-02 13:12:14,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:12:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20878 states and 71326 transitions. [2018-12-02 13:12:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:12:14,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:14,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:14,965 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:14,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1211886702, now seen corresponding path program 1 times [2018-12-02 13:12:14,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:14,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:15,005 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-02 13:12:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:15,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:12:15,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:15,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:12:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:12:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:12:15,006 INFO L87 Difference]: Start difference. First operand 20878 states and 71326 transitions. Second operand 4 states. [2018-12-02 13:12:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:15,160 INFO L93 Difference]: Finished difference Result 23729 states and 80154 transitions. [2018-12-02 13:12:15,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:12:15,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 13:12:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:15,188 INFO L225 Difference]: With dead ends: 23729 [2018-12-02 13:12:15,188 INFO L226 Difference]: Without dead ends: 23589 [2018-12-02 13:12:15,188 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-02 13:12:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23589 states. [2018-12-02 13:12:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23589 to 23256. [2018-12-02 13:12:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23256 states. [2018-12-02 13:12:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23256 states to 23256 states and 78787 transitions. [2018-12-02 13:12:15,420 INFO L78 Accepts]: Start accepts. Automaton has 23256 states and 78787 transitions. Word has length 100 [2018-12-02 13:12:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:15,420 INFO L480 AbstractCegarLoop]: Abstraction has 23256 states and 78787 transitions. [2018-12-02 13:12:15,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:12:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 23256 states and 78787 transitions. [2018-12-02 13:12:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:12:15,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:15,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:15,439 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:15,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash -242305679, now seen corresponding path program 1 times [2018-12-02 13:12:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:15,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:15,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:15,474 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-02 13:12:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:15,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:12:15,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:15,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:12:15,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:12:15,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:12:15,475 INFO L87 Difference]: Start difference. First operand 23256 states and 78787 transitions. Second operand 4 states. [2018-12-02 13:12:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:15,692 INFO L93 Difference]: Finished difference Result 28856 states and 98170 transitions. [2018-12-02 13:12:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:12:15,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 13:12:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:16,018 INFO L225 Difference]: With dead ends: 28856 [2018-12-02 13:12:16,018 INFO L226 Difference]: Without dead ends: 28856 [2018-12-02 13:12:16,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:12:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2018-12-02 13:12:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 22521. [2018-12-02 13:12:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22521 states. [2018-12-02 13:12:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22521 states to 22521 states and 76129 transitions. [2018-12-02 13:12:16,280 INFO L78 Accepts]: Start accepts. Automaton has 22521 states and 76129 transitions. Word has length 100 [2018-12-02 13:12:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:16,281 INFO L480 AbstractCegarLoop]: Abstraction has 22521 states and 76129 transitions. [2018-12-02 13:12:16,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:12:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22521 states and 76129 transitions. [2018-12-02 13:12:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:12:16,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:16,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:16,298 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:16,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -978148605, now seen corresponding path program 2 times [2018-12-02 13:12:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:16,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:16,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:16,352 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-02 13:12:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:12:16,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:16,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:12:16,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:12:16,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:12:16,353 INFO L87 Difference]: Start difference. First operand 22521 states and 76129 transitions. Second operand 5 states. [2018-12-02 13:12:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:16,539 INFO L93 Difference]: Finished difference Result 24497 states and 82257 transitions. [2018-12-02 13:12:16,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:12:16,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-02 13:12:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:16,568 INFO L225 Difference]: With dead ends: 24497 [2018-12-02 13:12:16,568 INFO L226 Difference]: Without dead ends: 24357 [2018-12-02 13:12:16,568 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-02 13:12:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24357 states. [2018-12-02 13:12:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24357 to 22151. [2018-12-02 13:12:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22151 states. [2018-12-02 13:12:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22151 states to 22151 states and 74898 transitions. [2018-12-02 13:12:16,799 INFO L78 Accepts]: Start accepts. Automaton has 22151 states and 74898 transitions. Word has length 100 [2018-12-02 13:12:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:16,799 INFO L480 AbstractCegarLoop]: Abstraction has 22151 states and 74898 transitions. [2018-12-02 13:12:16,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:12:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 22151 states and 74898 transitions. [2018-12-02 13:12:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:12:16,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:16,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:16,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:16,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1242911627, now seen corresponding path program 1 times [2018-12-02 13:12:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:16,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:12:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:16,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:16,872 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-02 13:12:16,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:16,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:16,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:16,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:16,873 INFO L87 Difference]: Start difference. First operand 22151 states and 74898 transitions. Second operand 6 states. [2018-12-02 13:12:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:17,130 INFO L93 Difference]: Finished difference Result 24026 states and 80153 transitions. [2018-12-02 13:12:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:12:17,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 13:12:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:17,157 INFO L225 Difference]: With dead ends: 24026 [2018-12-02 13:12:17,158 INFO L226 Difference]: Without dead ends: 23451 [2018-12-02 13:12:17,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:12:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23451 states. [2018-12-02 13:12:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23451 to 22976. [2018-12-02 13:12:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22976 states. [2018-12-02 13:12:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22976 states to 22976 states and 77268 transitions. [2018-12-02 13:12:17,401 INFO L78 Accepts]: Start accepts. Automaton has 22976 states and 77268 transitions. Word has length 102 [2018-12-02 13:12:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:17,401 INFO L480 AbstractCegarLoop]: Abstraction has 22976 states and 77268 transitions. [2018-12-02 13:12:17,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22976 states and 77268 transitions. [2018-12-02 13:12:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:12:17,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:17,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:17,421 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:17,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash 457828852, now seen corresponding path program 1 times [2018-12-02 13:12:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:17,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:17,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:17,484 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-02 13:12:17,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:17,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:12:17,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:17,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:12:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:12:17,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:12:17,485 INFO L87 Difference]: Start difference. First operand 22976 states and 77268 transitions. Second operand 7 states. [2018-12-02 13:12:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:17,740 INFO L93 Difference]: Finished difference Result 24465 states and 82047 transitions. [2018-12-02 13:12:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:12:17,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 13:12:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:17,768 INFO L225 Difference]: With dead ends: 24465 [2018-12-02 13:12:17,768 INFO L226 Difference]: Without dead ends: 24465 [2018-12-02 13:12:17,768 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-02 13:12:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2018-12-02 13:12:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 22861. [2018-12-02 13:12:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22861 states. [2018-12-02 13:12:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 76956 transitions. [2018-12-02 13:12:18,084 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 76956 transitions. Word has length 102 [2018-12-02 13:12:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:18,084 INFO L480 AbstractCegarLoop]: Abstraction has 22861 states and 76956 transitions. [2018-12-02 13:12:18,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:12:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 76956 transitions. [2018-12-02 13:12:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:12:18,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:18,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:18,103 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1868708372, now seen corresponding path program 1 times [2018-12-02 13:12:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:18,160 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-02 13:12:18,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:18,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:12:18,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:18,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:12:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:12:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:12:18,161 INFO L87 Difference]: Start difference. First operand 22861 states and 76956 transitions. Second operand 5 states. [2018-12-02 13:12:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:18,292 INFO L93 Difference]: Finished difference Result 20572 states and 69257 transitions. [2018-12-02 13:12:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:12:18,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 13:12:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:18,316 INFO L225 Difference]: With dead ends: 20572 [2018-12-02 13:12:18,316 INFO L226 Difference]: Without dead ends: 20572 [2018-12-02 13:12:18,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20572 states. [2018-12-02 13:12:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20572 to 20102. [2018-12-02 13:12:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2018-12-02 13:12:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 67911 transitions. [2018-12-02 13:12:18,529 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 67911 transitions. Word has length 102 [2018-12-02 13:12:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:18,529 INFO L480 AbstractCegarLoop]: Abstraction has 20102 states and 67911 transitions. [2018-12-02 13:12:18,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:12:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 67911 transitions. [2018-12-02 13:12:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:12:18,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:18,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:18,547 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:18,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1420011733, now seen corresponding path program 1 times [2018-12-02 13:12:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:18,626 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-02 13:12:18,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:18,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:18,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:18,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:18,627 INFO L87 Difference]: Start difference. First operand 20102 states and 67911 transitions. Second operand 6 states. [2018-12-02 13:12:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:18,761 INFO L93 Difference]: Finished difference Result 12934 states and 42375 transitions. [2018-12-02 13:12:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:12:18,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 13:12:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:18,776 INFO L225 Difference]: With dead ends: 12934 [2018-12-02 13:12:18,776 INFO L226 Difference]: Without dead ends: 12934 [2018-12-02 13:12:18,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:12:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2018-12-02 13:12:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11445. [2018-12-02 13:12:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11445 states. [2018-12-02 13:12:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11445 states to 11445 states and 37761 transitions. [2018-12-02 13:12:18,896 INFO L78 Accepts]: Start accepts. Automaton has 11445 states and 37761 transitions. Word has length 102 [2018-12-02 13:12:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:18,896 INFO L480 AbstractCegarLoop]: Abstraction has 11445 states and 37761 transitions. [2018-12-02 13:12:18,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11445 states and 37761 transitions. [2018-12-02 13:12:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:18,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:18,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:18,905 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:18,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2018-12-02 13:12:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:18,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:18,941 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-02 13:12:18,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:18,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:12:18,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:18,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:12:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:12:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:12:18,941 INFO L87 Difference]: Start difference. First operand 11445 states and 37761 transitions. Second operand 7 states. [2018-12-02 13:12:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:19,246 INFO L93 Difference]: Finished difference Result 18627 states and 60109 transitions. [2018-12-02 13:12:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:12:19,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-02 13:12:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:19,266 INFO L225 Difference]: With dead ends: 18627 [2018-12-02 13:12:19,266 INFO L226 Difference]: Without dead ends: 18499 [2018-12-02 13:12:19,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 13:12:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18499 states. [2018-12-02 13:12:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18499 to 14353. [2018-12-02 13:12:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14353 states. [2018-12-02 13:12:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14353 states to 14353 states and 46923 transitions. [2018-12-02 13:12:19,433 INFO L78 Accepts]: Start accepts. Automaton has 14353 states and 46923 transitions. Word has length 104 [2018-12-02 13:12:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:19,433 INFO L480 AbstractCegarLoop]: Abstraction has 14353 states and 46923 transitions. [2018-12-02 13:12:19,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:12:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14353 states and 46923 transitions. [2018-12-02 13:12:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:19,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:19,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:19,446 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2018-12-02 13:12:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:19,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:19,498 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-02 13:12:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:19,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:19,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:19,500 INFO L87 Difference]: Start difference. First operand 14353 states and 46923 transitions. Second operand 6 states. [2018-12-02 13:12:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:19,620 INFO L93 Difference]: Finished difference Result 14593 states and 47275 transitions. [2018-12-02 13:12:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:12:19,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 13:12:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:19,635 INFO L225 Difference]: With dead ends: 14593 [2018-12-02 13:12:19,635 INFO L226 Difference]: Without dead ends: 14593 [2018-12-02 13:12:19,636 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-02 13:12:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2018-12-02 13:12:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 14203. [2018-12-02 13:12:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14203 states. [2018-12-02 13:12:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14203 states to 14203 states and 46213 transitions. [2018-12-02 13:12:19,781 INFO L78 Accepts]: Start accepts. Automaton has 14203 states and 46213 transitions. Word has length 104 [2018-12-02 13:12:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:19,781 INFO L480 AbstractCegarLoop]: Abstraction has 14203 states and 46213 transitions. [2018-12-02 13:12:19,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14203 states and 46213 transitions. [2018-12-02 13:12:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:19,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:19,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:19,794 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:19,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2018-12-02 13:12:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:19,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:19,834 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-02 13:12:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:19,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:12:19,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:19,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:12:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:12:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:12:19,835 INFO L87 Difference]: Start difference. First operand 14203 states and 46213 transitions. Second operand 5 states. [2018-12-02 13:12:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:19,979 INFO L93 Difference]: Finished difference Result 15995 states and 51973 transitions. [2018-12-02 13:12:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:12:19,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-02 13:12:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:19,996 INFO L225 Difference]: With dead ends: 15995 [2018-12-02 13:12:19,996 INFO L226 Difference]: Without dead ends: 15867 [2018-12-02 13:12:19,996 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-02 13:12:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2018-12-02 13:12:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 11917. [2018-12-02 13:12:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11917 states. [2018-12-02 13:12:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 38975 transitions. [2018-12-02 13:12:20,156 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 38975 transitions. Word has length 104 [2018-12-02 13:12:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:20,157 INFO L480 AbstractCegarLoop]: Abstraction has 11917 states and 38975 transitions. [2018-12-02 13:12:20,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:12:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 38975 transitions. [2018-12-02 13:12:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:20,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:20,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:20,166 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:20,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1146708689, now seen corresponding path program 1 times [2018-12-02 13:12:20,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:20,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:20,219 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-02 13:12:20,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:20,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:20,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:20,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:20,220 INFO L87 Difference]: Start difference. First operand 11917 states and 38975 transitions. Second operand 6 states. [2018-12-02 13:12:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:20,362 INFO L93 Difference]: Finished difference Result 13633 states and 44061 transitions. [2018-12-02 13:12:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:12:20,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 13:12:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:20,377 INFO L225 Difference]: With dead ends: 13633 [2018-12-02 13:12:20,377 INFO L226 Difference]: Without dead ends: 13633 [2018-12-02 13:12:20,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:12:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2018-12-02 13:12:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 12112. [2018-12-02 13:12:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-02 13:12:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 39391 transitions. [2018-12-02 13:12:20,500 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 39391 transitions. Word has length 104 [2018-12-02 13:12:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 39391 transitions. [2018-12-02 13:12:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 39391 transitions. [2018-12-02 13:12:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:20,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:20,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:20,510 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:20,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-02 13:12:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:20,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:20,587 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-02 13:12:20,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:20,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 13:12:20,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:12:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:12:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:12:20,588 INFO L87 Difference]: Start difference. First operand 12112 states and 39391 transitions. Second operand 10 states. [2018-12-02 13:12:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:20,918 INFO L93 Difference]: Finished difference Result 22916 states and 74990 transitions. [2018-12-02 13:12:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:12:20,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-02 13:12:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:20,931 INFO L225 Difference]: With dead ends: 22916 [2018-12-02 13:12:20,931 INFO L226 Difference]: Without dead ends: 11388 [2018-12-02 13:12:20,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 13:12:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2018-12-02 13:12:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 11388. [2018-12-02 13:12:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11388 states. [2018-12-02 13:12:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11388 states to 11388 states and 37263 transitions. [2018-12-02 13:12:21,044 INFO L78 Accepts]: Start accepts. Automaton has 11388 states and 37263 transitions. Word has length 104 [2018-12-02 13:12:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 11388 states and 37263 transitions. [2018-12-02 13:12:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:12:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11388 states and 37263 transitions. [2018-12-02 13:12:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:21,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:21,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:21,053 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:21,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-02 13:12:21,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:21,107 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-02 13:12:21,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:21,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:12:21,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:12:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:12:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:12:21,108 INFO L87 Difference]: Start difference. First operand 11388 states and 37263 transitions. Second operand 7 states. [2018-12-02 13:12:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:21,303 INFO L93 Difference]: Finished difference Result 18978 states and 63024 transitions. [2018-12-02 13:12:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:12:21,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-02 13:12:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:21,313 INFO L225 Difference]: With dead ends: 18978 [2018-12-02 13:12:21,313 INFO L226 Difference]: Without dead ends: 7823 [2018-12-02 13:12:21,313 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-02 13:12:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2018-12-02 13:12:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2018-12-02 13:12:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7823 states. [2018-12-02 13:12:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 26371 transitions. [2018-12-02 13:12:21,387 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 26371 transitions. Word has length 104 [2018-12-02 13:12:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 7823 states and 26371 transitions. [2018-12-02 13:12:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:12:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 26371 transitions. [2018-12-02 13:12:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:21,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:21,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:21,393 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:21,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-02 13:12:21,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:12:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:21,448 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-02 13:12:21,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:21,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:21,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:21,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:21,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:21,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:21,448 INFO L87 Difference]: Start difference. First operand 7823 states and 26371 transitions. Second operand 6 states. [2018-12-02 13:12:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:21,644 INFO L93 Difference]: Finished difference Result 8743 states and 28913 transitions. [2018-12-02 13:12:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:12:21,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 13:12:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:21,654 INFO L225 Difference]: With dead ends: 8743 [2018-12-02 13:12:21,654 INFO L226 Difference]: Without dead ends: 8743 [2018-12-02 13:12:21,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:12:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2018-12-02 13:12:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8003. [2018-12-02 13:12:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2018-12-02 13:12:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 26854 transitions. [2018-12-02 13:12:21,733 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 26854 transitions. Word has length 104 [2018-12-02 13:12:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:21,733 INFO L480 AbstractCegarLoop]: Abstraction has 8003 states and 26854 transitions. [2018-12-02 13:12:21,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 26854 transitions. [2018-12-02 13:12:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:21,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:21,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:21,740 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:21,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-02 13:12:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:21,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:21,809 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-02 13:12:21,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:21,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:21,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:21,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:21,810 INFO L87 Difference]: Start difference. First operand 8003 states and 26854 transitions. Second operand 6 states. [2018-12-02 13:12:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:21,946 INFO L93 Difference]: Finished difference Result 8063 states and 26991 transitions. [2018-12-02 13:12:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:12:21,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 13:12:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:21,955 INFO L225 Difference]: With dead ends: 8063 [2018-12-02 13:12:21,955 INFO L226 Difference]: Without dead ends: 7983 [2018-12-02 13:12:21,955 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-02 13:12:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2018-12-02 13:12:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7791. [2018-12-02 13:12:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7791 states. [2018-12-02 13:12:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 26267 transitions. [2018-12-02 13:12:22,029 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 26267 transitions. Word has length 104 [2018-12-02 13:12:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:22,030 INFO L480 AbstractCegarLoop]: Abstraction has 7791 states and 26267 transitions. [2018-12-02 13:12:22,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 26267 transitions. [2018-12-02 13:12:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:22,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:22,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:22,036 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:22,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 2 times [2018-12-02 13:12:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:22,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:12:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:22,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:12:22,104 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-02 13:12:22,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:12:22,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:12:22,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:12:22,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:12:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:12:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:12:22,104 INFO L87 Difference]: Start difference. First operand 7791 states and 26267 transitions. Second operand 6 states. [2018-12-02 13:12:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:12:22,200 INFO L93 Difference]: Finished difference Result 7959 states and 26677 transitions. [2018-12-02 13:12:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:12:22,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 13:12:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:12:22,210 INFO L225 Difference]: With dead ends: 7959 [2018-12-02 13:12:22,210 INFO L226 Difference]: Without dead ends: 7959 [2018-12-02 13:12:22,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 13:12:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2018-12-02 13:12:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7931. [2018-12-02 13:12:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7931 states. [2018-12-02 13:12:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 26604 transitions. [2018-12-02 13:12:22,289 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 26604 transitions. Word has length 104 [2018-12-02 13:12:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:12:22,290 INFO L480 AbstractCegarLoop]: Abstraction has 7931 states and 26604 transitions. [2018-12-02 13:12:22,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:12:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 26604 transitions. [2018-12-02 13:12:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:12:22,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:12:22,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:12:22,296 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:12:22,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:12:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-02 13:12:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:12:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:22,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:12:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:12:22,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:12:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:12:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:12:22,334 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 13:12:22,402 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 13:12:22,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:12:22 BasicIcfg [2018-12-02 13:12:22,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:12:22,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:12:22,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:12:22,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:12:22,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:32" (3/4) ... [2018-12-02 13:12:22,405 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 13:12:22,490 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c93450f-682b-4395-82a9-89bca0053295/bin-2019/utaipan/witness.graphml [2018-12-02 13:12:22,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:12:22,491 INFO L168 Benchmark]: Toolchain (without parser) took 231081.98 ms. Allocated memory was 1.0 GB in the beginning and 10.6 GB in the end (delta: 9.6 GB). Free memory was 953.5 MB in the beginning and 7.5 GB in the end (delta: -6.5 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-12-02 13:12:22,492 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:12:22,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -117.8 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-12-02 13:12:22,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.22 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-02 13:12:22,493 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 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-02 13:12:22,493 INFO L168 Benchmark]: RCFGBuilder took 378.60 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:12:22,493 INFO L168 Benchmark]: TraceAbstraction took 230228.83 ms. Allocated memory was 1.1 GB in the beginning and 10.6 GB in the end (delta: 9.5 GB). Free memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: -5.0 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-02 13:12:22,494 INFO L168 Benchmark]: Witness Printer took 86.83 ms. Allocated memory was 10.6 GB in the beginning and 10.6 GB in the end (delta: 11.5 MB). Free memory was 6.0 GB in the beginning and 7.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:12:22,495 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -117.8 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.22 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 20.01 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 378.60 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 230228.83 ms. Allocated memory was 1.1 GB in the beginning and 10.6 GB in the end (delta: 9.5 GB). Free memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: -5.0 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 86.83 ms. Allocated memory was 10.6 GB in the beginning and 10.6 GB in the end (delta: 11.5 MB). Free memory was 6.0 GB in the beginning and 7.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1213; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1214; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1215; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 230.1s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 71.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9364 SDtfs, 9818 SDslu, 20196 SDs, 0 SdLazy, 8179 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 100 SyntacticMatches, 19 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479331occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 136.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 1452249 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3019 ConstructedInterpolants, 0 QuantifiedInterpolants, 637638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...